By Topic

DPBP: a sort-first parallel rendering algorithm for distributed rendering environments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Huabing Zhu ; Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore ; Kai Yun Chan ; Lizhe Wang ; Wentong Cai

In some visualization systems, the data and computational resources are distributed globally and users need to interact with these resources easily and efficiently. Real-time rendering for massive datasets is a computation intensive task. one solution is to distributes the rendering tasks over a set of computation units to achieve high rendering performance. This paper presents a recursive sort-first partitioning algorithm named Dynamic Pixel Bucket Partition (DPBP) for parallel rendering alone with their implementation and performance in a distributed rendering environment. This algorithm distributes rendering work loads evenly to individual rendering units to achieve fast, high quality rendering of massive data. Test results in a multi-cluster environment demonstrate the practicality of this rendering algorithm.

Published in:

Cyberworlds, 2003. Proceedings. 2003 International Conference on

Date of Conference:

3-5 Dec. 2003