An efficient filling algorithm for non-simple closed curves using the point containment paradigm

Antonio Elias FabrisLuciano SilvaA. Robin Forrest

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 implementented algorithm handles complex geometries such as self-intersecting closed curves.

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato:
     Mantida por: