DocumentCode
1915677
Title
Stroking discrete polynomial Bezier curves via point containment paradigm
Author
Fabrias, A.E. ; Silva, Luciano ; Forrest, A. Robin
Author_Institution
Inst. de Matematica e Estatistica, Sao Paulo Univ., Brazil
fYear
1998
fDate
20-23 Oct 1998
Firstpage
94
Lastpage
101
Abstract
The point containment predicate which specifies if a point is part of a mathematically defined shape or not is a crucial problem in computer graphics. This paper presents a stroking technique that counteracts the main disadvantage of point containment algorithms: their quadratic time complexity with increasing resolution. It is also presented an efficient algorithm to perform simultaneously the filling and stroking operations
Keywords
computational complexity; computational geometry; computer graphics; computer graphics; discrete polynomial Bezier curves stroking; mathematically defined shape; point containment paradigm; quadratic time complexity; Boolean functions; Data structures; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Graphics, Image Processing, and Vision, 1998. Proceedings. SIBGRAPI '98. International Symposium on
Conference_Location
Rio de Janeiro
Print_ISBN
0-8186-9215-4
Type
conf
DOI
10.1109/SIBGRA.1998.722738
Filename
722738
Link To Document