Efficient computation of geodesic shortest paths
From MaRDI portal
Publication:2819608
DOI10.1145/301250.301449zbMath1345.68263OpenAlexW2042746037MaRDI QIDQ2819608
Publication date: 29 September 2016
Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/301250.301449
Analysis of algorithms and problem complexity (68Q25) Three-dimensional polytopes (52B10) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (14)
An optimal-time algorithm for shortest paths on realistic polyhedra ⋮ Curve matching, time warping, and light fields: New algorithms for computing similarity between curves ⋮ Routing among convex polygonal obstacles in the plane ⋮ Shortest monotone descent path problem in polyhedral terrain ⋮ Approximating generalized distance functions on weighted triangulated surfaces with applications ⋮ A survey of geodesic paths on 3D surfaces ⋮ On realistic terrains ⋮ An optimal-time algorithm for shortest paths on a convex polytope in three dimensions ⋮ Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings ⋮ Designing approximation minimal parametric surfaces with geodesics ⋮ Inapproximability of finding maximum hidden sets on polygons and terrains ⋮ Computing generalized higher-order Voronoi diagrams on triangulated surfaces ⋮ Thaw: A Tool for Approximating Cut Loci on a Triangulation of a Surface ⋮ Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
This page was built for publication: Efficient computation of geodesic shortest paths
