Computing Shortest Paths amid Convex Pseudodisks

DOI10.1137/110840030zbMath1275.68076OpenAlexW1983422667MaRDI QIDQ2848214

Haitao Wang, Danny Z. Chen, J. E. Hershberger

Publication date: 25 September 2013

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/110840030

zbMATH Keywords

shortest pathsmotion planningEuclidean distanceconvex obstaclesvisibility graphspseudodisks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

Computing \(L_1\) shortest paths among polygonal obstacles in the plane ⋮ Visibility graphs, dismantlability, and the cops and robbers game ⋮ Computing Shortest Paths in the Plane with Removable Obstacles

This page was built for publication: Computing Shortest Paths amid Convex Pseudodisks