Dynamic view-dependent partitioning of structured grids with complex boundaries for object-order rendering techniques

Object-order rendering techniques present an attractive approach to run-time visualization of structured grid data, particularly when combined with a parallel rendering paradigm such as image composition. The ability of this combination to exploit hardware exceeds that of parallel image order methods. However, certain configurations of grid boundaries prevent composition from being performed correctly. In particular when the boundary between two partitions contains concave sections, the partitions may no longer be depth sorted correctly, a requirement for some visualization techniques such as direct volume rendering. This occurs because the concave boundary prevents even the simple ordering of two adjacent partitions. If the data may be repartitioned such that it can be depth sorted correctly then an image composition approach is a viable option. To facilitate such an operation, we present an algorithm to analyze the geometric structure of a grid boundary and extract knowledge about how the boundary impacts depth sorting and therefore image composition. We then show through examples how this knowledge may be applied to create a set of partitions that may be properly depth sorted.

[1]  Steven Molnar,et al.  Image-Composition Architectures for Real-Time Image Generation , 1991 .

[2]  Mark de Berg Trends and Developments in Computational Geometry , 1997, Comput. Graph. Forum.

[3]  Charles D. Hansen,et al.  A data distributed, parallel algorithm for ray-traced volume rendering , 1993 .

[4]  Lee Westover,et al.  Footprint evaluation for volume rendering , 1990, SIGGRAPH.

[5]  Kwan-Liu Ma,et al.  Parallel volume ray-casting for unstructured-grid data on distributed-memory architectures , 1995, PRS.

[6]  A. James Stewart,et al.  Fast Horizon Computation at All Points of a Terrain With Visibility and Shading Applications , 1998, IEEE Trans. Vis. Comput. Graph..

[7]  Mark H. Overmars,et al.  Spheres, molecules, and hidden surface removal , 1998, Comput. Geom..

[8]  John G. Eyles,et al.  PixelFlow: high-speed rendering using image composition , 1992, SIGGRAPH.

[9]  Herbert Edelsbrunner,et al.  An O(n log² h) Time Algorithm for the Three-Dimensional Convex Hull Problem , 1991, SIAM J. Comput..

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

[11]  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).

[12]  Kurt Mehlhorn,et al.  Four Results on Randomized Incremental Constructions , 1992, Comput. Geom..

[13]  Joe F. Thompson,et al.  Numerical grid generation: Foundations and applications , 1985 .

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

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