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...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete & computational geometry Ročník 43; číslo 1; s. 21 - 53
Hlavný autor:	Schreiber, Yevgeny
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer-Verlag 01.01.2010 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!