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...
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: | |
Online Access: | Get fulltext |
Similar Items
-
Common unfoldings of polyominoes and polycubes
by: Aloupis, Greg, et al.
Published: (2012) -
Classic Nintendo Games Are (Computationally) Hard
by: Aloupis, Greg, et al.
Published: (2015) -
Ghost Chimneys
by: Charlton, David, et al.
Published: (2011) -
Classic Nintendo games are (computationally) hard
by: Aloupis, Greg, et al.
Published: (2019) -
On Cartesian trees and range minimum queries
by: Demaine, Erik D., et al.
Published: (2011)