Finding a shortest pair of paths on the plane with obstacles and crossing areas

DOI10.1007/BFB0015407zbMATH Open1512.68417MaRDI QIDQ6487944FDOQ6487944

Authors: Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki 

Publication date: 21 March 2023

Recommendations

• A SHORTEST PAIR OF PATHS ON THE PLANE WITH OBSTACLES AND CROSSING AREAS
• Minimum-link shortest paths for polygons amidst rectilinear obstacles
• Shortest paths in the plane with convex polygonal obstacles
• Planar rectilinear shortest path computation using corridors
• Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rectilinear shortest paths in the presence of rectangular barriers

Cited In (5)

• Finding a region with the minimum total \(L_1\) distance from prescribed terminals
• On bends and distances of paths among obstacles in two-layer interconnection model
• SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
• A SHORTEST PAIR OF PATHS ON THE PLANE WITH OBSTACLES AND CROSSING AREAS
• The Fastest Path Between Two Points, with a Symmetric Obstacle

This page was built for publication: Finding 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 Q6487944)