Title :
An efficient filling algorithm for non-simple closed curves using the point containment paradigm
Author :
Fabris, Antonio Elias ; Silva, Luciano ; Forrest, A. Robin
Author_Institution :
Inst. de Matematica e Estatistica, Sao Paulo Univ., Brazil
Abstract :
The point containment predicate which specifies if a point is part of a mathematically defined shape or not is one of the most basic notions in raster graphics. The paper presents a technique to counteract the main disadvantage of point containment algorithms: their quadratic time complexity with increasing resolution. The implemented algorithm handles complex geometries such as self-intersecting closed curves
Keywords :
computational geometry; curve fitting; complex geometries; filling algorithm; mathematically defined shape; non simple closed curves; point containment algorithms; point containment paradigm; point containment predicate; quadratic time complexity; raster graphics; self intersecting closed curves; Arithmetic; Computational geometry; Filling; Graphics; Hardware; Information systems; Page description languages; Robustness; Shape; Silicon;
Conference_Titel :
Computer Graphics and Image Processing, 1997. Proceedings., X Brazilian Symposium on
Conference_Location :
Campos do Jordao
Print_ISBN :
0-8186-8102-0
DOI :
10.1109/SIGRA.1997.625138
