Filters








163 Hits in 8.7 sec

HexaShrink, an exact scalable framework for hexahedral meshes with attributes and discontinuities: multiresolution rendering and storage of geoscience models

Jean-Luc Peyrot, Laurent Duval, Frédéric Payan, Lauriane Bouard, Lénaïc Chizat, Sébastien Schneider, Marc Antonini
2019 Computational Geosciences  
HexaShrink provides a comprehensive framework allowing efficient mesh visualization and storage.  ...  We propose HexaShrink, an original decomposition scheme for structured hexahedral volume meshes. The latter are used for instance in biomedical engineering, materials science, or geosciences.  ...  Dawson and M. F. Wheeler for their help, as well as the reviewers whose comments helped improve the compression performance assessment and comparison.  ... 
doi:10.1007/s10596-019-9816-2 fatcat:gltpzzoyvfe3bbez5snwtcjayq

Simplicial-based Multiresolution Volume Datasets Management: An Overview [chapter]

Rita Borgo, Paolo Cignoni, Roberto Scopigno
2004 Mathematics and Visualization  
The paper synthetically presents the methodologies proposed for the efficient multiresolution management of large volume datasets.  ...  A comparison, highlighting respective strength and weakness of the two classes of methods, is proposed and discussed.  ...  Multiresolution representations for simplicial meshes Current multiresolution models for generic tetrahedral meshes can manage a large set of level of details in a flexible, efficient and compact way.  ... 
doi:10.1007/978-3-662-07443-5_19 fatcat:trcarfdi6ffz5ifqycgtutl3sy

Multiresolution representation and visualization of volume data

P. Cignoni, C. Montani, E. Puppo, R. Scopigno
1997 IEEE Transactions on Visualization and Computer Graphics  
The model is built off-line through data simplification techniques, and stored in a compact data structure that supports fast on-line access.  ...  The system is built on a multiresolution model based on tetrahedral meshes with scattered vertices that can be obtained from any initial dataset.  ...  ACKNOWLEDGMENTS We wish to thank Leila De Floriani for her participation in the early stages of this project and for many useful discussions; this work is part of a continuing collaboration between her  ... 
doi:10.1109/2945.646238 fatcat:6is6yon3jrarpod5syhteg5mdy

Simplification, LOD and MultiresolutionPrinciples and Applications [article]

Enrico Puppo, Roberto Scopigno
1997 Eurographics State of the Art Reports  
of such a framework.  ...  These tutorial notes provide an introduction, review, and discussion of the state-of-the-art on simplification methods, Level Of Detail, and multiresolution models for surface meshes, and of their applications  ...  For historical models, there is a great variety of data structures of increasing complexity and efficiency.  ... 
doi:10.2312/egt.19971011 fatcat:6ouv5nrr6bapxiv3elfgnby6tu

TOM: TOTALLY ORDERED MESH A MULTIRESOLUTION STRUCTURE FOR TIME CRITICAL GRAPHICS APPLICATIONS

ERIC BOUVIER, ENRICO GOBBETTI
2001 International Journal of Image and Graphics  
We describe the TOM (Totally Ordered Mesh), a multiresolution triangle mesh structure tailored to the support of time-critical adaptive rendering.  ...  The structure grants high speed access to the continuous levels of detail of a mesh and allows very fast traversal of the list of triangles at arbitrary resolution so that bottlenecks in the graphic pipeline  ...  Acknowledgments The authors would like to thank Hugues Hoppe, Michael Garland, and the Stanford graphics group for making benchmark datasets available, and the Visual Computing Group at I.E.I. for the  ... 
doi:10.1142/s0219467801000098 fatcat:zemx6j6odndfrd2mg5kdyhqhs4

A Multiresolution Model for Soft Objects Supporting Interactive Cuts and Lacerations

Fabio Ganovelli, Paolo Cignoni, Claudio Montani, Roberto Scopigno
2000 Computer graphics forum (Print)  
simplification and multiresolution management of 3D simplicial decompositions.  ...  Our approach is based on a tetrahedral decomposition of the space, chosen both for its suitability to support a particle system and for the ready availability of many techniques recently proposed for the  ...  Hence, when a cut is performed it generally affects not only the current mesh but also the multiresolution data structure.  ... 
doi:10.1111/1467-8659.00419 fatcat:axy2xw7k25de5fl25hfma5jttq

Efficient implementation of real-time view-dependent multiresolution meshing

R. Pajarola, C. DeCoro
2004 IEEE Transactions on Visualization and Computer Graphics  
This paper introduces an efficient hierarchical multiresolution triangulation framework based on a half-edge triangle mesh data structure and presents optimized implementations of several view-dependent  ...  In this paper, we present an efficient (topology preserving) multiresolution meshing framework for interactive level-of-detail (LOD) generation and rendering of large triangle meshes.  ...  In this context, the two main contributions of this paper are: . an efficient implementation of a hierarchical, halfedge data structure based multiresolution triangulation framework for view-dependent  ... 
doi:10.1109/tvcg.2004.1272735 pmid:18579965 fatcat:jemkjisknbdizp3demaglxddje

A Generic Programming Approach to Multiresolution Spatial Decompositions [chapter]

