By Topic

Hierarchical graphics databases in sort-first

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
$31 $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

1 Author(s)
Mueller, C. ; Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA

Sort-first architectures for parallel rendering use the natural frame-to-frame coherence of primitives on the screen to increase performance by grouping primitives that are close together on the screen onto the same processor. This technique reduces processor-to-processor communications overhead. As primitives move on the screen, they may also be moved to other processors. This migration poses many problems for the editing and traversal of hierarchical graphics databases (HGDs) such as PHIGS. The author describes the major problems associated with implementing an HGD on a sort-first system. He discusses the basics of HGDs and how they extend to parallel graphics systems. He shows why bookkeeping for HGDs is a more complex issue for sort-first than for other parallel architectures. He then examines two possible solution branches for this issue and delve into the design choices and implementation issues that arise with either method. The methods differ in the amount of bookkeeping that they do versus the amount of primitive cull-testing that must be performed

Published in:

Parallel Rendering, 1997. PRS 97. Proceedings. IEEE Symposium on

Date of Conference:

20-21 Oct 1997