Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures

DOI10.1007/978-3-540-77050-3_34zbMath1135.68600OpenAlexW2130346196MaRDI QIDQ5458853

Sanjiv Kapoor, Rajasekhar Inkulu

Publication date: 24 April 2008

Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_34

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Planar rectilinear shortest path computation using corridors

Cites Work

• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• Rectilinear shortest paths in the presence of rectangular barriers
• \(L_ 1\) shortest paths among polygonal obstacles in the plane
• An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• TRIANGULATING DISJOINT JORDAN CHAINS
• Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles

This page was built for publication: Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures