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

A. E. Fabris, M. M. O. Assis, A. R. Forrest

Research output: Contribution to conferencePaper

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
Original languageEnglish
Pages235-242
Number of pages8
DOIs
Publication statusPublished - Oct 2000
EventProceedings XIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2000) - Gramado, Brazil
Duration: 17 Oct 200020 Oct 2000

Conference

ConferenceProceedings XIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2000)
CountryBrazil
CityGramado
Period17/10/0020/10/00

Cite this