Summary
We address the problem of generating 2D quality triangle meshes from a set of constraints provided as a planar straight line graph. The algorithm first computes a constrained Delaunay triangulation of the input set of constraints, then interleaves Delaunay refinement and optimization. The refinement stage inserts a subset of the Voronoi vertices and midpoints of constrained edges as Steiner points. The optimization stage optimizes the shape of the triangles through the Lloyd iteration applied to Steiner points both in 1D along constrained edges and in 2D after computing the bounded Voronoi diagram. Our experiments show that the proposed algorithm inserts fewer Steiner points than Delaunay refinement alone, and improves over the mesh quality.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
P.Chew. Constrained delaunay triangulations. Algorithmica, 4(1):97–108, 1989.
J.Ruppert. A delaunay refinement algorithm for quality 2-dimensional mesh generation. Journal of Algorithms, 18(3):548–585, 1995.
J.R.Shewchuck. Delaunay refinement algorithms for triangular mesh generation. Computational Geometry, 22:21–74, 2002.
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.
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.
H.Erten and A.Üngör. Triangulations with locally optimal steiner points. Eurographics Symposium on Geometry Processing, 2007.
J.R.Shewchuck. What is a good linear element? interpolation, conditioning, and quality measures. 11th International Meshing Roundtable, pages 115–126, 2002.
M.Bern N.Amenta And D.Eppstein. Optimal point placement for mesh smoothing. Journal of Algorithms, 30(2):302–322, 1999.
D.Eppstein. Global optimization of mesh quality. Tutorial at the 10th International Meshing Roundtable, 10, 2001.
L.Chen. Mesh smoothing schemes based on optimal delaunay triangulations. In Proceedings of 13th International Meshing Roundtable, pages 109–120, 2004.
V.Faber Q.Du and M.Gunzburger. Centroidal voronoi tesselations: Applications and algorithms. SIAM review, 41(4):637–676, 1999.
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.
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.
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.
S.Lloyd. Least square quantization in pcm. IEEE Trans. Inform. Theory, 28:129–137, 1982.
J.R.Shewchuk. Triangle: Engineering a 2d quality mesh generator and delaunay triangulator. Applied Computational Geometry: Towards Geometric Engineering, 1148:203–222, 1996.
M.Gunzburger Q.Du And L.Ju. Constrained centroidal voronoi tessellations for surfaces. Sijssc: Siam Journal on Scientific and Statistical Computing, 24, 2003.
R.Seidel. Constrained Delaunay triangulations and Voronoi diagrams with obstacles. pages 178–191. 1988.
Q.Du And D.Wang. Recent progress in robust and quality delaunay mesh generation. Journal of Computational and Applied Mathematics, 2005.
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.
J.R.Shewchuk. Mesh generation for domains with small angles. Proceedings of the sixteenth annual Symposium on Computational Geometry, pages 1–10, 2000.
L.Rineau. 2d conforming triangulations and meshes. In CGAL Editorial Board, editor, CGAL User and Reference Manual. 3.3 edition, 2007.
M.Yvinec P.Alliez, D.Cohen-Steiner And M.Desbrun. Variational tetrahedral meshing. ACM Transactions on Graphics, 24(3):617–625, july 2005.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tournois, J., Alliez, P., Devillers, O. (2008). Interleaving Delaunay Refinement and Optimization for 2D Triangle Mesh Generation. In: Brewer, M.L., Marcum, D. (eds) Proceedings of the 16th International Meshing Roundtable. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75103-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-75103-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75102-1
Online ISBN: 978-3-540-75103-8
eBook Packages: EngineeringEngineering (R0)