Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions

Discrete and Computational Geometry

Volumn 22, Issue 4, 1999, Pages 569-592

  Eppstein, D ^a   Erickson, J ^b,c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Duke University   (United States)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033450714     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009479     Document Type: Article

References (65)

1. P. K. Agarwal and J. Erickson. Geometric range searching and its relatives. In Advances in Discrete and Computational Geometry, B. Chazelle, J. E. Goodman, and R. Pollack, editors, pp. 1-58. Contemporary Mathematics 223, American Mathematical Society, Providence, RI, 1999.
2. P. K. Agarwal and J. Matoušek. Ray shooting and parametric search. SIAM J. Comput. 22(4):794-806, 1993.
3. P. K. Agarwal and J. Matoušek. On range searching with semialgebraic sets. Discrete Comput. Geom. 11:393-418, 1994.
4. P. K. Agarwal and J. Matoušek. Dynamic half-space range reporting and its applications. Algorithmica 13:325-345, 1995.
5. P. K. Agarwal and M. Sharir. Applications of a new space-partitioning technique. Discrete Comput. Geom. 9:11-38, 1993.
6. A. Aggarwal, L. J. Guibas, J. Saxe, and P. W. Shor. A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discrete Comput. Geom. 4(6):591-604, 1989.
7. O. Aichholzer, F. Aurenhammer. Straight skeletons for general polygonal figures in the plane. Proc. 2nd Ann. Internat. Conf. Computing and Combinatorics, pp. 117-126. Lecture Notes in Computer Science 1090, Springer-Verlag, Berlin, 1996.
8. O. Aichholzer, F. Aurenhammer, D. Alberts, and B. Gärtner. A novel type of skeleton for polygons. J. Universal Comput. Sci. 1(12):752-761, 1995. 〈ttp://www.iicm.edu/jucs_1_12/a_novel_type_of〉.
9. M. J. Atallah, P. Callahan, and M. T. Goodrich. P-complete geometric problems. Internat. J. Comput. Geom. Appl. 3:443-462, 1993.
10. D. Baraff. Interactive simulation of solid rigid bodies. IEEE Comput. Graph. Appl. 15(3):63-75, 1995.
11. J. Basch, L. J. Guibas, and J. Hershberger. Data structures for mobile data. Proc. 8th ACM-SIAM Symp. Discrete Algorithms, pp. 747-756, 1997.
12. J. Basch, L. J. Guibas, and L. Zhang. Proximity problems on moving points. Proc. 13th Ann. ACM Symp. Comput. Geom., pp. 344-351, 1997.
13. 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.
14. M. Bern, E. Demaine, D. Eppstein, and B. Hayes. A disk-packing algorithm for an origami magic trick. To appear in Proc. Internat. Conf. Fun with Algorithms, 1998. 〈http://daisy.uwaterloo.ca/~eddemain/ papers/FUN98/〉.
15. J. Bentley and J. Saxe. Decomposable searching problems, I: Static-to-dynamic transformations. J. Algorithms 1:301-358, 1980.
16. H. Blum. A transformation for extracting new descriptors of shape. In Models for the Perception of Speech and Visual Form, W. Dunn, editor, pp. 362-380. MIT Press, Cambridge, MA, 1967.
17. F. L. Bookstein. The line-skeleton. Comput. Graph. Image Process. 11:123-137, 1979.
18. L. Calabi and W. E. Hartnett. Shape recognition, prairie fires, convex deficiencies and skeletons. Amer. Math. Monthly 75:335-342, 1968.
19. T. M. Chan. Fixed-dimensional linear programming queries made easy. Proc. 12th Ann. ACM Symp. Comput. Geom., pp. 284-290, 1996.
20. T. M. Chan. Geometric applications of a randomized optimization technique. Proc. 14th Ann. ACM Symp. Comput. Geom., pp. 269-278, 1998.
21. B. Chazelle, H. Edelsbrunner, L. J. Guibas, and M. Sharir. A singly-exponential stratification scheme for real semi-algebraic varieties and its applications. Theoret. Comput. Sci. 84:77-105, 1991.
22. B. Chazelle, H. Edelsbrunner, L. J. Guibas, M. Sharir, and J. Stolfi. Lines in space: combinatorics and algorithms. Algorithmica 15:428-447, 1996.
23. L. P. Chew. Building Voronoi Diagrams for Convex Polygons in Linear Expected Time. Technical Report PCS-TR90-147, Dept. Math. Comput. Sci., Dartmouth College, Hanover, NH, 1986.
24. P. Chew. Personal communication, 1998.
25. F. Chin, J. Snoeyink, and C.-A. Wang. Finding the medial axis of a simple polygon in linear time. Proc. 6th Ann. Internat. Symp. Algorithms Comput., pp. 382-391. Lecture Notes in Computer Science 1004, Springer-Verlag, Berlin, 1995.
26. J. D. Cohen, M. C. Lin, D. Manocha, and M. K. Ponamgi. I-COLLIDE: an interactive and exact collision detection system for large-scale environments. Proc. ACM Interactive 3D Graphics Conf., pp. 189-196, 1995.
27. J. Czyzowicz, I. Rival, and J. Urrutia. Galleries, light matchings and visibility graphs. Proc. 1st Workshop Algorithms Data Struct., pp. 316-324. Lecture Notes Computer Science 382, Springer-Verlag, Berlin, 1989.
28. E. D. Demaine, M. L. Demaine, and A. Lubiw. Folding and cutting paper. To appear in Proc. Japan Conf. Discrete Comput. Geom. Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1999. 〈http://daisy.uwaterloo.ca/~eddemain/papers/JCDCG98/〉.
29. O. Devillers. Randomization yields simple O(n log* n) algorithms for difficult Ω (n) problems. Internat. J. Comput. Geom. Appl. 2(1):97-111, 1992.
30. D. Dobkin and S. Suri. Maintenance of geometric extrema. J. Assoc. Comput. Mach. 38:275-298, 1991.
31. H. Edelsbrunner and J. H. Overmars. Batched dynamic solutions to decomposable searching problems. J. Algorithms 6:515-542, 1985.
32. D. Eppstein. Dynamic Euclidean minimum spanning trees and extrema of binary functions. Discrete Comput. Geom. 13:111-122, 1995.
33. D. Eppstein. Offline algorithms for dynamic minimum spanning tree problems. J. Algorithms 13:111-122, 1995.
34. D. Eppstein. Fast heirarchical clustering and other applications of dynamic closest pairs. Proc. 9th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 619-628, 1998.
35. D. Eppstein and J. Erickson. Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions. Proc. 14th Ann. ACM Symp. Comput. Geom., pp. 58-67, 1998.
36. A. Foisy, V. Hayward, and S. Aubry. The use of awareness in collision prediction. Proc. 1990 IEEE Internat. Conf. Robotics and Automation, pp. 338-343, 1990.
37. E. Fredkin and T. Toffoli. Conservative logic. Internat. J. Theoret. Phys. 21:219-253, 1981/82. Proceedings of Conference on Physics of Computation, Dedham, MA, 1981.
38. E. Fredkin and T. Toffoli. Conservative logic. Internat. J. Theoret. Phys. 21:219-253, 1981/82. Proceedings of Conference on Physics of Computation, Dedham, MA, 1981.
39. D. Griffeath and C. Moore. Life Without Death is P-complete. Complex Systems 10(6):437-447, 1997.
40. L. J. Guibas. Kinetic data structures: a state of the art report. Robotics: The Algorithmic Perspective (Proc. 1998 WAFR), pp. 191-210. A. K. Peters, Boston, MA, 1998.
41. H. N. Gürsoy and N. M. Patrikalakis. An automatic coarse and fine surface mesh generation scheme based on medial axis transform, Part I: Algorithm. Engrg Comput. 8:121-137, 1992.
42. M. Held. Voronoi diagrams and offset curves of curvilinear polygons. Comput. Aided Design 30(4):287-300, 1998.
43. M. Held, G. Lukács, and L. Andor. Pocket machining based on contour-parallel tool paths generated by means of proximity maps. Comput. Aided Design 26(3):189-203, 1994.
44. P. M. Hubbard. Collision detection for interactive graphics applications. IEEE Trans. Visual. Comput. Graphics 1(3):218-230, 1995.
45. D. Kim, L. J. Guibas, and S. Shin. Fast collision detection among multiple moving spheres. Proc. 13th Ann. ACM Symp. Comput. Geom., pp. 373-375, 1997.
46. R. Klein. Concrete and Abstract Voronoi Diagrams. Lecture Notes in Computer Science 400. Springer-Verlag, Berlin, 1989.
47. R. J. Lang. A computational algorithm for origami design. Proc. 12th Ann. ACM Symp. Comput. Geom., pp. 98-105, 1996.
48. D. T. Lee. Medial axis transformation of a planar shape. IEEE Trans. Pattern Anal. Mach. Intell. 4:363-369, 1982.
49. S. Lisberger, director. Tron. Walt Disney Productions, 1982. Motion picture, 96 minutes.
50. J. Matoušek. Reporting points in halfspaces. Comput. Geom. Theory Appl. 2(3): 169-186, 1992.
51. J. Matoušek. Range searching with efficient heirarchical cuttings. Discrete Comput. Geom. 10(2):157-182, 1993.
52. M. McAllister, D. Kirkpatrick, and J. Snoeyink. A compact piecewise-linear Voronoi diagram for convex sites in the plane. Discrete Comput. Geom. 15:73-195, 1996.
53. N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. J. Assoc. Comput. Mach. 30:852-865, 1983.
54. B. Mirtich and J. Canny. Impulse-based simulation of rigid bodies. Proc. Symp. Interactive 3D Graphics, pp. 181-188. ACM Press, New York, 1995.
55. S. Mohaban and M. Sharir. Ray shooting amidst spheres in three dimensions and related problems SIAM J. Comput. 26:654-674, 1997.
56. C. Ó'Dúnlaing and C. K. Yap. A "retraction" method for planning the motion of a disk. J. Algorithms 6:104-111, 1985.
57. A. Recuaero and J. P. Gutiérrez. Sloped roofs for architectural CAD systems. Microcomput. Civil Engrg 8:147-159, 1993.
58. M. I. Shamos. The Illustrated Encyclopedia of Billiards. Lyons and Burford Publishers, 1993.
59. V. Srinivasan, L. R. Nackman, J.-M. Tang, and S. N. Meshkat. Automatic mesh generation using the symmetric axis transform of polygonial domains. Proc. IEEE 80(9):1485-1501, 1992.
60. J. Stolfi. Oriented Projective Geometry: A Framework for Geometric Computations. Academic Press, New York, 1991.
61. J. A. Storer and J. H. Reif. Shortest paths in the plane with polygonal obstacles. J. Assoc. Comput. Mach. 41(5):982-1012, 1994.
62. A. Sudhalkar, L. Gursoz, and F. Prinz. Box-skeletons of discrete solids. Comput. Aided Design 28:507-517, 1996.
63. T. K. H. Tam and C. G. Armstrong. 2D finite element mesh generation by medial axis subdivision. Adv. Engrg Software Workstations 13(5-6):313-324, Sept. 1991.
64. P. Vaidya. Geometry helps in matching. SIAM J. Comput. 18:1201-1225, 1989.
65. P. J Vermeer. Medial Axis Transform to Boundary Representation Conversion. Ph.D. thesis, Comput. Sci. Dept., Purdue University, West Lafayette, IN 47907-1398, 1994.