Triangulations with Locally Optimal Steiner Points
View/
Date
2007Pay-Per-View via TIB Hannover:
Try if this item/paper is available.
Metadata
Show full item recordAbstract
We present two new Delaunay refinement algorithms, the second an extension of the first. For a given input domain (a set of points in the plane or a planar straight line graph), and a threshold angle a, the Delaunay refinement algorithms compute triangulations that have all angles at least a. Our algorithms have the same theoretical guarantees as the previous Delaunay refinement algorithms. The original Delaunay refinement algorithm of Ruppert is proven to terminate with size-optimal quality triangulations for a
BibTeX
@inproceedings {10.2312:SGP:SGP07:143-152,
booktitle = {Geometry Processing},
editor = {Alexander Belyaev and Michael Garland},
title = {{Triangulations with Locally Optimal Steiner Points}},
author = {Erten, Hale and Uengoer, Alper},
year = {2007},
publisher = {The Eurographics Association},
ISSN = {1727-8384},
ISBN = {978-3-905673-46-3},
DOI = {10.2312/SGP/SGP07/143-152}
}
booktitle = {Geometry Processing},
editor = {Alexander Belyaev and Michael Garland},
title = {{Triangulations with Locally Optimal Steiner Points}},
author = {Erten, Hale and Uengoer, Alper},
year = {2007},
publisher = {The Eurographics Association},
ISSN = {1727-8384},
ISBN = {978-3-905673-46-3},
DOI = {10.2312/SGP/SGP07/143-152}
}