Meshes Preserving Minimum Feature Size
Name
Demaine_Meshes preserving.pdf
Size
513.97 KB
Format
Adobe PDF
Checksum (MD5)
d39080e980c025ac26ec23889a356a99
Author(s)
Aloupis, Greg
Demaine, Erik D.
Demaine, Martin L.
Dujmovic, Vida
Iacono, John
Date Issued
2012
Journal
Computational Geometry
Publisher
Springer-Verlag
Citation
Aloupis, Greg, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, and John Iacono. “Meshes Preserving Minimum Feature Size.” Lecture Notes in Computer Science (2012): 258–273.
Version
Author's final manuscript
Abstract
The minimum feature size of a planar straight-line graph is the minimum distance between a vertex and a nonincident edge. When such a graph is partitioned into a mesh, the degradation is the ratio of original to final minimum feature size. For an n-vertex input, we give a triangulation (meshing) algorithm that limits degradation to only a constant factor, as long as Steiner points are allowed on the sides of triangles. If such Steiner points are not allowed, our algorithm realizes \ensuremathO(lgn) degradation. This addresses a 14-year-old open problem by Bern, Dobkin, and Eppstein.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-34191-5_25
