Star unfolding of a polytope with applications

SIAM Journal on Computing

Volumn 26, Issue 6, 1997, Pages 1689-1713

  Agarwal, Pankaj K ^a   Aronov, Boris ^b   O'Rourke, Joseph ^c   Schevon, Catherine A ^d  

^a Duke University   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

^c SMITH COLLEGE   (United States)

^d LUCENT TECHNOLOGIES   (United States)

Author keywords

Convex polytopes; Geodesics; Shortest paths; Star unfolding

Indexed keywords

EID: 0013013983     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793253371     Document Type: Article

References (41)

1. P. K. AGARWAL, B. ARONOV, J. O'ROURKE, AND C. SCHEVON, Star unfolding of a polytope with applications, in Proc. of 2nd Annual Scandinavian Workshop on Algorithm Theory, Lecture Notes in Comput. Sci. 447, Springer-Verlag, Berlin, 1990, pp. 251-263.
2. A. D. ALEKSANDROV, Konvexe Polyeder, Math. Lehrbucher und Monographien, Akademie-Verlag, Berlin, 1958.
3. P. K. AGARWAL AND J. MATOUŠEK, Ray shooting and parametric search, SIAM J. Comput., 22 (1993), pp. 794-806.
4. B. ARONOV AND J. O'ROURKE, Nonoverlap of the star unfolding, Discrete Comput. Geom., 8 (1992), pp. 219-250.
5. P. K. AGARWAL, M. SHARIR, AND P. SHOR, Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences, J. Comb. Theory Ser. A, 52 (1989), pp. 228-274.
6. A. D. ALEKSANDROV AND V. A. ZALGALLER, Intrinsic Geometry of Surfaces, American Mathematical Society, Providence, RI, 1967. (Translation of the 1962 Russian original.)
7. I. BALABAN, An optimal algorithm for finding segments intersections, in Proc. 11th Annual ACM Sympos. Comput. Geom., ACM, New York, 1995, pp. 211-219.
8. J. L. BENTLEY AND T. A. OTTMANN, Algorithms for reporting and counting geometric intersections, IEEE Trans. Comput., C-28 (1979), pp. 643-647.
9. H. BRÖNNIMANN, B. CHAZELLE, AND J. MATOUŠEK, Product range spaces, sensitive sampling, and derandomization, in Proc. 34th Annual IEEE Sympos. Found. Comput. Sci., IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 400-409.
10. J. CANNY AND J. REIF, New lower bound techniques for robot motion planning problems, in Proc. 28th IEEE Symp. Found. Comput. Sci., IEEE Computer Society Press, Los Alamitos, CA, 1987, pp. 49-60.
11. B. CHAZELLE AND H. EDELSBRUNNER, An optimal algorithm for intersecting line segments in the plane, J. Assoc. Comput. Mach., 39 (1992), pp. 1-54.
12. J. CHEN AND Y. HAN, Shortest paths on a polyhedron, in Proc. 6th Annual ACM Sympos. Comput. Geom., ACM, New York, 1990, pp. 360-369.
13. J. CHEN AND Y. HAN, Storing shortest paths for a polyhedron, in Advances in Computing and Information - ICCI '91 Internat. Conf. Proc., Springer-Verlag, Berlin, 1991, pp. 169-80.
14. J. CHOI, J. SELLEN, AND C.-K. YAP, Approximate Euclidean shortest path in 3-space, in Proc. 10th Annual ACM Sympos. Comput. Geom., ACM, New York, 1994, pp. 41-48.
15. K. CLARKSON, Approximation algorithms for shortest path motion planning, in Proc. 19th Annual ACM Sympos. Theory Comput., ACM, New York, 1987, pp. 56-65.
16. K. CLARKSON AND P. SHOR, Applications of random sampling in computational geometry, II, Discrete Comput. Geom., 4 (1989), pp. 387-421.
17. H. EL GINDY AND D. AVIS, A linear algorithm for computing the visibility polygon from a point, J. Algorithms, 2 (1981), pp. 186-197.
18. M. GARDNER, The 2nd Scientific American Book of Mathematical Puzzles and Diversions, Simon and Schuster, New York, 1961.
19. L. GUIBAS, J. S. B. MITCHELL, AND T. ROOS, Voronoi diagrams of moving points in the plane, in Proc. 17th Internat. Workshop Graph-Theoret. Concepts Comput. Sci., Lecture Notes in Comput. Sci. 570, Springer-Verlag, Berlin, 1991, pp. 113-125.
20. J. HERSHBERGER AND S. SURI, Efficient computation of Euclidean shortest paths in the plane, in Proc. 34th Annual IEEE Sympos. Found. Comput. Sci., IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 508-517.
21. 3, in Proc. 6th Annual ACM-SIAM Sympos. Discrete Algorithms, SIAM, Philadelphia, 1995, pp. 447-456.
22. Y.-H. HWANG, R.-C. CHANG, AND H.-Y. TU, Finding all shortest path edge sequences on a convex polyhedron, in Proc. 1st Workshop Algorithms Data Struct., Lecture Notes in Comput. Sci 382, Springer-Verlag, Berlin, 1989, pp. 251-266.
23. S. KOBAYASHI, On conjugate and cut loci, in Studies in Global Geometry and Analysis, S. S. Chern, ed., Mathematical Association of America, Providence, RI, 1967, pp. 96-122.
24. D. MOUNT, On Finding Shortest Paths on Convex Polyhedra, Technical Report 1495, Dept. of Comput. Sci., Univ. of Maryland, 1985.
25. J. S. B. MITCHELL, Shortest paths among obstacles in the plane, in Proc. 9th Annual ACM Sympos. Comput. Geom., ACM, New York, 1993, pp. 308-317.
26. J. MITCHELL, D. MOUNT, AND C. PAPADIMITRIOU, The discrete geodesic problem, SIAM J. Comput., 16 (1987), pp. 647-668.
27. D. M. MOUNT, The number of shortest paths on the surface of a polyhedron, SIAM J. Comput., 19 (1990), pp. 593-611.
28. J. MATOUŠEK AND O. SCHWARZKOPF, Ray shooting in convex polytopes, Discrete Comput. Geom., 10 (1993), pp. 215-232.
29. J. O'ROURKE AND C. SCHEVON, Computing the geodesic diameter of a 3-polytope, in Proc. 5th Annual ACM Sympos. Comput. Geom., ACM, New York, 1989, pp. 370-379.
30. C. PAPADIMITRIOU, An algorithm for shortest paths motion in three dimensions, Inform. Process. Lett., 20 (1985), pp. 259-263.
31. R. RASCH, Shortest Paths Along a Convex Polyhedron, Diploma thesis, Univ. of Saarland, Saarbrücken, Germany, 1990.
32. J. REIF AND J. STORER, Shortest paths in Euclidean space with polyhedral obstacles, J. Assoc. Comput. Mach., 41 (1994), pp. 1013-1019.
33. C. SCHEVON, Algorithms for Geodesies on Polytopes, Ph.D. thesis, Johns Hopkins Univ., Baltimore, MD, 1989.
34. R. SEIDEL, A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions, Technical Report 81/14, Dept. Comput. Sci., Univ. of British Columbia, Vancouver, 1981.
35. M. SHARIR, On shortest paths amidst convex polyhedra, SIAM J. Comput., 16 (1987), pp. 561-572.
36. C. SCHEVON AND J. O'ROURKE, The number of maximal edge sequences on a convex polytope, in Proc. 26th Allerton Conf. Commun. Control Comput., Univ. Illinois at Urbana-Champaign, IL, 1988, pp. 49-57.
37. C. SCHEVON AND J. O'ROURKE, An Algorithm for Finding Edge Sequences on a Polytope, Technical Report JHU-89/03, Dept. Comput. Sci., Johns Hopkins Univ., Baltimore, MD, 1989.
38. M. SHARIR AND A. SCHORR, On shortest paths in polyhedral spaces, SIAM J. Comput., 15 (1986), pp. 193-215.
39. N. SARNAK AND R. E. TARJAN, Planar point location using persistent search trees, Commun. Assoc. Comput. Mach., 29 (1986), pp. 609-679.
40. M. SHARIR AND P. K. AGARWAL, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.
41. 2) time, Inform. Process. Lett., 20 (1985), pp. 167-171.