Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Journal of Supercomputing, 15, 5193 (2000) 2000 Kluwer Academic Publishers. Manufactured in The Netherlands.
 

Summary: Journal of Supercomputing, 15, 51­93 (2000)
© 2000 Kluwer Academic Publishers. Manufactured in The Netherlands.
Image-Space Decomposition Algorithms for
Sort-First Parallel Volume Rendering of
Unstructured Grids*
H ¨USEYIN KUTLUCA kutluca@cs.bilkent.edu.tr
Computer Engineering Department, Bilkent University, TR-06533 Ankara, Turkey
TAHSIN M. KUR¸C kurc@cs.umd.edu
Computer Science Department, University of Maryland, College Park, MD 20742
CEVDET AYKANAT aykanat@cs.bilkent.edu.tr
Computer Engineering Department, Bilkent University, TR-06533 Ankara, Turkey
(Received February 26, 1998; final version accepted November 17, 1998)
Abstract. Twelve adaptive image-space decomposition algorithms are presented for sort-first parallel
direct volume rendering (DVR) of unstructured grids on distributed-memory architectures. The algo-
rithms are presented under a novel taxonomy based on the dimension of the screen decomposition, the
dimension of the workload arrays used in the decomposition, and the scheme used for workload-array
creation and querying the workload of a region. For the 2D decomposition schemes using 2D workload
arrays, a novel scheme is proposed to query the exact number of screen-space bounding boxes of the
primitives in a screen region in constant time. A probe-based chains-on-chains partitioning algorithm
is exploited for load balancing in optimal 1D decomposition and iterative 2D rectilinear decomposition

  

Source: Aykanat, Cevdet - Department of Computer Engineering, Bilkent University

 

Collections: Computer Technologies and Information Sciences