Planar point location using persistent search trees
Communications of the ACM
Optimal point location in a monotone subdivision
SIAM Journal on Computing
Approximation algorithms for shortest path motion planning
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A data structure for dynamic trees
Journal of Computer and System Sciences
Visibility and intersection problems in plane geometry
Discrete & Computational Geometry
Optimal shortest path queries in a simple polygon
Journal of Computer and System Sciences
Dynamic trees and dynamic point location
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Efficient point location in a convex spatial cell-complex
SIAM Journal on Computing
Shortest paths among obstacles in the plane
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
An Optimal Algorithm for Computing Visibility in the Plane
SIAM Journal on Computing
Separation and approximation of polyhedral objects
Computational Geometry: Theory and Applications
Computing the visibility graph via pseudo-triangulations
Proceedings of the eleventh annual symposium on Computational geometry
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Approximate shortest paths and geodesic diameters on convex polytopes in three dimensions
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Star Unfolding of a Polytope with Applications
SIAM Journal on Computing
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
On the all-pairs Euclidean short path problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On Geometric Path Query Problems
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
On the continuous Weber and k-median problems (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximate distance oracles for geometric graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate Distance Oracles Revisited
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Approximate distance oracles for graphs with dense clusters
Computational Geometry: Theory and Applications
Shortest Path Queries in Polygonal Domains
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Link Distance and Shortest Path Problems in the Plane
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Shortest Path Problems on a Polyhedral Surface
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Querying Two Boundary Points for Shortest Paths in a Polygonal Domain
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Compact oracles for approximate distances around obstacles in the plane
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Shortest path queries between geometric objects on surfaces
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
The geodesic diameter of polygonal domains
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Approximate solution of the multiple watchman routes problem with restricted visibility range
IEEE Transactions on Neural Networks
Querying Approximate Shortest Paths in Anisotropic Regions
SIAM Journal on Computing
Link distance and shortest path problems in the plane
Computational Geometry: Theory and Applications
Approximate shortest path queries on weighted polyhedral surfaces
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Querying two boundary points for shortest paths in a polygonal domain
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |