Degree Aware Triangulation of Annular Regions
Document Type
Article
Publication Date
4-16-2018
Publication Title
Advances in Intelligent Systems and Computing
Volume
738
First page number:
683
Last page number:
690
Abstract
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.
Keywords
Annular region triangulation; Degree-constrained triangulation; Triangulation
Disciplines
Computer Engineering
Repository Citation
Gewali, L. P.,
Gurung, B.
(2018).
Degree Aware Triangulation of Annular Regions.
Advances in Intelligent Systems and Computing, 738
683-690.
http://dx.doi.org/10.1007/978-3-319-77028-4_87