Shortest paths on realistic polyhedra

DOI10.1145/1247069.1247081zbMath1221.68279OpenAlexW1974931598MaRDI QIDQ3602856

Yevgeny Schreiber

Publication date: 12 February 2009

Published in: Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1247069.1247081

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

An optimal-time algorithm for shortest paths on realistic polyhedra ⋮ A survey of geodesic paths on 3D surfaces ⋮ The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains ⋮ An optimal-time algorithm for shortest paths on a convex polytope in three dimensions ⋮ Approximation algorithms for shortest descending paths in terrains

This page was built for publication: Shortest paths on realistic polyhedra