Parallelization of filling algorithms on distributed memory machines using the point containment paradigm

Author

Fabris, Antonio Elias ; Assis, Ottani ; Forrest, A.R.

Author_Institution

Inst. de Matematica e Estatistica, Sao Paulo Univ., Brazil

fYear

2000

fDate

2000

Firstpage

235

Lastpage

242

Abstract

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

Keywords

computer graphics; distributed memory systems; interactive systems; parallel algorithms; computer graphics; distributed memory machines; filling algorithm parallelization; interactive editing; mathematically well-defined object; parallel configurations; point containment paradigm; point containment predicate; point-driven algorithm; point-driven algorithms; standard uniprocessor software implementation; Application software; Computer graphics; Concurrent computing; Filling; Information systems; Robustness; Silicon; Software algorithms; Software standards; System testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Graphics and Image Processing, 2000. Proceedings XIII Brazilian Symposium on

Conference_Location

Gramado

ISSN

1530-1834

Print_ISBN

0-7695-0878-2

Type

conf

DOI

10.1109/SIBGRA.2000.883918

Filename

883918