Efficient construction and simplification of Delaunay meshes

• المؤلفون الرئيسيون: Liu, Yong-Jin, Xu, Chun-Xu, Fan, Dian, He, Ying
• مؤلفون آخرون: School of Computer Science and Engineering
• التنسيق: مقال
• اللغة: English
• منشور في: 2018
• الموضوعات: Delaunay Triangulation; Delaunay Mesh
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/80803; http://hdl.handle.net/10220/45017
• المؤسسة: Nanyang Technological University

Delaunay meshes (DM) are a special type of triangle mesh where the local Delaunay condition holds everywhere. We present an efficient algorithm to convert an arbitrary manifold triangle mesh M into a Delaunay mesh. We show that the constructed DM has O(Kn) vertices, where n is the number of vertices...