Computing shortest paths amid pseudodisks

MaRDI QIDQ5365045zbMATH OpenFDO

Authors Danny Z. Chen, Haitao Wang

Publication date 29 September 2017

Full work available at URL http://dl.acm.org/citation.cfm?id=2133062

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Computing shortest paths amid convex pseudodisks
• Shortest paths in the plane with polygonal obstacles
• Computing shortest paths among curved obstacles in the plane
• Shortest paths in the plane with convex polygonal obstacles
• SHORTEST PATHS AMONG OBSTACLES IN THE PLANE

Cited in

(4)

• Computing shortest paths amid convex pseudodisks
• SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE
• A near-optimal algorithm for shortest paths among curved obstacles in the plane
• Computational Science and Its Applications – ICCSA 2004

This page was built for publication: Computing shortest paths amid pseudodisks

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