• DocumentCode
    1839632
  • Title

    Fast, precise flattening of cubic Bezier segment offset curves

  • Author

    Hain, Thomas F. ; Racherla, Sri Venkat R ; Langan, David D.

  • Author_Institution
    Sch. of CIS, Univ. of South Alabama, Mobile, AL, USA
  • fYear
    2004
  • fDate
    17-20 Oct. 2004
  • Firstpage
    244
  • Lastpage
    249
  • Abstract
    A fast algorithm for generating a polyline approximation (flattening) for the offset curves of a cubic Bezier 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.
  • Keywords
    CAD/CAM; computational geometry; computer graphics; CAD/CAM; cubic Bezier curve segment; flatness criterion; offset curves; polyline approximation; precise flattening; recursive subdivision; Approximation methods; Computer graphics; Image processing; Linear approximation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Graphics and Image Processing, 2004. Proceedings. 17th Brazilian Symposium on
  • ISSN
    1530-1834
  • Print_ISBN
    0-7695-2227-0
  • Type

    conf

  • DOI
    10.1109/SIBGRA.2004.1352967
  • Filename
    1352967
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1839632