Vinícius Mello, Luiz Velho, Paulo Roma Cavalcanti, Cláudio T. Silva
2003 Mathematics and Visualization  
From a set of simple and necessary requirements, we arrive at the Binary Multitriangulation (BMT) concept. We also describe a data structure that models the BMT concept in its full generality.  ...  We present a generic programming approach to the implementation of multiresolution spatial decompositions.  ...  We intend to discuss techniques for generation and processing of multiresolution adaptive tetrahedral meshes in a future paper.  ... 
doi:10.1007/978-3-662-05105-4_18 fatcat:qjdl7owinbbdhnwz4bhwi4k3am

Time-critical multiresolution rendering of large complex models

E. Gobbetti, E. Bouvier
2000 Computer-Aided Design  
Results show that our algorithms and data structures provide low memory overhead, smooth levelof-detail control, and guarantee, within acceptable limits, a uniform, bounded frame rate even for widely changing  ...  Previous work has shown that this can be done by representing individual scene components as multiresolution triangle meshes, and performing at each frame a convex constrained optimization to choose the  ...  Acknowledgments We would like to thank Hugues Hoppe, Michael Garland, and the Stanford graphics group for making benchmark datasets available to the research community.  ... 
doi:10.1016/s0010-4485(00)00068-3 fatcat:fkw5y7ptuvc6xics3v3hqq75du

CHuMI viewer: Compressive huge mesh interactive viewer

Clément Jamin, Pierre-Marie Gandoin, Samir Akkouche
2009 Computers & graphics  
In this article, we attempt to reconcile lossless compression and visualization by proposing a data structure that radically reduces the size of the object while supporting a fast interactive navigation  ...  The preprocessing of large meshes to provide and optimize interactive visualization implies a complete reorganization that often introduces significant data growth.  ...  Acknowledgments The models are provided courtesy of  ... 
doi:10.1016/j.cag.2009.03.029 fatcat:gktj3pcjlbe57a3iu2fhxok7nm

Interactive Rendering of Dynamic Geometry

F. Ponchio, K. Hormann
2008 IEEE Transactions on Visualization and Computer Graphics  
We show how to interactively render such four-dimensional tetrahedral meshes by improving previous GPU-accelerated techniques and building an out-of-core multi-resolution structure based on quadric-error  ...  As a second application we apply our framework to timevarying surfaces that result from morphing one triangle mesh into another.  ...  University for the dams and wave data sets and Scott Kircher from the University of Illinois for the horse-to-man and cloth morphing sequences.  ... 
doi:10.1109/tvcg.2008.35 pmid:18467764 fatcat:uuyljqh4zzbzpptsqduazjmnh4

Massive-Model Rendering Techniques: A Tutorial

Andreas Dietrich, Enrico Gobbetti, Sung-Eui Yoon
2007 IEEE Computer Graphics and Applications  
The Italian Ministry of University and Research, under grant Cybersar, and a Korea Advanced Institute of Science and Technology seed grant partially supported this work.  ...  Acknowledgments We thank Fabio Marton and Abe Stephens for their help.  ...  The Adaptive TetraPuzzles system also introduced a solution based on a patch-based multiresolution data structure. 6 From this structure, the rendering system can efficiently extract view-dependent conforming  ... 
doi:10.1109/mcg.2007.154 pmid:18027795 fatcat:ddlwytozzbhopahcn2fkf2hmgq

AMM: Adaptive Multilinear Meshes [article]

Harsh Bhatia, Duong Hoang, Nate Morrical, Valerio Pascucci, Peer-Timo Bremer, Peter Lindstrom
2022 arXiv   pre-print
Adaptive representations are increasingly indispensable for reducing the in-memory and on-disk footprints of large-scale data.  ...  We describe a practical approach to creating AMM incrementally using arbitrary orderings of data and demonstrate AMM on six types of resolution and precision datastreams.  ...  Internally, AMM is represented as a pointerless tree data structure that defines a spatial hierarchy, and allows fast access to mesh elements.  ... 
arXiv:2007.15219v3 fatcat:w6ijdinqfbbsxjdy2koj4vi6ei

Selectively Refinable Subdivision Meshes [article]

Enrico Puppo
2006 Symposium on geometry processing : [proceedings]. Symposium on Geometry Processing  
Our method does not require any hierarchical data structure, being based just on color codes and level numbers assigned to elements of a mesh, which can be encoded in a standard topological data structure  ...  Our mechanism permits to take an adaptive mesh at intermediate level of subdivision and process it through both refinement and coarsening operations, by remaining consistent with an underlying Loop subdivision  ...  and tools) funded by the Italian Ministry of Education, University and Research under contract number RBIN04HWR8.  ... 
doi:10.2312/sgp/sgp06/153-162 fatcat:pysv4dr2vndtnidtlqwetgp27y

Efficient topology-aware simplification of large triangulated terrains

Yunting Song, Riccardo Fellegara, Federico Iuricich, Leila De Floriani
2021 Proceedings of the 29th International Conference on Advances in Geographic Information Systems  
We define a topologyaware simplification algorithm on a compact and distributed data structure for triangle meshes, namely the Terrain trees.  ...  structure for TINs.  ...  The Molokai point cloud is kindly provided by NOAA National Centers for Environmental Information.  ... 
doi:10.1145/3474717.3484261 fatcat:qkgsrvpcwfbglppojjqwnjohpu
« Previous Showing results 1 — 15 out of 163 results