Affordable Access

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

Publication Date
  • Computer Science
  • Logic
  • Mathematics


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

There are no comments yet on this publication. Be the first to share your thoughts.