Meshes Preserving Minimum Feature Size

Meshes Preserving Minimum Feature Size

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) alg...

Full description

Bibliographic Details
Main Authors: Aloupis, Greg (Author), Demaine, Erik D. (Contributor), Demaine, Martin L. (Contributor), Dujmovic, Vida (Author), Iacono, John (Author)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Springer-Verlag, 2014-04-17T16:28:37Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items