Swap conditions for dynamic Voronoi diagrams for circles and line segments

Computer Aided Geometric Design

Volumn 16, Issue 2, 1999, Pages 89-106

  Gavrilova, Marina ^a   Rokne, Jon ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

Computational geometry; Dynamic Voronoi diagrams

Indexed keywords

COMPUTATIONAL GEOMETRY; MATHEMATICAL TRANSFORMATIONS; TOPOLOGY;

CIRCLES AND LINE SEGMENTS; VORONOI DIAGRAMS;

COMPUTER AIDED DESIGN;

EID: 0033078471     PISSN: 01678396     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8396(98)00039-9     Document Type: Article

References (27)

1. Abramovski, S., Lang, B. and Miller, H. (1989), Moving regular k-gons in contact, in: Proc. of the International Workshop on Graph-Theoretic Concepts in Computer Science, 229-242.
2. Algorri, M. and Schmitt, F. (1996), Mesh Simplification, in: Eurographics-96, Blackwell Publishers, Eurographics Association 15, 3, C-77-C-86.
3. Atallah, M. (1985), Some dynamic computational geometry problems, Computers and Mathematics with Applications 11, 1171-1181.
4. Aurenhammer, F. (1991), Voronoi diagrams - a survey of a fundamental geometric data structure, ACM Computing Surveys 23, 3, 345-405.
5. Burden, R. and Faires, D. (1997), Numerical Analysis, 6th ed., Brooks and Cole Publishers Corporation, Pacific Grove, CA, USA.
6. Devillers, O., Golin, M., Kedem, K. and Schirra, S. (1994), Revenge of the dog: queries on Voronoi diagrams of moving points, in: Proc. of the 6th Canadian Conference on Computational Geometry, 122-127.
7. Dobrindt, K. and Yvinec, M. (1993), Remembering conflicts in history yields dynamic algorithms, in: Proc. of the 4th International Symposium on Algorithms and Computation, 21-30.
8. Dunlaing, C. and Yao, C. (1985), A "Retraction" method for planning the motion of a disk, Journal of Algorithms 6, 104-111.
9. Fu, J. and Lee, R. (1991), Voronoi diagrams of moving points in the plane, International Journal of Computational Geometry and Applications 1, 1, 23-32.
10. Gavrilov, D. and Vinogradov, O. (1994), Object-oriented library for simulation of granular-type materials, in: Proc. of 1994 Summer Computer Simulation Conference, 51-56.
11. Gavrilova, M. and Rokne, J. (1996), An efficient algorithm for construction of the power diagram from the Voronoi diagram in the plane, International Journal of Computer Mathematics, Overseas Publishers Association 61, 49-61.
12. Golin, M., Schwarz, C. and Smid, M. (1992), Further dynamic computational geometry, in: Proc. of 4th Canadian Conference on Computational Geometry, 154-159.
13. Guibas, L., Mitchell, J. and Roos, T. (1991), Voronoi diagrams of moving points in the plane, in: Lecture Notes in Computer Science, Vol. 570, 113-125.
14. Gupta, P., Janardan, R. and Smid, M. (1994), Fast algorithms for collision and proximity problems involving moving geometric objects, Report MPI-I-94-113, Max-Planck-Institut für Informatik, Zaarbrücken.
15. Hamann, B. and Tsai, P. (1998), Decomposing trimmed surfaces using the Voronoi diagram and a scan line algorithm, Applied Mathematics and Computation 89, 327-344.
16. Held, M., Klosewski, J. and Mitchell, J. (1996), Collision detection for fly-throughs in virtual environments, in: Proc. of the 12th Annual ACM Symposium on Computational Geometry, V13-V14.
17. Hoppe, H. (1996), Progressive meshes, in: Computer Graphics Proceedings, Annual Conference Series, 99-108.
18. Hubbard, P. (1995), Real-time collision detection and time-critical computing, in: Proc. of the 1995 Workshop on Simulation and Interaction in Virtual Environments, 92-96.
19. Hubbard, P. (1996), Approximating polyhedra with spheres for time-critical collision detection, ACM Transaction on Graphics 15, 3, 179-210.
20. Huttenlocher, D., Kedem, K. and Kleinberg, J. (1992), On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane, in: Proc. of the 6th ACM Symposium on Computational Geometry, 110-120.
21. Lin, M. (1993), Efficient collision detection for animation and robotics, PhD Thesis, Department of Electrical and Engineering Computer Science, University of California, Berkeley, CA, USA.
22. Marsden, J. (1973), Basic Complex Analysis, W.H. Freeman and Company, San Francisco, CA, USA.
23. Okabe, A., Boots, B. and Sugihara, K. (1992), Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, Wiley, Chichester, West Sussex, England, 205-208.
24. Park, J. and Fussell, D. (1997), Forward dynamics based realistic animation of rigid bodies, Computers and Graphics 21, 4, 483-496.
25. Ponamgi, M., Dinesh, M. and Ming, C. (1997), Incremental algorithm for collision detection between polygonal models, IEEE Transaction on Visualization and Computer Graphics 3, 1, 51-64.
26. Rokne, J. (1991), Appolonius's 10th Problem, Graphic Gems, Academic Press, 19-24.
27. Roos, T. and Noltemeier, H. (1991), Dynamic Voronoi diagrams in motion planning, in: Lecture Notes in Computer Science, Vol. 553, Springer, New York, 227-236.