Computing simple paths among obstacles

DOI10.1016/S0925-7721(00)00011-0MaRDI QIDQ1594600zbMATH OpenOpenAlexFDO

Authors Qi Cheng, Marek Chrobak, Gopalakrishnan Sundaram

Publication date 10 April 2001

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0925-7721(00)00011-0

zbMATH Keywords

NP-completenesssimple pathsimple polygon

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Computing Simple Paths on Points in Simple Polygons
• Computing simple paths from given points inside a polygon
• Finding simple paths on given points in a polygonal region
• Shortest paths in the plane with convex polygonal obstacles
• Shortest paths in the plane with polygonal obstacles

Cited in

(10)

• Computing simple paths from given points inside a polygon
• Finding simple paths on given points in a polygonal region
• Mathematical Labyrinths. Pathfinding
• A simple path non-existence algorithm using \(C\)-obstacle query
• scientific article; zbMATH DE number 140088 (Why is no real title available?)
• scientific article; zbMATH DE number 512947 (Why is no real title available?)
• scientific article; zbMATH DE number 1419896 (Why is no real title available?)
• How to navigate through obstacles?
• Path Counting for Grid-Based Navigation
• Computing Simple Paths on Points in Simple Polygons

This page was built for publication: Computing simple paths among obstacles

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