Motorcycle graphs and straight skeletons

Algorithmica (New York)

Volumn 47, Issue 2, 2007, Pages 159-182

  Cheng, Siu Wing ^a   Vigneron, Antoine ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b UR341 National Agronomical Research Institute (INRA)   (France)

Author keywords

Computational geometry; Medical axis; Motorcycle graph; Randomized algorithm; Straight skeleton

Indexed keywords

MEDICAL AXIS; MOTORCYCLE GRAPH; RANDOMIZED ALGORITHMS; STRAIGHT SKELETON;

ALGORITHMS; COMPUTATIONAL GEOMETRY; NUMERICAL METHODS; RANDOM PROCESSES;

GRAPH THEORY;

EID: 33846891597     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-006-1229-7     Document Type: Article

References (36)

1. P. K. Agarwal. Partitioning arrangement of lines, I: An efficient deterministic algorithm. Discrete Comput. Geom., 5:449-483, 1990.
2. P. K. Agarwal, O. Schwarzkopf, and M. Sharir. The overlay of lower envelopes and its applications. Discrete Comput. Geom., 15:1-13, 1996.
3. O. Aichholzer and F. Aurenhammer. Straight skeletons for general polygonal figures in the plane. In Proc. 2nd Annu. Int. Conf. Comput. Comb., volume 1090 of LNCS, pages 117-126, 1996.
4. O. Aichholzer, F. Aurenhammer, D. Alberts, and B. Gärtner. A novel type of skeleton for polygons. J. Univ. Comp. Sci., 1(12):752-761, 1995.
5. O. Aichholzer, F. Aurenhammer, and B. Palop. Quickest paths, straight skeletons and the city voronoi diagram. Discrete Comput. Geom., 5(1): 17-35, 2004.
6. G. Barequet, M. T. Goodrich, A. Levi-Steiner, and D. Steiner. Straight-skeleton based contour interpolation. In Proc. 14th Annu. ACM-SIAM Symp. Discrete Alg., pages 119-127, 2003.
7. G. Barequet and E. Yakersberg. Morphing between shapes by using their straight skeletons. In Proc. 19th Annu. Symp. Comput. Geom., pages 378-379, 2003.
8. C. Brenner. Towards fully automatic generation of city models. In Proc. XIXth ISPRS Congress, volume 33-B3 of Internat. Arch. Photogramm. Remote Sensing, pages 85-92, 2000.
9. B. Chazelle. Cutting hyperplanes for divide-and-conquer. Discrete Comput. Geom., 9:145-158, 1993.
10. B. Chazelle and J. Friedman. A deterministic view of random sampling and its use in geometry. Combinatorica, 10(3):229-249, 1990.
11. B. Chazelle and L. Guibas. Visibility and intersection problems in plane geometry. Discrete Comput. Geom., 4:551-581, 1989.
12. B. Chazelle, D. Liu, and A. Magen. Sublinear geometric algorithms. In Proc. 35th ACM Symp. Theory Comput., pages 531-540, 2003.
13. S.-W. Cheng and A. Vigneron. Motorcycle graphs and straight skeletons. In Proc. 13th Annu. ACM-SIAM Symp. Discrete Alg., pages 156-165, 2002.
14. F. Chin, J. Snoeyink, and C. A. Wang. Finding the medial axis of a simple polygon in linear time. Discrete Comput. Geom., 21(3):405-420, 1999.
15. F. Cloppet, J.-M. Oliva, and G. Stamon. Angular bisector network, a simplified generalized voronoi diagram: application to processing complex intersections in biomedical images. IEEE Trans. Pattern Anal. Mach. Intell., 22(1):120-128, 2000.
16. M. de Berg, K. Dobrindt, and O. Schwarzkopf. On lazy randomized incremental construction. Discrete Comput. Geom., 14:261-286, 1995.
17. M. de Berg, D. Halperin, M. Overmars, J. Snoeyink, and M. van Kreveld. Efficient ray shooting and hidden surface removal. Algorithmica, 12:30-53, 1994.
18. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, 2nd edition, 2000.
19. E. D. Demaine, M. L. Demaine, and A. Lubiw. Folding and cutting paper. In Proc. Japan Conf. Discrete Comput. Geom., volume 1763 of LNCS, pages 104-118, 1998.
20. E. D. Demaine, M. L. Demaine, and A. Lubiw. Folding and one straight cut suffice. In Proc. 10th Annu. ACM-SIAM Symp. Discrete Alg., pages 891-892, 1999.
21. E. D. Demaine, M. L. Demaine, and J. S. B. Mitchell. Folding flat silhouettes and wrapping polyhedral packages: new results in computational origami. Comput. Geom., 1(16):3-21, 2000.
22. D. Eppstein and J. Erickson. Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions. Discrete Comput. Geom., 22:569-592, 1999.
23. P. Felkel and Š. Obdržálek. Straight skeleton implementation. In Proc. 14th Spring Conf. Comp. Graphics, pages 210-218, 1998.
24. P. Felkel and Š. Obdržálek. Improvement of Oliva's algorithm for surface reconstruction from contours. In Proc. 15th Spring Conf. Comp. Graphics, pages 254-263, 1999.
25. S. Har-Peled. Constructing planar cuttings in theory and practice. SIAM J. Comput., 29(6):2016-2039, 2000.
26. J. Hershberger. Finding the upper envelope of n line segments in O(n log n) time. Inform. Process. Lett., 33(4): 169-174, 1989.
27. J. Hershberger and S. Suri. A pedestrian approach to ray shooting: shoot a ray, take a walk. J. Algorithms, 18(3):403-431, 1995.
28. J. Kleinberg and E. Tardos. Algorithm Design, Pearson Studium, Boston, 2006.
29. R. G. Laycock and A. M. Day. Automatically generating large urban environments based on the footprint data of buildings. In Proc. 8th ACM Symp. Solid Model. Appl., pages 346-351, 2003.
30. J. Matoušek. Construction of ε-nets. Discrete Comput. Geom., 5:427-448, 1990.
31. J. Matoušek. Cutting hyperplane arrangements. Discrete Comput. Geom., 6:385-406, 1991.
32. J. Matoušek. Efficient partition trees. Discrete Comput. Geom., 8:315-334, 1992.
33. J.-M. Oliva, M. Perrin, and S. Coquillart. 3D reconstruction of complex polyhedral shapes from contours using a simplified generalized Voronoi diagram. Comput. Gmphics Forum, 15(3):397-408, 1996.
34. M. Tanase and R. C. Veltkamp. Polygon decomposition based on the straight line skeleton. In Proc. 19th Annu. Symp. Comput. Geom., pages 58-67, 2003.
35. M. Tanase and R. C. Veltkamp. A straight skeleton approximating the medial axis. In Proc. 12th Euro. Symp. Alg., pages 809-821, 2004.
36. R. Tarjan. Data Structures and Network Algorithms. SIAM, Philadelphia, PA, 1983.