Anais do X SIBGRAPI (1997) #ART17

An Efficient Filling Algorithm for Non-simple Closed Curves using the Point Containment Paradigm

Antonio Elias Fabris, IME, Universidade de São Paulo
Luciano Silva, IME, Universidade de São Paulo
A. Robin Forrest, SYS, University of East Anglia

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. This 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.

[ full version | contact authors ]