Decompositions preserving minimum feature size

Vida Dujmovic

The minimum feature size of a planar straight-line graph is the minimum distance between a vertex and a nonincident edge. When a polygon is partitioned into a mesh, the degradation is the ratio of original to final minimum feature size. We show that some planar straight-line graphs cannot be triangulated with constant degradation, even with an unbounded number of Steiner points and triangles.