Constrained triangulation of 2D shapes
Algorithms for triangulating two dimensional shapes have been used as sub-problems in many application areas that include finite element analysis, geographic information systems, and geometric compression. We consider a constrained version of triangulation problem in which the objective is to increase the proportion of even degree vertices. We present an effective approach for generating triangulated polygons with increased number of even degree vertices. The proposed approach is based on the convex decomposition of polygon followed by ‘diagonal flipping’ operation. © Springer International Publishing Switzerland 2016.
Constrained triangulation of 2D shapes. In Latifi Shahram (Ed.),
Advances in Intelligent Systems and Computing, 448