Link distance and shortest path problems in the plane

DOI10.1016/J.COMGEO.2011.04.004MaRDI QIDQ634253zbMATH OpenOpenAlexFDO

Authors Carola Wenk, Atlas F. IV. Cook

Publication date 2 August 2011

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2011.04.004

zbMATH Keywords

Hausdorff distancecomputational geometryshortest pathsVoronoi diagramslink distancepolygonal domainsimple polygonFréchet distance

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Link Distance and Shortest Path Problems in the Plane
• scientific article; zbMATH DE number 1424300
• Voronoi diagrams for polygon-offset distance functions
• Voronoi diagrams for a moderate-sized point-set in a simple polygon
• Voronoi diagrams for a moderate-sized point-set in a simple polygon

Cites work

• scientific article; zbMATH DE number 5506195 (Why is no real title available?)
• scientific article; zbMATH DE number 1305410 (Why is no real title available?)
• scientific article; zbMATH DE number 1455125 (Why is no real title available?)
• scientific article; zbMATH DE number 742973 (Why is no real title available?)
• scientific article; zbMATH DE number 1424289 (Why is no real title available?)
• scientific article; zbMATH DE number 1424300 (Why is no real title available?)
• scientific article; zbMATH DE number 1424303 (Why is no real title available?)
• scientific article; zbMATH DE number 1445396 (Why is no real title available?)
• A linear time algorithm for minimum link paths inside a simple polygon
• Abstract Voronoi diagrams revisited
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Comparison of distance measures for planar curves
• Computing the full visibility graph of a set of line segments
• Faster shortest-path algorithms for planar graphs
• Fréchet Distance for Curves, Revisited
• Geodesic Fréchet distance inside a simple polygon
• Guarding galleries and terrains
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Link Distance and Shortest Path Problems in the Plane
• Minimum-link paths among obstacles in the plane
• New similarity measures between polylines with applications to morphing and polygon sweeping
• Parametric search made practical
• Path Planning in 0/1/∞ Weighted Regions with Applications
• Querying two boundary points for shortest paths in a polygonal domain (extended abstract)
• Slowing down sorting networks to obtain faster sorting algorithms
• Walking your dog in the woods in polynomial time

Cited in

(2)

• scientific article; zbMATH DE number 1424300 (Why is no real title available?)
• Link Distance and Shortest Path Problems in the Plane

This page was built for publication: Link distance and shortest path problems in the plane

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