Degree Aware Triangulation of Annular Regions
Advances in Intelligent Systems and Computing
First page number:
Last page number:
Generating constrained triangulation of point sites distributed in the plane is an important problem in computational geometry. We present theoretical and experimental investigation results for generating triangulations for polygons and point sites that address node degree constraints. We characterize point sites that have almost all vertices of odd degree. We present experimental results on the node degree distribution of Delaunay triangulation of point sites generated randomly. Additionally, we present a heuristic algorithm for triangulating a given normal annular region with increased number of even degree vertices.
Annular region triangulation; Degree-constrained triangulation; Triangulation
Gewali, L. P.,
Degree Aware Triangulation of Annular Regions.
Advances in Intelligent Systems and Computing, 738