Visibility-ordering meshed polyhedra

Williams, Peter

doi:10.1145/130826.130899

Cited by 145 publications

(74 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the sorting step necessary to composite individual cells in visibility order is very costly. This has resulted in several approaches that improve sorting performance by utilizing cell-to-cell connectivity information [37,38,47]. Objectorder methods such as HAVS [11] instead utilize a hybrid CPU/GPU sorting scheme, or avoid sorting by using special order-independent optical models [43,48], and thus do not require storing cell connectivity.…”

Section: Related Workmentioning

confidence: 99%

Interactive Volume Visualization of General Polyhedral Grids

Muigg

Hadwiger

Doleisch

et al. 2011

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

Fig. 1. Interactive ray-casting of the temperature distribution in an exhaust manifold that was simulated using a state-of-the-art CFD solver on a complex grid composed of general polyhedral cells. Red color indicates warm, green cool regions. The complex structure of the underlying mesh is illustrated through cell faces. The cells in this mesh are not only tetrahedra or other predefined cell types, but also are very general, often non-convex, polyhedra with non-planar faces, which our approach can nevertheless visualize directly.Abstract-This paper presents a novel framework for visualizing volumetric data specified on complex polyhedral grids, without the need to perform any kind of a priori tetrahedralization. These grids are composed of polyhedra that often are non-convex and have an arbitrary number of faces, where the faces can be non-planar with an arbitrary number of vertices. The importance of such grids in state-of-the-art simulation packages is increasing rapidly. We propose a very compact, face-based data structure for representing such meshes for visualization, called two-sided face sequence lists (TSFSL), as well as an algorithm for direct GPU-based ray-casting using this representation. The TSFSL data structure is able to represent the entire mesh topology in a 1D TSFSL data array of face records, which facilitates the use of efficient 1D texture accesses for visualization. In order to scale to large data sizes, we employ a mesh decomposition into bricks that can be handled independently, where each brick is then composed of its own TSFSL array. This bricking enables memory savings and performance improvements for large meshes. We illustrate the feasibility of our approach with real-world application results, by visualizing highly complex polyhedral data from commercial state-of-the-art simulation packages.

show abstract

Section: Related Workmentioning

confidence: 99%

Interactive Volume Visualization of General Polyhedral Grids

Muigg

Hadwiger

Doleisch

et al. 2011

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

show abstract

“…The traditional directed graph visibility sort algorithm of Williams [7] has a node for each cell, and a directed edge for each fa ber of incoming directed ed nd removed from fr a volume made up of 32 curvilinear grids, with t of 1 ,960 hexahedra. Among these hexahedra, 50,352 te, with two or more vertices coinciding, and 924 m ure 7, 16 as in fi 5.27 seconds, of which 0.13 were us algorithm produced 43 layers, and drew 274 hexahedra an The projections discussed here were discovered one by one by ses that arose in projecting the data set in figure 13 faces.…”

Section: Floating Point Compositingmentioning

confidence: 99%

“…Each directed edge leaving the cell is followed to decrement the incoming edge count of the cell it points to, and if that cell's count becomes zero, it is added to the FIFO queue. (See [7] for details. )…”

Section: Floating Point Compositingmentioning

confidence: 99%

Hexahedron Projection for Curvilinear Grids

Max

2007

Journal of Graphics Tools

View full text Add to dashboard Cite

show abstract

“…It also does not require the adjacency information, which may not be available in certain situations (for example, finite element simulations with sliding interfaces), and can deal with non convex volumes with holes. Williams [Williams91] also generalizes the directed graph method to nonconvex data volumes, but his method is not guaranteed to be correct.…”

Section: Sortingmentioning

confidence: 99%