Link Distance and Shortest Path Problems in the Plane

DOI10.1007/978-3-642-02158-9_13zbMath1246.68239OpenAlexW2099686509MaRDI QIDQ3638449

Carola Wenk, Atlas F. IV. Cook

Publication date: 2 July 2009

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02158-9_13

zbMATH Keywords

Voronoi DiagramFréchet DistanceLink DistanceShortest Path Map

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Link distance and shortest path problems in the plane

Cites Work

• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Minimum-link paths among obstacles in the plane
• A linear time algorithm for minimum link paths inside a simple polygon
• Path Planning in 0/1/∞ Weighted Regions with Applications
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Faster shortest-path algorithms for planar graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Link Distance and Shortest Path Problems in the Plane