par Aloupis, Greg 
;Demaine, Erik D. ;Demaine, Martin L.;Dujmović, Vida V.;Iacono, John
Référence Lecture notes in computer science, 7579 LNCS, page (258-273)
Publication Publié, 2012
;Demaine, Erik D. ;Demaine, Martin L.;Dujmović, Vida V.;Iacono, John Référence Lecture notes in computer science, 7579 LNCS, page (258-273)
Publication Publié, 2012
Article révisé par les pairs
| Résumé : | 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 degradation. This addresses a 14-year-old open problem by Bern, Dobkin, and Eppstein. © 2012 Springer-Verlag. |
