Summary
We present an iterative algorithm to transform a given planar triangle mesh into a well-centered one by moving the interior vertices while keeping the connectivity fixed. A well-centered planar triangulation is one in which all angles are acute. Our approach is based on minimizing a certain energy that we propose. Well-centered meshes have the advantage of having nice orthogonal dual meshes (the dual Voronoi diagram). This may be useful in scientific computing, for example, in discrete exterior calculus, in covolume method, and in space-time meshing. For some connectivities with no well-centered configurations, we present preprocessing steps that increase the possibility of finding a well-centered configuration. We show the results of applying our energy minimization approach to small and large meshes, with and without holes and gradations. Results are generally good, but in certain cases the method might result in inverted elements.
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
Abraham, R., Marsden, J. E., and Ratiu, T. Manifolds, Tensor Analysis, and Applications, second ed. Springer–Verlag, New York, 1988.
Alliez, P., Cohen-Steiner, D., Yvinec, M., and Desbrun, M. Variational tetrahedral meshing. ACM Transactions on Graphics 24, 3 (2005), 617–625.
Bern, M., Mitchell, S., and Ruppert, J. Linear-size nonobtuse triangulation of polygons. In Proceedings of the tenth annual ACM Symposium on Computational Geometry (New York, 1994), ACM Press, pp. 221–230.
Bern, M. W., Eppstein, D., and Gilbert, J. Provably good mesh generation. J. Computer and Systems Sciences 48, 3 (June 1994), 384–409. Special issue for 31st FOCS.
Bobenko, A. I., and Springborn, B. A. Variational principles for circle patterns and Koebe’s theorem. Trans. Amer. Math. Soc. 356 (2004), 659–689.
Clarke, F. H. Optimization and Nonsmooth Analysis. Society for Industrial and Applied Mathematics (SIAM), 1990.
Collins, C. R., and Stephenson, K. A circle packing algorithm. Computational Geometry: Theory and Applications 25, 3 (2003), 233–256.
Desbrun, M., Hirani, A. N., Leok, M., and Marsden, J. E. Discrete exterior calculus. arXiv:math.DG/0508341 (August 2005). Available from: http://arxiv.org/abs/math.DG/0508341.
Du, Q., Faber, V., and Gunzburger, M. Centroidal Voronoi tessellations: applications and algorithms. SIAM Review 41, 4 (1999), 637–676.
Edelsbrunner, H. Geometry and Topology for Mesh Generation. Cambridge University Press, 2001.
Edelsbrunner, H., Tan, T. S., and Waupotitsch, R. An O(n2 log n) time algorithm for the minmax angle triangulation. In SCG90: Proceedings of the sixth annual ACM Symposium on Computational Geometry (New York, 1990), ACM Press, pp. 44–52.
Erickson, J., Guoy, D., Sullivan, J., and Ungor, A. Building spacetime meshes over arbitrary spatial domains. In Proceedings of the 11th International Meshing Roundtable (2002), pp. 391–402.
Heath, M. T. Scientific Computing: An Introductory Survey, second ed. McGraw-Hill, 2002.
Hirani, A. N. Discrete Exterior Calculus. PhD thesis, California Institute of Technology, May 2003. Available from: http://resolver.caltech.edu/CaltechETD:etd-05202003-095403.
Maehara, H. Acute triangulations of polygons. European Journal of Combinatorics 23, 1 (2002), 45–55.
Melissaratos, E. A., and Souvaine, D. L. Coping with inconsistencies: A new approach to produce quality triangulations of polygonal domains with holes. In SCG ’92: Proceedings of the Eighth Annual Symposium on Computational Geometry (New York, NY, USA, 1992), ACM Press, pp. 202–211.
Nicolaides, R. A. Direct discretization of planar div-curl problems. SIAM J. Numer. Anal. 29, 1 (1992), 32–56.
Ruppert, J. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms 18, 3 (1995), 548–585.
Üngör, A., and Sheffer, A. Pitching tents in space-time: Mesh generation for discontinuous Galerkin method. International Journal of Foundations of Computer Science 13, 2 (2002), 201–221.
Yuan, L. Acute triangulations of polygons. Discrete and Computational Geometry 34, 4 (2005), 697–706.
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
VanderZee, E., Hirani, A.N., Guoy, D., Ramos, E. (2008). Well-centered Planar Triangulation – An Iterative Approach. 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_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-75103-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75102-1
Online ISBN: 978-3-540-75103-8
eBook Packages: EngineeringEngineering (R0)