Back to results
University of Illinois at Urbana-Champaign
Tetrahedral Mesh Improvement, Algorithms and Experiments
Abstract
dc:descriptionThe persistent appearance of slivers in large three-dimensional Delaunay meshes has been reported as early as 1985. They persist even after treatment with the Delaunay refinement algorithm. Cheng et al. proposed to remove slivers by assigning real weights to the points and change the Delaunay to the weighted Delaunay mesh. This is referred to as the sliver exudation algorithm. Their theoretical bound on the achieved minimum mesh quality is a constant that is positive but exceedingly small. We perform computational experiments to testify the practical effectiveness of sliver exudation.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Computer Science
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2015
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Guoy, Damrong
- Contributors dc:contributor
-
- Edelsbrunner, Herbert
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (MiAaPQ)AAI3023067
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/81580