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

Full description

Saved in:
Bibliographic Details
Main Authors: Liu, Yong-Jin, Xu, Chun-Xu, Fan, Dian, He, Ying
Other Authors: School of Computer Science and Engineering
Format: Article
Language:English
Published: 2018
Subjects:
Online Access:https://hdl.handle.net/10356/80803
http://hdl.handle.net/10220/45017
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English