Linear time algorithms for visibility and shortest path problems inside simple polygons
SCG '86 Proceedings of the second annual symposium on Computational geometry
Visibility and intersectin problems in plane geometry
SCG '85 Proceedings of the first annual symposium on Computational geometry
Intersecting is easier than sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Ray shooting and other applications of spanning trees with low stabbing number
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Minimum-link paths among obstacles in the plane
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Enumeration and visibility problems in integer lattices (extended abstract)
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Efficient computation of query point visibility in polygons with holes
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
A linear time algorithm to remove winding of a simple polygon
Computational Geometry: Theory and Applications
Segmenting object space by geometric reference structures
ACM Transactions on Sensor Networks (TOSN)
Query point visibility computation in polygons with holes
Computational Geometry: Theory and Applications
Visibility maps of segments and triangles in 3D
Computational Geometry: Theory and Applications
Visibility queries in a polygonal region
Computational Geometry: Theory and Applications
Space---Query-Time Tradeoff for Computing the Visibility Polygon
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
A linear time algorithm to remove winding of a simple polygon
Computational Geometry: Theory and Applications
Weak visibility of two objects in planar polygonal scenes
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Planar visibility: testing and counting
Proceedings of the twenty-sixth annual symposium on Computational geometry
Visibility testing and counting
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Beyond triangulation: covering polygons with triangles
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Visibility maps of segments and triangles in 3d
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Computing the visibility polygon of an island in a polygonal domain
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Space/query-time tradeoff for computing the visibility polygon
Computational Geometry: Theory and Applications
Lower bounds for sorted geometric queries in the I/O model
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
Scalable visibility color map construction in spatial databases
Information Systems
| Hi-index | 0.00 |