Computing simple paths among obstacles

DOI10.1016/S0925-7721(00)00011-0zbMATH Open0966.68209OpenAlexW2127909774MaRDI QIDQ1594600FDOQ1594600

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

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

zbMATH Keywords

NP-completenesssimple polygonsimple path

Mathematics Subject Classification ID

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

Cited In (10)

• Path Counting for Grid-Based Navigation
• Computing simple paths from given points inside a polygon
• A simple path non-existence algorithm using \(C\)-obstacle query
• Title not available (Why is that?)
• Mathematical Labyrinths. Pathfinding
• Finding simple paths on given points in a polygonal region
• How to navigate through obstacles?
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)