Parallel methods for visibility and shortest path problems in simple polygons (preliminary version)
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Optimal parallel algorithms for triangulated simple polygons
SCG '92 Proceedings of the eighth 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
Matrix searching with the shortest path metric
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient piecewise-linear function approximation using the uniform metric: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Generating triangulations at random
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Hierarchical vertical decompositions, ray shooting, and circular arc queries in simple polygons
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
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
Two-point Euclidean shortest path queries in the plane
Proceedings of the tenth 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
Visibility Queries in Simple Polygons and Applications
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Finding an Optimal Bridge between Two Polygons
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Computing the visibility graph of points within a polygon
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Curvature-bounded traversals of narrow corridors
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Finding large sticks and potatoes in polygons
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximate distance oracles for geometric spanners
ACM Transactions on Algorithms (TALG)
Shortest Path Queries in Polygonal Domains
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Algorithms for Computing Diffuse Reflection Paths in Polygons
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
The geodesic farthest-site Voronoi diagram in a polygonal domain with holes
Proceedings of the twenty-fifth annual symposium on Computational geometry
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
Computational Geometry: Theory and Applications
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Geodesic Fréchet distance inside a simple polygon
ACM Transactions on Algorithms (TALG)
The geodesic diameter of polygonal domains
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
A heuristic homotopic path simplification algorithm
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Asynchronous deterministic rendezvous in bounded terrains
Theoretical Computer Science
Querying two boundary points for shortest paths in a polygonal domain
Computational Geometry: Theory and Applications
Finding the shortest path between two points in a simple polygon by applying a rubberband algorithm
PSIVT'06 Proceedings of the First Pacific Rim conference on Advances in Image and Video Technology
Shortest path problem in rectangular complexes of global nonpositive curvature
Computational Geometry: Theory and Applications
Partial matching between surfaces using fréchet distance
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Efficient wayfinding in complex environments: derivation of a continuous space shortest path
Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
Reprint of: Memory-constrained algorithms for simple polygons
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |