Numerical grid generation: foundations and applications
Numerical grid generation: foundations and applications
Introduction to algorithms
Footprint evaluation for volume rendering
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
An O(n log2h) time algorithm for the three-dimensional convex hull problem
SIAM Journal on Computing
Visibility-ordering meshed polyhedra
ACM Transactions on Graphics (TOG)
PixelFlow: high-speed rendering using image composition
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Image-composition architectures for real-time image generation
Image-composition architectures for real-time image generation
A data distributed, parallel algorithm for ray-traced volume rendering
PRS '93 Proceedings of the 1993 symposium on Parallel rendering
Visibility computations in densely occluded polyhedral environments
Visibility computations in densely occluded polyhedral environments
Four results on randomized incremental constructions
Computational Geometry: Theory and Applications
Spheres, molecules, and hidden surface removal
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Parallel volume ray-casting for unstructured-grid data on distributed-memory architectures
PRS '95 Proceedings of the IEEE symposium on Parallel rendering
On View Likelihood and Stability
IEEE Transactions on Pattern Analysis and Machine Intelligence
An exact interactive time visibility ordering algorithm for polyhedral cell complexes
VVS '98 Proceedings of the 1998 IEEE symposium on Volume visualization
Fast Horizon Computation at All Points of a Terrain With Visibility and Shading Applications
IEEE Transactions on Visualization and Computer Graphics
Volume Interval Segmentation and Rendering
VV '04 Proceedings of the 2004 IEEE Symposium on Volume Visualization and Graphics
Hi-index | 0.00 |
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.