Well-centered planar triangulation – an iterative approach.

*(English)*Zbl 1134.65330
Brewer, Michael L. (ed.) et al., Proceedings of the 16th international meshing roundtable, Seattle, WA, USA, October 14–17, 2007. Berlin: Springer (ISBN 978-3-540-75102-1/hbk). 121-138 (2008).

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.

For the entire collection see [Zbl 1122.65002].

For the entire collection see [Zbl 1122.65002].

##### MSC:

65D18 | Numerical aspects of computer graphics, image analysis, and computational geometry |

68U05 | Computer graphics; computational geometry (digital and algorithmic aspects) |