Computational geometry: an introduction
Computational geometry: an introduction
Visibility of disjoint polygons
Algorithmica
Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles
IEEE Transactions on Computers
Optimal shortest path queries in a simple polygon
SCG '87 Proceedings of the third annual symposium on Computational geometry
Computing the link center of a simple polygon
Discrete & Computational Geometry - ACM Symposium on Computational Geometry, Waterloo
Optimal two-terminal &agr;-&bgr; wire routing
Integration, the VLSI Journal
An O(n log n) algorithm for computing a link center in a simple polygon
Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89
An efficient algorithm for link-distance problems
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Finding shortest paths in the presence of orthogonal obstacles using a combined L1 and link metric
SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
Minimum-link paths among obstacles in the plane
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Shortest rectilinear paths among weighted rectangles
Journal of Information Processing
Shortest paths among obstacles in the plane
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Rectilinear Path Problems Among Rectilinear ObstaclesRevisited
SIAM Journal on Computing
An algorithm for planning collision-free paths among polyhedral obstacles
Communications of the ACM
Proximity and reachability in the plane.
Proximity and reachability in the plane.
Minimum link paths in polygons and related problems
Minimum link paths in polygons and related problems
The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon
IEEE Transactions on Computers
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
An O(n5/2logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions
Computational Geometry: Theory and Applications
Reduction rules deliver efficient FPT-algorithms for covering points with lines
Journal of Experimental Algorithmics (JEA)
Faster algorithms for minimum-link paths with restricted orientations
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
| Hi-index | 14.99 |
We consider problems of finding assorted rectilinear paths among rectilinear obstacles in a two-layer interconnection model according to the number of bends and the 1-layer distance (y-distance). Using a horizontal wave-front approach, optimal /spl theta/(e log e) time algorithms are presented to find the shortest path and the minimum-bend path using linear space, and to find the shortest minimum-bend path and the minimum-bend shortest path using O(e log e) space, where e is the number of obstacle edges. By the same approach, we also derive an algorithm for finding a shortest two-layer distance (xy-distance) minimum-bend path in optimal /spl theta/(e log e) time using O(e log e) space.