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

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

doi:10.1109/SIBGRA.2000.883918

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

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

School of Computing Sciences

Research output: Contribution to conference › Paper

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 language	English
Pages	235-242
Number of pages	8
DOIs	https://doi.org/10.1109/SIBGRA.2000.883918
Publication status	Published - Oct 2000
Event	XIII Brazilian Symposium on Computer Graphics and Image Processing - Gramado, Brazil Duration: 17 Oct 2000 → 20 Oct 2000 Conference number: 13

Conference

Conference	XIII Brazilian Symposium on Computer Graphics and Image Processing
Abbreviated title	SIBGRAPI 2000
Country/Territory	Brazil
City	Gramado
Period	17/10/00 → 20/10/00

Access to Document

10.1109/SIBGRA.2000.883918

Cite this

@conference{026bcb08560048a68c12d972c623c763,

title = "Parallelization of filling algorithms on distributed memory machines using the point containment paradigm",

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",

author = "Fabris, \{A. E.\} and Assis, \{M. M. O.\} and Forrest, \{A. R.\}",

year = "2000",

month = oct,

doi = "10.1109/SIBGRA.2000.883918",

language = "English",

pages = "235--242",

note = "XIII Brazilian Symposium on Computer Graphics and Image Processing, SIBGRAPI 2000 ; Conference date: 17-10-2000 Through 20-10-2000",

}

TY - CONF

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

AU - Fabris, A. E.

AU - Assis, M. M. O.

AU - Forrest, A. R.

N1 - Conference code: 13

PY - 2000/10

Y1 - 2000/10

N2 - 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

AB - 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

U2 - 10.1109/SIBGRA.2000.883918

DO - 10.1109/SIBGRA.2000.883918

M3 - Paper

SP - 235

EP - 242

T2 - XIII Brazilian Symposium on Computer Graphics and Image Processing

Y2 - 17 October 2000 through 20 October 2000

ER -