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

Fabris, A. E., Assis, M. M. O. and Forrest, A. R. (2000) Parallelization of filling algorithms on distributed memory machines using the point containment paradigm. In: Proceedings XIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2000), 2000-10-17 - 2000-10-20.

Full text not available from this repository. (Request a copy)

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

Item Type: Conference or Workshop Item (Paper)
Faculty \ School: Faculty of Science > School of Computing Sciences
Related URLs:
Depositing User: Vishal Gautam
Date Deposited: 26 Aug 2011 13:34
Last Modified: 22 Apr 2020 09:23
URI: https://ueaeprints.uea.ac.uk/id/eprint/21548
DOI: 10.1109/SIBGRA.2000.883918

Actions (login required)

View Item View Item