Anais do X SIBGRAPI (1997) #ART17
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 ]