The treatment of non-flippable configurations in three dimensional regular triangulations

WSEAS Transactions on Systems

Volumn 5, Issue 5, 2006, Pages 1100-1107

  Beyer, Tilo ^a   Meyer Hermann, Michael ^a  

^a FRANKFURT INSTITUTE FOR ADVANCED STUDIES   (Germany)

Author keywords

Delaunay triangulation; Granular media; Many particle simulation; Voronoi tessellation

Indexed keywords

ALGORITHMS; ERROR CORRECTION; SORTING; THREE DIMENSIONAL;

DELAUNAY TRIANGULATION; GRANULAR MEDIA; MANY PARTICLE SIMULATION; VORONOI TESSELLATION;

SYSTEMS SCIENCE;

EID: 33744725603     PISSN: 11092777     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. Aurenhammer F. Voronoi diagram - a survey of a fundamental geometric data structure. ACM Computing Survey, Vol. 23, No. 3, 1991, pp. 345-405.
2. Okabe A., Boots B., Sugihara K.,and Chiu S.N Spatial tessellations: Concepts and applications of Voronoi diagrams. Probability and Statistics, 2nd ed. Wiley, NYC, 2000.
3. Beyer T., Schaller G., Deutsch A., and Meyer-Hermann M. Parallel dynamic and kinetic regular triangulation in three dimensions. Comput. Phys. Commun.,Vol. 172, No. 2, 2005, pp. 86-108.
4. Lawson C.L. Generation of a triangular grid with applications to contour plotting. Tech. rep., Memo 299, Jet Propulsion Laboratory, Pasadena, California, 1972.
5. Edelsbrunner H. and Shah N.R. Incremental topological flipping works for regular triangulations. Algorithmica, Vol. 15, No. 3, 1996, pp. 223-41.
6. Vigo M. and Pla N. Regular triangulations of dynamic sets of points. CAGD, Vol. 19, No. 2, 2002, pp. 127-49.
7. Guibas L. and Russel D. An empirical comparison of techniques for updating Delaunay triangulations. In Proceedings of the twentieth annual symposium on Computational geometry. ACM Press New York, NY, USA, 2004.
8. Ferrez J.A. Dynamic triangulations for efficient 3D simulation of granular materials. Ph.D. thesis, Ecole Polytechnique Federal de Lausanne, 2001.
9. Aurenhammer F. Power diagram: properties, algorithms and applications. SIAM J., Vol. 16, No. 1, 1987, pp. 78-96.
10. Brown K.Q. Voronoi diagrams form convex hulls. Inf. Process. Lett., Vol. 9, No. 5, 1979, pp. 223-8.
11. Milcke E.P. A Robust Implementation for three-dimensional Delaunay Triangulations. Int. J. Comput. Geom. Appl., Vol.8, No 2, 1998, pp. 255-76.
12. Joe B.Three dimensional triangulations from local transformations. SIAM J. Sci. Stat. Comput., Vol. 10, 1989, pp. 718-41.
13. Joe B. Construction of three-dimensional Delaunay triangulations using local transformations. Computer Aided Geometric Design, Vol. 8, 1991, pp. 123-42.
14. Schaller G.and Meyer-Hermann M. Dynamic Delaunay tetrahedralizations and Voronoi tesselations in three dimensions. Comput. Phys. Commun., Vol. 162, 2004, pp. 9-23.
15. Message Passing Interface Forum. MPI: A Message-Passing Interface Standard. Tech. Rep. CS-94-230, University of Tennessee,Knoxville, TN, 1994.
16. McLain D.H. Two dimensional interpolation from random data.Comput. J., Vol. 19, No. 2, 1976, pp. 178-81.
17. Tanemura, M., Ogawa T., and Ogita N. A new algorithm for three-dimensional voronoi tesselation. J. Comp. Phys., Vol. 51, 1983, pp. 191-207.
18. Cignoni P., Montani C., Pereo R., and Scopino R. Parallel 3D Delaunay triangulation. Computer Graphics Forum, Vol. 12, No. 3, 1993, pp. 129-42.
19. Teng Y.A., Sullivan F., Beichl I., and Puppo E. A data-parallel algorithm for three-dimensional delaunay triangulation and its implementation. In Proceedings of Supercomputing, 1993.
20. Schaller G. and Meyer-Hermann M. Multicellular Tumor Spheroids in an off-lattice Voronoi/Delaunay cell model. Phys. Rev. E, Vol. 71, No. 5, 2005, DOI 051910.
21. Chrisochoides N. and Sukup F. Task parallel implementation of the Bowyer-Watson algorithm. Tech. Rep. CTC96TR235, Cornell Theory Center, 1996.