The MathNet Korea
Information Center for Mathematical Science

논문검색

Information Center for Mathematical Science

논문검색

SIAM Journal on Computing
( Vol. 28 NO.4 / (1999))
Constructing Approximate Shortest Path Maps in Three Dimensions
Sariel Har-Peled,
Pages. 1182-1197
Abstract
Contents 1. Introduction
Approximate shortest path maps
Approximate spatial shortest path maps
2. Approximating a distance function by a weighted Voronoi diagram
3. Approximate shortest path map on a polyhedral surface in $mathbb R^3$
4. Constructing spatial approximate shortest path maps in $mathbb R^3$
5. Conclusions
Key words pproximation algorithms, Euclidean shortest paths, Voronoi diagrams
Mathmatical Subject Classification 68U05, 65D99, 52B05, 52B10