An empirical comparison of techniques for updating delaunay triangulations

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2004, Pages 170-179

  Guibas, Leonidas ^a   Russel, Daniel ^a  

^a Stanford University   (United States)

Author keywords

Delaunay triangulation update motion

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA STRUCTURES; OPTIMIZATION; PERTURBATION TECHNIQUES; PROBLEM SOLVING; TRIANGULATION;

DELAUNAY TRIANGULATION UPDATE MOTION; KINETIC DATA STRUCTURES; VORONOI DIAGRAMS;

COMPUTATIONAL GEOMETRY;

EID: 4544375869     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/997817.997846     Document Type: Conference Paper

References (35)

1. M. Abellanas, F. Hurtado, and P. A. Ramos. Structural tolerance and Delaunay triangulation. Information Processing Letters, 71(5-6):221-227, 1999.
2. N. Amenta and M. W. Bern. Surface reconstruction by voronoi filtering. In Symp. on Comp. Geom., pages 39-48, 1998.
3. N. Amenta, S. Choi, and G. Rote. Incremental constructions con BRIO. In Proc. of the 19th conference on Comp. geometry, pages 211-219, 2003.
4. D. Attali, J.-D. Boissonnat, and A. Lieutier. Complexity of the delaunay triangulation of points on surfaces the smooth case. In Proc. of the 19th conference on Comp. geometry, pages 201-210. ACM Press, 2003.
5. F. Aurenhammer. Power diagrams: properties, algorithms, and applications. SIAM J. on Computing, 16:78-96, 1987.
6. D. Bandyopadhyay and J. Snoeyink. Almost-Delaunay simplices: Nearest neighbor relations for imprecise points. In ACM-SIAM Symp. on Discrete Algorithms, pages 403-412, 2004.
7. J. Basch, L. Guibas, and J. Hershberger. Data structures for mobile data. In ACM-SIAM Symp. on Discrete Algorithms, pages 747-756, 1997.
8. J. Basch, L. J. Guibas, and J. Hershberger. Data structures for mobile data. In ACM-SIAM symp. on discrete algorithms, pages 747-756. Society for Industrial and Applied Mathematics, 1997.
9. J. Basch, L. J. Guibas, C. D. Silverstein, and L. Zhang. A practical evaluation of kinetic data structures. In Proc. of the 13th annual symp. on Comp. geometry, pages 388-390, 1997.
10. d. Computer Aided Design, 30:333-341, 1998.
11. O. Devillers. Improved incremental randomized Delaunay triangulation. In Proc. of the 14th annual symp. on comp. geometry, 1998.
12. O. Devillers and S. Pion. Efficient exact geometric predicates for delaunay triangulations. In Proc. 5th Workshop Algorithm Engineering Experiments, pages 37-44, 2003.
13. O. Devillers and M. Teillaud. Perturbations and vertex removal in a 3d Delaunay triangulation. In ACM-SIAM symp. on Discrete algorithms, pages 313-319. Society for Industrial and Applied Mathematics, 2003.
14. H. Edelsbrunner. The union of balls and its dual shape. Discrete Comp. Geom., 13:415-440, 1995.
15. H. Edelsbrunner and P. Koehl. The weighted volume derivative of a space-filling diagram. In Proc. of the National Academy of Science, volume 100, pages 2203-2208, 2003.
16. H. Edelsbrunner and R. Seidel. Voronoi diagrams and arrangements. In Proc. of the 1st annual symp. on comp. geometry, pages 251-262. ACM Press, 1985.
17. H. Edelsbrunner and N. R. Shah. Incremental topological flipping works for regular triangulations. In Proc. of the 8th annual symp. on comp. geometry, pages 43-52, ACM Press, 1992.
18. J. Erickson. Local polyhedra and geometric graphs. In Proc. of the 19th annual conference on Comp. geometry, pages 171-180. ACM Press, 2003.
19. J. Erikson. Dense point sets have sparse Delaunay triangulations. In ACM-SIAM Symp. on Discrete Algorithms, pages 125-134, 2002.
20. G. D. Fabritiis and P. V. Coveney. Dynamical geometry for multiscale dissipative particle dynamics. arXiv.condmat:0301378.
21. J. Gao, L. Guibas, and A. Nguyen. Deformable spanners and their applications. 2004.
22. M. Gavrilova and J. Rokne. Collision detection optimization in a multi-particle system. International Workshop on Comp. Geom. and Applications, 2331:105-114, 2002.
23. GNU scientific library, http://www.gnu.org/software/gsl/.
24. E. Guendelman, R. Bridson, and R. Fedkiw. Nonconvex rigid bodies with stacking. ACM Transactions on Graphics, 22(3):871-878, 2003.
25. L. Guibas. Kinetic data structures: A state of the art report. In Proc. 3rd Workshop on Algorithmic Foundations of Robotics, 1998.
26. L. Guibas and M. Karavelas. Interval methods for kinetic simulations. In Proc. of the 15th annual symp. on comp. geometry, pages 255-264, 1999.
27. L. Guibas, M. Karaveles, and D. Russel. A comp. framework for handling motion. In ALENEX 2004, Lecture notes in Compute science, 2004. to appear.
28. L. Guibas, D. Knuth, and M. Sharir. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica, 7:381-413, 1992.
29. L. Guibas, A. Nguyen, D. Russel, and L. Zhang. Collision detection for deforming necklaces. In Proc. of the 18th annual symp. on comp. geom, pages 33-42. ACM Press, 2002.
30. L. J. Guibas and L. Zhang. Euclidean proximity and power diagrams. In Canadian Conference on Comp. Geom., pages 90-91, 1998.
31. B. Joe. Three-dimensional triangulations from local transformations. SIAM J. on Scientific and Statistical Computing, 10:718-741, 1989.
32. J. R. Shewchuk. A condition guaranteeing the existence of higher-dimensional constrained Delaunay triangulations. In Proc. of the 14th annual symp. on Comp. geometry, pages 76-85, 1998.
33. P. Su and R. L. D. III. A comparison of sequential Delaunay triangulation algorithms. In Proc. of the 11th annual symp. on Comp. Geom., pages 61-70, 1995.
34. Tinker molecular simulation package. http://dasher.wustl.edu/tinker/.
35. R. C. Whaley, A. Petitet, and J. Dongarra. Automated empirical optimizations of software and the ATLAS project. Parallel Computing, 27(1-2):3-35, 2001.