loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Computer Graphics and Image Processing, XVII Brazilian Symposium on (SIBGRAPI'04)
Fast, Precise Flattening of Cubic B?zier Segment Offset Curves
Curitiba, PR, Brazil
October 17-October 20
ISBN: 0-7695-2227-0
ASCII Text
x 
 
Thomas F. Hain, Sri Venkat R. Racherla, David D. Langan, "Fast, Precise Flattening of Cubic B?zier Segment Offset Curves," Computer Graphics and Image Processing, Brazilian Symposium on, pp. 244-249, Computer Graphics and Image Processing, XVII Brazilian Symposium on (SIBGRAPI'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/SIBGRA.2004.1352967,
author = {Thomas F. Hain and Sri Venkat R. Racherla and David D. Langan},
title = {Fast, Precise Flattening of Cubic B?zier Segment Offset Curves},
journal ={Computer Graphics and Image Processing, Brazilian Symposium on},
volume = {0},
year = {2004},
isbn = {0-7695-2227-0},
pages = {244-249},
doi = {http://doi.ieeecomputersociety.org/10.1109/SIBGRA.2004.1352967},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer Graphics and Image Processing, Brazilian Symposium on
TI - Fast, Precise Flattening of Cubic B?zier Segment Offset Curves
SN - 0-7695-2227-0
SP244
EP249
A1 - Thomas F. Hain,
A1 - Sri Venkat R. Racherla,
A1 - David D. Langan,
PY - 2004
KW - null
VL - 0
JA - Computer Graphics and Image Processing, Brazilian Symposium on
ER -
 
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
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.
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
Usage of this product signifies your acceptance of the Terms of Use.