Approximate shortest paths in simple polyhedra

DOI10.1007/978-3-642-19867-0_43zbMATH Open1272.68434OpenAlexW1603579758WikidataQ60574673 ScholiaQ60574673MaRDI QIDQ3000734FDOQ3000734

Authors: Fajie Li, Reinhard Klette 

Publication date: 19 May 2011

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19867-0_43

Recommendations

• Approximate Euclidean Shortest Paths in 3-Space
• On Shortest Paths in Polyhedral Spaces
• Publication:4886077
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Cited In (15)

• Approximate Shortest Path Queries Using Voronoi Duals
• Shortest paths, single origin‐destination network design, and associated polyhedra
• Constructing Approximate Shortest Path Maps in Three Dimensions
• Optimal shortest path queries in a simple polygon
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Approximate Shortest Paths in Polygons with Violations
• Approximating shortest paths on a nonconvex polyhedron
• On the shortest paths between two convex polyhedra
• Distance-preserving approximations of polygonal paths
• Shortest paths in simple polygons with polygon-meet constraints
• Walking in a Planar Poisson–Delaunay Triangulation: Shortcuts in the Voronoi Path
• Fast computation of shortest watchman routes in simple polygons
• Shortest Path in a Polygon using Sublinear Space.
• IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION
• Efficiently determining a locally exact shortest path on polyhedral surfaces

This page was built for publication: Approximate shortest paths in simple polyhedra

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