MPI-I-2006-1-005. December 2006, 39 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
We present an extension of snap rounding
from straight-line segments (see Guibas and Marimont, 1998)
to Bézier curves of arbitrary degree,
and thus the first method for geometric rounding
of curvilinear arrangements.
Our algorithm takes a set of intersecting Bézier curves
and directly computes a geometric rounding of their true arrangement,
without the need of representing the true arrangement exactly.
The algorithm's output is a deformation of the true arrangement
that has all Bézier control points at integer points
and comes with the same geometric guarantees as in
straight-line snap rounding: during rounding, objects do not move
further than the radius of a pixel, and features of the
arrangement may collapse but do not invert.
References to related material:
|To download this research report, please select the type of document that fits best your needs.||Attachement Size(s):|
|Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView|