English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Snap Rounding of Bézier Curves

MPS-Authors
/persons/resource/persons44369

Eigenwillig,  Arno
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44766

Kettner,  Lutz
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45758

Wolpert,  Nicola
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Eigenwillig, A., Kettner, L., & Wolpert, N. (2007). Snap Rounding of Bézier Curves. In Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07) (pp. 158-167). New York, NY: ACM.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-20B6-5
Abstract
We present an extension of snap roundingfrom straight-line segments (see Guibas and Marimont, 1998)to Bézier curves of arbitrary degree, and thus the first method for geometric roundingof curvilinear arrangements.Our algorithm takes a set of intersecting Bézier curvesand 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 arrangementthat has all Bézier control points at integer pointsand comes with the same geometric guarantees as instraight-line snap rounding: during rounding, objects do not movefurther than the radius of a pixel, and features of thearrangement may collapse but do not invert.