A SHORTEST PAIR OF PATHS ON THE PLANE WITH OBSTACLES AND CROSSING AREAS

DOI10.1142/S021819599900011XMaRDI QIDQ4513243zbMATH OpenFDO

Authors Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki

Publication date 7 November 2000

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmplane sweepnon-crossing pathcrossing areashortest pair of paths

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Finding a shortest pair of paths on the plane with obstacles and crossing areas
• Shortest paths in the plane with convex polygonal obstacles
• On the Euclidean two paths problem
• Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane
• Minimum-link shortest paths for polygons amidst rectilinear obstacles

Cites work

• Proximity problems for points on a rectilinear plane with rectangular obstacles
• Rectilinear shortest paths in the presence of rectangular barriers

Cited in

(5)

• Finding a region with the minimum total L₁ distance from prescribed terminals
• Finding a shortest pair of paths on the plane with obstacles and crossing areas
• SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
• k-pairs non-crossing shortest paths in a simple polygon
• The Fastest Path Between Two Points, with a Symmetric Obstacle

This page was built for publication: A SHORTEST PAIR OF PATHS ON THE PLANE WITH OBSTACLES AND CROSSING AREAS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4513243)