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

DOI10.1142/S021819599900011XzbMath1026.65013MaRDI QIDQ4513243

Hitoshi Suzuki, Yoshiyuki Kusakari, 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)

Cites Work

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

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