Efficient construction and simplification of Delaunay meshes

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...

全面介紹

Saved in:
書目詳細資料
Main Authors: Liu, Yong-Jin, Xu, Chun-Xu, Fan, Dian, He, Ying
其他作者: School of Computer Science and Engineering
格式: Article
語言:English
出版: 2018
主題:
在線閱讀:https://hdl.handle.net/10356/80803
http://hdl.handle.net/10220/45017
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Nanyang Technological University
語言: English