Visibility with reflection

Authors:
Boris Aronov;Alan R. Davis;Tamal K. Dey;Sudebkumar P. Pal;D. Chithra Prasad
Affiliations:
Computer Science Department, Polytechnic University, Brooklyn, NY;Div. of Computer Science, Math. and Science, St. Johns University, Jamaica, NY;Dept. of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, Kharagpur 721302, India;Dept. of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, Kharagpur 721302, India;Dept. of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, Kharagpur 721302, India
Venue:
Proceedings of the eleventh annual symposium on Computational geometry
Year:
1995

Billiards in polygons

Physica D
Computational complexity of art gallery problems

IEEE Transactions on Information Theory
Fast ray tracing by ray classification

SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Art gallery theorems and algorithms

Art gallery theorems and algorithms
Computing the link center of a simple polygon

Discrete & Computational Geometry - ACM Symposium on Computational Geometry, Waterloo
An efficient algorithm for link-distance problems

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
On visible surface generation by a priori tree structures

SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Minimum link paths in polygons and related problems

Minimum link paths in polygons and related problems

Optimal guard placement problem under l-visibility

ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I

Hi-index	0.00