dc.contributor.author | Aloupis, Greg | |
dc.contributor.author | Demaine, Erik D. | |
dc.contributor.author | Demaine, Martin L. | |
dc.contributor.author | Dujmovic, Vida | |
dc.contributor.author | Iacono, John | |
dc.date.accessioned | 2014-04-17T16:28:37Z | |
dc.date.available | 2014-04-17T16:28:37Z | |
dc.date.issued | 2012 | |
dc.identifier.isbn | 978-3-642-34190-8 | |
dc.identifier.isbn | 978-3-642-34191-5 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.issn | 1611-3349 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/86202 | |
dc.description.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. | en_US |
dc.language.iso | en_US | |
dc.publisher | Springer-Verlag | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1007/978-3-642-34191-5_25 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
dc.source | MIT web domain | en_US |
dc.title | Meshes Preserving Minimum Feature Size | en_US |
dc.type | Article | en_US |
dc.identifier.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. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.mitauthor | Demaine, Erik D. | en_US |
dc.contributor.mitauthor | Demaine, Martin L. | en_US |
dc.relation.journal | Computational Geometry | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
dspace.orderedauthors | Aloupis, Greg; Demaine, Erik D.; Demaine, Martin L.; Dujmovic, Vida; Iacono, John | en_US |
dc.identifier.orcid | https://orcid.org/0000-0003-3803-5703 | |
mit.license | OPEN_ACCESS_POLICY | en_US |
mit.metadata.status | Complete | |