Access Restriction

Author Cheng, Siu-Wing ♦ Dey, Tamal K. ♦ Edelsbrunner, Herbert ♦ Facello, Michael A. ♦ Teng, Shang-Hua
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2000
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword (weighted) Dulaunay triangulations ♦ Algorithms ♦ Computational geometry ♦ Mesh generation ♦ Mesh quality ♦ Silvers ♦ Tetrahedral meshes
Abstract A silver is a tetrahedon whose four vertices lie close to a plane and whose orthogonal projection to that plane is a convex quadrilateral with no short edge. Silvers are notoriously common in 3-dimensional Delaunay triangulations even for well-spaced point sets. We show that, if the Delaunay triangulation has the ratio property introduced in Miller et al. [1995], then there is an assignment of weights so the weighted Delaunay traingulation contains no silvers. We also give an algorithm to compute such a weight assignment.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2000-09-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 47
Issue Number 5
Page Count 22
Starting Page 883
Ending Page 904

Open content in new tab

   Open content in new tab
Source: ACM Digital Library