Efficient rendering of multiblock curvilinear grids with complex boundaries

Domain decomposition is a popular technique for solving large computational problems that require data to be divided into smaller sub‐domains. The exact manner of decomposition depends on the computational needs of the algorithm and often introduces irregular boundaries. Each subdomain forms a block of a larger grid and can be solved or rendered separately by different processing nodes. Rendering of each sub‐domain can result in images which are then composited in a back‐to‐front or front‐to‐back manner. This scenario is useful when visualization is used concurrently with the simulation. However, the irregularity of boundaries may prohibit the correct image composition due to a visibility anomaly between the sub‐domains. In this paper, we present an algorithm based on object‐space partitioning to resolve this problem. To accelerate the partitioning process, two techniques are introduced. First, an image‐space partition representation is employed for fast assignment of data points to correct partitions. Secondly, a k‐d tree is used to subdivide the view‐space adaptively according to the complexity of the surface. This view‐space partition provides a trade‐off between performance and accuracy of the rendered image. Large gains in performance can be achieved with only small losses of accuracy. Two examples of curvilinear grids of different complexity are used to demonstrate the effectiveness of this scheme. Copyright © 2005 John Wiley & Sons, Ltd.

[1]  Kwan-Liu Ma,et al.  Parallel volume rendering using binary-swap compositing , 1994, IEEE Computer Graphics and Applications.

[2]  Anthony Skjellum,et al.  Using MPI - portable parallel programming with the message-parsing interface , 1994 .

[3]  Philippe Lacroute,et al.  Analysis of a Parallel Volume Rendering System Based on the Shear-Warp Factorization , 1996, IEEE Trans. Vis. Comput. Graph..

[4]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[5]  Kwan-Liu Ma,et al.  Parallel Volume Rendering Using Binary-Swap Image Composition , 2008, International Conference on Computer Graphics and Interactive Techniques.

[6]  Peter L. Williams.  Visibility-ordering meshed polyhedra , 1992, TOGS.

[7]  Xiaoyang Mao,et al.  Splatting of Non Rectilinear Volumes Through Stochastic Resampling , 1996, IEEE Trans. Vis. Comput. Graph..

[8]  Arun K. Somani,et al.  Time and Space Optimal Data Parallel Volume Rendering Using Permutation Warping , 1997, J. Parallel Distributed Comput..

[9]  Joseph S. B. Mitchell,et al.  Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids , 1998, Comput. Graph. Forum.

[10]  Raghu Machiraju,et al.  Data-parallel, volume-rendering algorithms , 1995 .

[11]  Feng Xie,et al.  Adaptive hierarchical visibility in a tiled architecture , 1999, Workshop on Graphics Hardware.

[12]  Leonard McMillan,et al.  Plenoptic Modeling: An Image-Based Rendering System , 2023 .

[13]  R. Machiraju,et al.  Dynamic view-dependent partitioning of structured grids with complex boundaries for object-order rendering techniques , 1999, Proceedings 1999 IEEE Parallel Visualization and Graphics Symposium (Cat. No.99EX381).

[14]  Seth Teller,et al.  Visibility Computations in Densely Occluded Polyhedral Environments , 1992 .

[15]  Joseph S. B. Mitchell,et al.  An exact interactive time visibility ordering algorithm for polyhedral cell complexes , 1998, IEEE Symposium on Volume Visualization (Cat. No.989EX300).

[16]  U. Neumann.  Parallel volume-rendering algorithm performance on mesh-connected multicomputers , 1993, Proceedings of 1993 IEEE Parallel Rendering Symposium.

[17]  John M. Snyder,et al.  Visibility sorting and compositing without splitting for image layer decompositions , 1998, SIGGRAPH.

[18]  Alan Watt,et al.  Advanced animation and rendering techniques - theory and practice , 1992 .

[19]  John M. Airey,et al.  Increasing update rates in the building walkthrough system with automatic model-space subdivision and potentially visible set calculations , 1990 .

[20]  Michael Werman,et al.  On View Likelihood and Stability , 1997, IEEE Trans. Pattern Anal. Mach. Intell..