HKUST Institutional Repository >
Computer Science and Engineering >
CSE TCSC Research Reports >
Please use this identifier to cite or link to this item:
|Title: ||Quality meshing with weighted Delaunay refinement|
|Authors: ||Cheng, Siu-Wing|
Dey, Tamal K.
|Keywords: ||Quality meshing|
Weight pumping method
|Issue Date: ||2003 |
|Series/Report no.: ||HKUST Theoretical Computer Science Center Research Report ; HKUST-TCSC-2003-05|
|Abstract: ||Delaunay meshes with bounded circumradius to shortest edge length ratio have been proposed in the past for quality meshing. The only poor quality tetrahedra called slivers that can occur in such a mesh can be eliminated by the sliver exudation method. This method has been shown to work for periodic point sets, but not with boundaries. Recently a randomized point-placement strategy has been proposed to remove slivers while conforming to a given boundary. In this paper we present a deterministic algorithm for generating a weighted Delaunay mesh which respects the input boundary and has no poor quality tetrahedron including slivers. As in previous work, we assume that no input angle is acute. This success is achieved by combining the weight pumping method for sliver exudation and the Delaunay reﬁnement method for boundary conformation.|
|Appears in Collections:||CSE TCSC Research Reports|
Files in This Item:
All items in this Repository are protected by copyright, with all rights reserved.