BDBComp
Parceria:
SBC
Parallelization of filling algorithms on distributed memory machines using the point containment paradigm

Antonio Elias FabrisMarcos Machado Ottani AssisA. Robin Forrest

The point containment predicate which specifies if a point is part of a mathematically well-defined object is a crucial problem in computer graphics. Point-driven algorithms can be executed for several points in parallel as there is no interdependence among the computations for different points. The paper presents a variety of parallel configurations to counteract the main disadvantage of the point-driven algorithm: its slowness on a standard uniprocessor software implementation for interactive editing and manipulation.

http://sibgrapi.sid.inpe.br/rep-/sid.inpe.br/banon/2002/11.06.12.18

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: bdbcomp@lbd.dcc.ufmg.br
     Mantida por:
LBD