193 research outputs found

    TetSplat: Real-time Rendering and Volume Clipping of Large Unstructured Tetrahedral Meshes

    Get PDF
    We present a novel approach to interactive visualization and exploration of large unstructured tetrahedral meshes. These massive 3D meshes are used in mission-critical CFD and structural mechanics simulations, and typically sample multiple field values on several millions of unstructured grid points. Our method relies on the pre-processing of the tetrahedral mesh to partition it into non-convex boundaries and internal fragments that are subsequently encoded into compressed multi-resolution data representations. These compact hierarchical data structures are then adaptively rendered and probed in real-time on a commodity PC. Our point-based rendering algorithm, which is inspired by QSplat, employs a simple but highly efficient splatting technique that guarantees interactive frame-rates regardless of the size of the input mesh and the available rendering hardware. It furthermore allows for real-time probing of the volumetric data-set through constructive solid geometry operations as well as interactive editing of color transfer functions for an arbitrary number of field values. Thus, the presented visualization technique allows end-users for the first time to interactively render and explore very large unstructured tetrahedral meshes on relatively inexpensive hardware

    09251 Abstracts Collection -- Scientific Visualization

    Get PDF
    From 06-14-2009 to 06-19-2009, the Dagstuhl Seminar 09251 ``Scientific Visualization \u27\u27 was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, over 50 international participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general

    Diamond-based models for scientific visualization

    Get PDF
    Hierarchical spatial decompositions are a basic modeling tool in a variety of application domains including scientific visualization, finite element analysis and shape modeling and analysis. A popular class of such approaches is based on the regular simplex bisection operator, which bisects simplices (e.g. line segments, triangles, tetrahedra) along the midpoint of a predetermined edge. Regular simplex bisection produces adaptive simplicial meshes of high geometric quality, while simplifying the extraction of crack-free, or conforming, approximations to the original dataset. Efficient multiresolution representations for such models have been achieved in 2D and 3D by clustering sets of simplices sharing the same bisection edge into structures called diamonds. In this thesis, we introduce several diamond-based approaches for scientific visualization. We first formalize the notion of diamonds in arbitrary dimensions in terms of two related simplicial decompositions of hypercubes. This enables us to enumerate the vertices, simplices, parents and children of a diamond. In particular, we identify the number of simplices involved in conforming updates to be factorial in the dimension and group these into a linear number of subclusters of simplices that are generated simultaneously. The latter form the basis for a compact pointerless representation for conforming meshes generated by regular simplex bisection and for efficiently navigating the topological connectivity of these meshes. Secondly, we introduce the supercube as a high-level primitive on such nested meshes based on the atomic units within the underlying triangulation grid. We propose the use of supercubes to associate information with coherent subsets of the full hierarchy and demonstrate the effectiveness of such a representation for modeling multiresolution terrain and volumetric datasets. Next, we introduce Isodiamond Hierarchies, a general framework for spatial access structures on a hierarchy of diamonds that exploits the implicit hierarchical and geometric relationships of the diamond model. We use an isodiamond hierarchy to encode irregular updates to a multiresolution isosurface or interval volume in terms of regular updates to diamonds. Finally, we consider nested hypercubic meshes, such as quadtrees, octrees and their higher dimensional analogues, through the lens of diamond hierarchies. This allows us to determine the relationships involved in generating balanced hypercubic meshes and to propose a compact pointerless representation of such meshes. We also provide a local diamond-based triangulation algorithm to generate high-quality conforming simplicial meshes

    Dynamic Multivariate Simplex Splines For Volume Representation And Modeling

    Get PDF
    Volume representation and modeling of heterogeneous objects acquired from real world are very challenging research tasks and playing fundamental roles in many potential applications, e.g., volume reconstruction, volume simulation and volume registration. In order to accurately and efficiently represent and model the real-world objects, this dissertation proposes an integrated computational framework based on dynamic multivariate simplex splines (DMSS) that can greatly improve the accuracy and efficacy of modeling and simulation of heterogenous objects. The framework can not only reconstruct with high accuracy geometric, material, and other quantities associated with heterogeneous real-world models, but also simulate the complicated dynamics precisely by tightly coupling these physical properties into simulation. The integration of geometric modeling and material modeling is the key to the success of representation and modeling of real-world objects. The proposed framework has been successfully applied to multiple research areas, such as volume reconstruction and visualization, nonrigid volume registration, and physically based modeling and simulation

    Interactive isosurface ray tracing of time-varying tetrahedral volumes

    Get PDF
    Journal ArticleAbstract- We describe a system for interactively rendering isosurfaces of tetrahedral finite-element scalar fields using coherent ray tracing techniques on the CPU. By employing state-of-the art methods in polygonal ray tracing, namely aggressive packet/frustum traversal of a bounding volume hierarchy, we can accomodate large and time-varying unstructured data. In conjunction with this efficiency structure, we introduce a novel technique for intersecting ray packets with tetrahedral primitives. Ray tracing is flexible, allowing for dynamic changes in isovalue and time step, visualization of multiple isosurfaces, shadows, and depth-peeling transparency effects. The resulting system offers the intuitive simplicity of isosurfacing, guaranteed-correct visual results, and ultimately a scalable, dynamic and consistently interactive solution for visualizing unstructured volumes

    Visualización progresiva de redes tetraédricas en el dominio de wavelet

    Get PDF
    La transmisión progresiva de redes tetraédricas en el dominio wavelet es muy eficiente. Sólo es necesario transmitir primero la red base junto con los coeficientes obtenidos durante el análisis multirresolución, mientras que los detalles pueden ser transmitidos después, por paquetes y en desorden. En este trabajo proponemos un algoritmo simple y robusto para visualización progresiva de tales redes tetraédricas. Adaptamos la red en tiempo de ejecución para mostrar el máximo detalle posible mediante un esquema de refinamiento rojo/verde al tiempo que aumentamos la eficiencia del rendering reduciendo el detalle en las zonas no visibles con respecto al punto de vista.Currently, the progressive transmission of tetrahedral meshes in the wavelet domain is very efficient. It is necessary to pass on first the base mesh along with the coefficient obtained during the multi resolution analysis before transmitting the details. The details can be transmitted in packages without a specific order. In this paper we suggest a simple but strong algorithm for progressive visualization of tetrahedral meshes in the wavelet domain. We adjust the mesh during the execution time using the red/green refinement technique in order to show all the possible details. At the same time, we improve the volume renderer performance by reducing its work load in all the non visible parts with regard to the point of view.Red de Universidades con Carreras en Informática (RedUNCI

    Visualización progresiva de redes tetraédricas en el dominio de wavelet

    Get PDF
    La transmisión progresiva de redes tetraédricas en el dominio wavelet es muy eficiente. Sólo es necesario transmitir primero la red base junto con los coeficientes obtenidos durante el análisis multirresolución, mientras que los detalles pueden ser transmitidos después, por paquetes y en desorden. En este trabajo proponemos un algoritmo simple y robusto para visualización progresiva de tales redes tetraédricas. Adaptamos la red en tiempo de ejecución para mostrar el máximo detalle posible mediante un esquema de refinamiento rojo/verde al tiempo que aumentamos la eficiencia del rendering reduciendo el detalle en las zonas no visibles con respecto al punto de vista.Currently, the progressive transmission of tetrahedral meshes in the wavelet domain is very efficient. It is necessary to pass on first the base mesh along with the coefficient obtained during the multi resolution analysis before transmitting the details. The details can be transmitted in packages without a specific order. In this paper we suggest a simple but strong algorithm for progressive visualization of tetrahedral meshes in the wavelet domain. We adjust the mesh during the execution time using the red/green refinement technique in order to show all the possible details. At the same time, we improve the volume renderer performance by reducing its work load in all the non visible parts with regard to the point of view.Red de Universidades con Carreras en Informática (RedUNCI

    Wavelet representation of contour sets

    Get PDF
    Journal ArticleWe present a new wavelet compression and multiresolution modeling approach for sets of contours (level sets). In contrast to previous wavelet schemes, our algorithm creates a parametrization of a scalar field induced by its contours and compactly stores this parametrization rather than function values sampled on a regular grid. Our representation is based on hierarchical polygon meshes with subdivision connectivity whose vertices are transformed into wavelet coefficients. From this sparse set of coefficients, every set of contours can be efficiently reconstructed at multiple levels of resolution. When applying lossy compression, introducing high quantization errors, our method preserves contour topology, in contrast to compression methods applied to the corresponding field function. We provide numerical results for scalar fields defined on planar domains. Our approach generalizes to volumetric domains, time-varying contours, and level sets of vector fields
    • …
    corecore