Interleaving delaunay refinement and optimization for 2D triangle mesh generation

Proceedings of the 16th International Meshing Roundtable, IMR 2007

Volumn , Issue , 2008, Pages 83-101

  Tournois, Jane ^a   Alliez, Pierre ^a   Devillers, Olivier ^a  

^a INRIA   (France)

Author keywords

2D triangle mesh generation; Bounded Voronoi diagram; Delaunay refinement; Mesh smoothing; Optimization

Indexed keywords

CONSTRAINED DELAUNAY TRIANGULATION; DELAUNAY REFINEMENTS; MESH SMOOTHING; PLANAR STRAIGHT-LINE GRAPHS; STEINER POINTS; TRIANGLE MESH; VORONOI DIAGRAMS; VORONOI VERTICES;

ALGORITHMS; CONSTRAINED OPTIMIZATION; GRAPH THEORY; GRAPHIC METHODS; ITERATIVE METHODS; OPTIMIZATION;

MESH GENERATION;

EID: 84878192334     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-75103-8_5     Document Type: Conference Paper

References (26)

1. F.J. BOSSEN and P.S. HECKBERT. A pliant method for anisotropic mesh generation. In Proceedings of 5th International Meshing Roundtable, pages 63-74, oct 1996.
2. N. COLL, M. GUERRIERI, and J.A. SELLARÈS. Mesh modification under local domain changes. In Proceedings of the 15th International Meshing Roundtable, pages 39-56, 2006.
3. S.E. PAV G.L. MILLER and N.J. WALKINGTON. When and why Delaunay refinement algorithms work. International Journal of Computational Geometry and Applications (IJCGA), 15(1):25-54, feb 2005.
4. P. CHEW. Constrained delaunay triangulations. Algorithmica, 4(1):97-108, 1989.
5. J. RUPPERT. A delaunay refinement algorithm for quality 2-dimensional mesh generation. Journal of Algorithms, 18(3):548-585, 1995.
6. J.R. SHEWCHUCK. Delaunay refinement algorithms for triangular mesh generation. Computational Geometry, 22:21-74, 2002.
7. Aüngö R. Off-centers: A new type of steiner points for computing size-optimal quality-guaranteed delaunay triangulations. In LATIN: Latin American Symposium on Theoretical Informatics, 2004.
8. A.N. CHERNIKOV and N.P. CHRISOCHOIDES. Generalized delaunay mesh refinement: From scalar to parallel. In Proceedings of the 15th International Meshing Roundtable, pages 563-580, 2006.
9. H. ERTEN and A. ÜNGÖR. Triangulations with locally optimal steiner points. Eurographics Symposium on Geometry Processing, 2007.
10. J.R. SHEWCHUCK. What is a good linear element? interpolation, conditioning, and quality measures. 11th International Meshing Roundtable, pages 115-126, 2002.
11. M. BERN N. AMENTA and D. EPPSTEIN. Optimal point placement for mesh smoothing. Journal of Algorithms, 30(2):302-322, 1999.
12. D. EPPSTEIN. Global optimization of mesh quality. Tutorial at the 10th International Meshing Roundtable, 10, 2001.
13. L. CHEN. Mesh smoothing schemes based on optimal delaunay triangulations. In Proceedings of 13th International Meshing Roundtable, pages 109-120, 2004.
14. V. FABER Q. DU and M. GUNZBURGER. Centroidal voronoi tesselations: Applications and algorithms. SIAM review, 41(4):637-676, 1999.
15. M. EMELIANENKO Q. DU and L. JU. Convergence of the lloyd algorithm for computing centroidal voronoi tesselations. SIAM Journal, Numerical Analysis, 44(1):102-119, 2006.
16. Q. DU and M. EMELIANENKO. Acceleration schemes for computing centroidal Voronoi tessellations. j-NUM-LIN-ALG-APPL, 13(2-3):173-192, mar-apr 2006.
17. Q. DU and M. EMELIANENKO. Uniform convergence of a nonlinear energy-based multilevel quantization scheme via centroidal voronoi tessellations. submitted to SIAM J. Numer. Anal., 2006.
18. S. LLOYD. Least square quantization in pcm. IEEE Trans. Inform. Theory, 28:129-137, 1982.
19. J.R. SHEWCHUK. Triangle: Engineering a 2d quality mesh generator and delaunay trian-gulator. Applied Computational Geometry: Towards Geometric Engineering, 1148:203-222, 1996.
20. M. GUNZBURGER Q. DU and L. JU. Constrained centroidal voronoi tessellations for surfaces. SIJSSC: SIAM Journal on Scientific and Statistical Computing, 24, 2003.
21. R. SEIDEL. Constrained Delaunay triangulations and Voronoi diagrams with obstacles. pages 178-191. 1988.
22. Q. DU and D. WANG. Recent progress in robust and quality delaunay mesh generation. Journal of Computational and Applied Mathematics, 2005.
23. A. FABRI, G.-J. GIEZEMAN, L. KETTNER, S. SCHIRRA, and S. SCHÖNHERR. On the design of CGAL, a computational geometry algorithms library. Softw.-Pract. Exp., 30(11):1167-1202, 2000.
24. J.R. SHEWCHUK. Mesh generation for domains with small angles. Proceedings of the sixteenth annual Symposium on Computational Geometry, pages 1-10, 2000.
25. L. RINEAU. 2d conforming triangulations and meshes. In CGAL Editorial Board, editor, CGAL User and Reference Manual. 3.3 edition, 2007.
26. M. YVINEC P. ALLIEZ, D. COHEN-STEINER and M. DESBRUN. Variational tetrahedral meshing. ACM Transactions on Graphics, 24(3):617-625, july 2005.