Efficient algorithms for geometric graph search problems
SIAM Journal on Computing
Optimal computation of finitely oriented convex hulls
Information and Computation
Dynamic orthogonal segment intersection search
Journal of Algorithms
On some distance problems in fixed orientations
SIAM Journal on Computing
New algorithms for special cases of the hidden line elimination problem
Computer Vision, Graphics, and Image Processing
Computational Geometry: Theory and Applications
Optimal binary space partitions for orthogonal objects
Journal of Algorithms
Computing minimum length paths of a given homotopy class
Computational Geometry: Theory and Applications
Rectilinear Path Problems Among Rectilinear ObstaclesRevisited
SIAM Journal on Computing
Rectilinear paths among rectilinear obstacles
Discrete Applied Mathematics
On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model
IEEE Transactions on Computers
Line Simplification with Restricted Orientations
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles
Discrete & Computational Geometry
An O(n5/2logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We give an O(n2 log2 n)-time algorithm for computing a minimum-link rectilinear path in an n-vertex rectilinear domain in three dimensions; the fastest previously known algorithm of [Wagner, Drysdale and Stein, 2009] has running time O(n2.5 log n). We also present an algorithm to find a minimum-link C-oriented path in a C-oriented domain in the plane; our algorithm is simpler and more time-space efficient than the earlier one of [Adegeest, Overmars and Snoeyink, 1994].