Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
On finding lowest common ancestors: simplification and parallelization (extended summary)
VLSI Algorithms and Architectures
Voronoi diagrams with barriers and the shortest diagonal problem
Information Processing Letters
Optimal shortest path queries in a simple polygon
Journal of Computer and System Sciences
Computing geodesic furthest neighbors in simple polygons
Journal of Computer and System Sciences
Computational geometry column 8
ACM SIGACT News
Computing external farthest neighbors for a simple polygon
Discrete Applied Mathematics
A new data structure for shortest path queries in a simple polygon
Information Processing Letters
Fast matching algorithms for points on a polygon
SIAM Journal on Computing
Optimal time bounds for some proximity problems in the plane
Information Processing Letters
Computing the shortest diagonal of a monotone polygon in linear line
Information Processing Letters
Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version)
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Shortest path queries in planar graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The geodesic farthest-site Voronoi diagram in a polygonal domain with holes
Proceedings of the twenty-fifth annual symposium on Computational geometry
Hi-index | 0.00 |