Fast, precise flattening of cubic Bézier path and offset curves

  • Authors:
  • Thomas F. Hain;Athar L. Ahmad;Sri Venkat R. Racherla;David D. Langan

  • Affiliations:
  • School of CIS, University of South Alabama, Mobile, AL 36688, USA;Konica Minolta Systems Laboratory, 5661 Airport Boulevard, Boulder, CO 80301, USA;SL Technologies, 711 MLK Jr. Boulevard, Biloxi, MS 39530, USA;School of CIS, University of South Alabama, Mobile, AL 36688, USA

  • Venue:
  • Computers and Graphics
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present two related algorithms for flattening (generating polyline approximations for) curves associated with planar cubic Bezier segments. One flattens the path curve, and the other flattens the left and right offset curves. The algorithm for flattening path curves yields an average of 67% of the vertices generated by recursive subdivision, while maintaining flatness to within 4% of the specified value, and runs 37% faster. The algorithm for flattening offset curves generates 70% of the vertices as the methods based on recursive subdivision, such that 94% of all subsegments fall within 20% of the flatness criterion. This latter code runs as fast as recursive subdivision.