Abstract
Multi-resolution methods are widely used in scientific visualization, image processing, and computer graphics. While many applications only require an one-time construction of these data-structures which can be done in a pre-process, this pre-process can take a significant amount of time. Considering large datasets, this time consumption can range from several minutes up to several hours, especially if this preprocess is frequently needed. Furthermore, numerous new applications, such as visibility queries, arise which often need a dynamic reconstruction of a scene database.
In this paper, we address several problems of the construction or reconstruction of recursive tree hierarchies in parallel. In particular, we focus on parallel dynamic memory allocation and the associated synchronization overhead.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Bartz, R. Grosso, T. Ertl, and W. Straßer. Parallel construction and isosurface extraction of recursive tree structures. In Proc. of WSCG’98, volume III, 1998.
D. Butenhof. Programming with POSIX Threads. Addison-Wesley, Reading, 1997.
H. Fuchs, Z. Kedem, and B. Naylor. On visible surface generation by a priori tree structures. In Proc. of ACM SIGGRAPH, pages 124–133, 1980.
N. Greene, M. Kass, and G. Miller. Hierarchical Z-buffer visibility. In Proc. of ACM SIGGRAPH, pages 231–238, 1993.
R. Grosso, T. Ertl, and R. Klier. A load-balancing scheme for parallelizing hierarchical splatting on a MPP system with non-uniform memory access architecture. In Proc. of High Performance Computing for Computer Graphics and Visualization, pages 125–134, 1995.
P. Hanrahan, D. Salzman, and L. Aupperle. A rapid hierarchical radiosity algorithm. In Proc. of ACM SIGGRAPH’93, pages 197–206, 1993.
Silicon Graphics Inc. Power Challenge. Technical report, Silicon Graphics Inc., Mountain View, 1994.
Silicon Graphics Inc. Onyx2 Reality and Onyx2 InfiniteReality. Technical report, Silicon Graphics Inc., Mountain View, 1997.
J. Laudon and D. Lenoski. System overview of the SGI Origin 200/2000 product line. Technical report, Silicon Graphics Inc., Mountain View, 1997.
D. Laur and P. Hanrahan. Hierarchical splatting: A progressive refinement algorithm for volume rendering. In Proc. of ACM SIGGRAPH’91, pages 285–288, 1991.
M. Levoy. Efficient ray tracing of volume data. ACM Transactions on Graphics, 9(3):245–261, 1990.
W. Lorensen and H. Cline. Marching Cubes: A high resolution 3D surface construction algorithm. In Proc. of ACM SIGGRAPH, pages 163–169, 1987.
H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, 1994.
R. Shekkar, W. Fayyad, R. Yagel, and J. Frederick. Octree-based decimation of marching cubes surface. In Proc. of IEEE Visualization, pages 287–294, 1996.
O. Sudarsky and C. Gotsman. Output-sensitive visibility algorithms for dynamic scenes with applications to virtual reality. In Proc. of Eurographics’96, pages 249–258, 1996.
J. Wilhelms and A. van Geldern. Octrees for faster isosurface generation. ACM Transaction on Graphics, 11(3):201–227, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bartz, D., Straßer, W. (1999). Asynchronous Parallel Construction of Recursive Tree Hierarchies. In: Zinterhof, P., Vajteršic, M., Uhl, A. (eds) Parallel Computation. ACPC 1999. Lecture Notes in Computer Science, vol 1557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49164-3_41
Download citation
DOI: https://doi.org/10.1007/3-540-49164-3_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65641-8
Online ISBN: 978-3-540-49164-4
eBook Packages: Springer Book Archive