Constructing approximate shortest path maps in three dimensions

SIAM Journal on Computing

Volumn 28, Issue 4, 1999, Pages 1182-1197

  Har Peled, Sariel ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; DATA STRUCTURES; NUMERICAL ANALYSIS; OPTIMIZATION; THREE DIMENSIONAL;

EUCLIDEAN SHORTEST PATHS; SHORTEST PATH MAPS; VORONOI DIAGRAMS;

COMPUTATIONAL METHODS;

EID: 0032631074     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797325223     Document Type: Article

References (25)

1. P. AGARWAL, S. HAR-PELED, M. SHARIR, AND K. R. VARADARAJAN, Approximate shortest paths on a convex polytope in three dimensions, J. Assoc. Comput. Mach., 44 (1997), pp. 567-584.
2. F. AURENHAMMER, Voronoi diagrams: A survey of a fundamental geometric data structure, ACM Comput. Surv., 23 (1991), pp. 345-405.
3. J. CANNY AND J. H. REIF, New lower bound techniques for robot motion planning problems, in Proc. 28th IEEE Sympos. Found. Comput. Sci., Los Angeles, 1987, pp. 49-60.
4. B. CHAZELLE, Triangulating a simple polygon in linear time, Discrete Comput. Geom., 6 (1991), pp. 485-524.
5. J. CHEN AND Y. HAN, Shortest paths on a polyhedron; Part I: Computing shortest paths, Internat. J. Comput. Geom. Appl., 6 (1996), pp. 127-144.
6. J. CHOI, J. SELLEN, AND C. K. YAP, Approximate Euclidean shortest path in 3-space, J. Comput. Geom. Appl., 7 (1997), pp. 271-295.
7. K. L. CLARKSON, Approximation algorithms for shortest path motion planning, in Proc. 19th ACM Sympos. Theory Comput., New York, 1987, pp. 56-65.
8. K. L. CLARKSON AND P. W. SHOR, Applications of random sampling in computational geometry, II, Discrete Comput. Geom., 4 (1989), pp. 387-421.
9. D. P. DOBKIN AND D. G. KIRKPATRICK, A linear algorithm for determining the separation of convex polyhedra, J. Algorithms, 6 (1985), pp. 381-392.
10. S. J. FORTUNE, A sweepline algorithm for Voronoi diagrams, Algorithmica, 2 (1987), pp. 153-174.
11. S. HAR-PELED, Approximate shortest paths and geodesic diameters on convex polytopes in three dimensions, in Proc. 13th ACM Sympos. Comput. Geom., Nice, France, 1997, pp. 359-365.
12. 3, in Proc. 6th ACM-SIAM Sympos. Discrete Algorithms, San Francisco, 1995, pp. 447-456.
13. M. LANTHIER, A. MAHESHWARI, AND J.-R. SACK, Approximating weighted shortest paths on polyhedral surfaces, in Proc. 13th ACM Sympos. Comput. Geom., Nice, France, 1997, pp. 274-283.
14. C. MATA AND J. MITCHELL, A new algorithm for computing the shortest paths in planar subdivisions, in Proc. 13th ACM Sympos. Comput. Geom., Nice, France, 1997, pp. 264-273.
15. J. MATOUŠEK, Approximations and optimal geometric divide-and-conquer, in Proc. 23rd ACM Sympos. Theory Comput., New Orleans, 1991, pp. 505-511. Also to appear in J. Comput. Syst. Sci.
16. J. MATOUŠEK, Approximations and optimal geometric divide-and-conquer, in Proc. 23rd ACM Sympos. Theory Comput., New Orleans, 1991, pp. 505-511. Also to appear in J. Comput. Syst. Sci.
17. J. S. B. MITCHELL, D. M. MOUNT, AND C. H. PAPADIMITRIOU, The discrete geodesic problem, SIAM J. Comput., 16 (1987), pp. 647-668.
18. D. M. MOUNT, Storing the subdivision of a polyhedral surface. Discrete Comput. Geom., 2 (1987), pp. 153-174.
19. J. O'ROURKE, Computational Geometry in C, Cambridge University Press, Cambridge, U.K. 1994.
20. C. H. PAPADIMITRIOU, An algorithm for shortest path motion in three dimensions, Inform. Process. Lett., 20 (1985), pp. 259-263.
21. J. H. REIF AND J. A. STORER, A single-exponential upper bound for finding shortest paths in three dimensions, J. ACM, 41 (1994), pp. 1013-1019.
22. M. SHARIR, On shortest paths amidst convex polyhedra, SIAM J. Comput., 16 (1987), pp. 561-572.
23. M. SHARIR AND A. SCHORR, On shortest paths in polyhedral spaces, SIAM J. Comput., 15 (1986), pp. 193-215.
24. X.-H. TAN, T. HIRATA, AND Y. INAGAKI, Spatial Point Location and Its Applications, Lecture Notes in Comput. Sci. 450, Springer-Verlag, New York, 1990, pp. 241-250.
25. K. VARADARAJAN AND P. AGARWAL, Approximating shortest paths on a nonconvex polyhedron, in Proc. 38th IEEE Sympos. Found. Comput. Sci., Miami Beach, 1997, pp. 182-191.