|
Published Articles >> Table of Contents >> Abstract
Computer Graphics and Image Processing, XVII Brazilian Symposium on (SIBGRAPI'04)
pp. 244-249
Fast, Precise Flattening of Cubic Bézier Segment Offset Curves
Thomas F. Hain, University of South Alabama, Mobile, AL
Sri Venkat R. Racherla, SL Technologies, Biloxi, MS
David D. Langan, University of South Alabama, Mobile, AL
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SIBGRA.2004.1352967
Send link to a friend
| Abstract |
|
A fast algorithm for generating a polyline approximation (flattening) for the offset curves of a cubic Bézier curve segment is described. It is shown to be more efficient than the standard recursive subdivision method by generating only 70% as many segments, but, just as importantly, 94% of all segments fall within 20% of the flatness criterion. The code runs as fast as recursive subdivision.
|
 Additional Information
|
Citation:
Thomas F. Hain, Sri Venkat R. Racherla, David D. Langan,
"Fast, Precise Flattening of Cubic Bézier Segment Offset Curves,"
sibgrapi,
pp. 244-249,
Computer Graphics and Image Processing, XVII Brazilian Symposium on (SIBGRAPI'04),
2004
|
|
