Optimal parallel algorithms for triangulated simple polygons
SCG '92 Proceedings of the eighth 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
Shortest path queries among weighted obstacles in the rectilinear plane
Proceedings of the eleventh 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
An O(n log n) algorithm for the zoo-keeper's problem
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Curvature-bounded traversals of narrow corridors
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Minimum weight pseudo-triangulations
Computational Geometry: Theory and Applications
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
Computational Geometry: Theory and Applications
Geodesic Fréchet distance inside a simple polygon
ACM Transactions on Algorithms (TALG)
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
Partial matching between surfaces using fréchet distance
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.89 |