Computing simple paths among obstacles

DOI10.1016/S0925-7721(00)00011-0zbMath0966.68209OpenAlexW2127909774MaRDI QIDQ1594600

Marek Chrobak, Gopalakrishnan Sundaram, Qi Cheng

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 polygonsimple path

Mathematics Subject Classification ID

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

Related Items

Computing simple paths from given points inside a polygon ⋮ Computing Simple Paths on Points in Simple Polygons

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