An Optimal-Time Algorithm for Shortest Paths on Realistic Polyhedra

We generalize our optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P to three realistic scenarios where P is a possibly nonconvex polyhedron. In the first scenario, ∂ P is a terrain whose maximum face...

Full description

Bibliographic Details

Published in:	Discrete & computational geometry Vol. 43; no. 1; pp. 21 - 53
Main Author:	Schreiber, Yevgeny
Format:	Journal Article
Language:	English
Published:	New York Springer-Verlag 01.01.2010 Springer Nature B.V
Subjects:	Algorithms Combinatorics Computational Mathematics and Numerical Analysis Geometry Mathematics Mathematics and Statistics Polyhedra Shortest path map Continuous Dijkstra Terrain Conforming subdivision Realistic polyhedral surface Wavefront
ISSN:	0179-5376, 1432-0444
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!