Structured visibility profiles with applications to problems in simple polygons (extended abstract)
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
An algorithm for generalized point location and its applications
Journal of Symbolic Computation
Space-efficient ray-shooting and intersection searching: algorithms, dynamization, and applications
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Ray shooting and parametric search
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Applications of parametric searching in geometric optimization
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
The robot localization problem in two dimensions
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Optimal parallel algorithms for triangulated simple polygons
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
An optimal parallel algorithm for detecting weak visibility of a simple polygon
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Intersection detection and separators for simple polygons
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Generalized hidden surface removal
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Dynamic ray shooting and shortest paths via balanced geodesic triangulations
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Can visibility graphs be represented compactly?
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The visibility complex made visibly simple: an introduction to 2D structures of visibility
Proceedings of the eleventh annual symposium on Computational geometry
Hierarchical vertical decompositions, ray shooting, and circular arc queries in simple polygons
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A pedestrian approach to ray shooting: shoot a ray, take a walk
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Ray shooting amidst convex polytopes in three dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Two-point Euclidean shortest path queries in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Motorcycle graphs and straight skeletons
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An O(n log n) algorithm for the zoo-keeper's problem
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
A Randomized Algorithm for Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Efficient visibility queries in simple polygons
Computational Geometry: Theory and Applications
Touring a sequence of polygons
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Approximation algorithms for the watchman route and zookeeper's problems
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Guarding a terrain by two watchtowers
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Ray shooting and stone throwing with near-linear storage
Computational Geometry: Theory and Applications
A unified and efficient solution to the room search problem
Computational Geometry: Theory and Applications
An efficient algorithm for the three-guard problem
Discrete Applied Mathematics
Searching a Circular Corridor with Two Flashlights
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Processing an Offline Insertion-Query Sequence with Applications
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Ray shooting and stone throwing with near-linear storage
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
Optimum sweeps of simple polygons with two guards
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Linear-Time 2-approximation algorithm for the watchman route problem
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
A characterization of polygonal regions searchable from the boundary
IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory
Locating two obnoxious facilities using the weighted maximin criterion
Operations Research Letters
Minimization of the maximum distance between the two guards patrolling a polygonal region
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
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
Visibility and ray shooting queries in polygonal domains
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Approximating minimum bending energy path in a simple corridor
Computational Geometry: Theory and Applications
Optimum sweeps of simple polygons with two guards
Information Processing Letters
| Hi-index | 0.00 |