Stroking discrete polynomial Bezier curves via point containment paradigm
Proceedings SIBGRAPI'98. International Symposium on Computer …, 1998•ieeexplore.ieee.org
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.
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.
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.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果