Shortest path queries in rectilinear worlds of higher dimension (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Optimal link path queries in a simple polygon
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon
IEEE Transactions on Computers
An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
Information Processing Letters
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry
Settling the bound on the rectilinear link radius of a simple rectilinear polygon
Information Processing Letters
Faster algorithms for minimum-link paths with restricted orientations
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Approximate guarding of monotone and rectilinear polygons
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Computing a maxian point of a simple rectilinear polygon
Operations Research Letters
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |