Open Access10.4230/DFU.VOL2.SCIVIZ.2011.360
Modeling multiresolution 3D scalar fields through {Regular} {Simplex} {Bisection}
Kenneth Weiss,Leila De Floriani +1 more
- 01 Jan 2011
- Vol. 2, pp 360-377
TL;DR: This work reviews modeling techniques for multiresolution three-dimensional scalar fields based on a discretization of the field domain into nested tetrahedral meshes generated through regular simplex bisection, and focuses on representations for the modeling primitive and for nested meshes.
read more
Abstract: We review modeling techniques for multiresolution three-dimensional scalar fields based on a discretization of the field domain into nested tetrahedral meshes generated through regular simplex bisection. Such meshes are described through hierarchical data structures and their representation is characterized by the modeling primitive used. The primary conceptual distinction among the different approaches proposed in the literature is whether they treat tetrahedra or clusters of tetrahedra, called diamonds, as the modeling primitive. We first focus on representations for the modeling primitive and for nested meshes. Next, we survey the applications of these meshes to modeling multiresolution 3D scalar fields, with an emphasis on interactive visualization. We also consider the relationship of such meshes to octrees. Finally, we discuss directions for further research.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Proceedings Article
Interactive View-Dependent Rendering of Large Iso-Surfaces
B. Gregorski,Duchaineau,P. Lindstrom,Valerio Pascucci,K.J. Joy +4 more
- 11 Jan 2002
TL;DR: An algorithm for interactively extracting and rendering isosurfaces of large volume datasets in a view-dependent fashion and a data layout scheme based on hierarchical space filling curves provides access to the data in a cache coherent manner that follows the data access pattern indicated by the mesh refinement.
26
Longest-edge n -section algorithms
TL;DR: All known properties of the longest-edge n -section algorithms are surveyed and a list of open problems arising in and around this topic is presented.
10
References
•Proceedings Article
Continuous level of detail rendering of height fields
Peter Lindstrom,David Koller,L. E Hodges W. Ribarsky,Nickolas L. Faust,Gregory A. Turner +4 more
- 01 Jan 1996
TL;DR: In this article, a coarse level of simplification is performed to select discrete levels of detail for blocks of the surface mesh, followed by further simplification through repolygonalization in which individual mesh vertices are considered for removal.
787
•Book
The Computation of Fixed Points and Applications
Michael J. Todd
- 01 May 1976
TL;DR: In this paper, Brouwer's Theorem and its extensions have been used to find completely labeled simplices. But the complexity of these simplices has not been studied.
468
Terrain simplification simplified: a general framework for view-dependent out-of-core visualization
Peter Lindstrom,Valerio Pascucci +1 more
TL;DR: It is shown that visualization of gigabyte-size data sets can be realized even on low-end, commodity PCs without the need for complicated and explicit data paging techniques, by virtue of dramatic improvements in multilevel cache coherence.
352
A recursive approach to local mesh refinement in two and three dimensions
TL;DR: A recursive algorithm for local refinement of tetrahedral meshes in three dimensions based on similar bisection strategy is described, which requires certain restrictions on the initial mesh.
247
Related Papers (5)
Kenneth Weiss,Leila De Floriani +1 more
- 01 Jan 2010
M. Lee,L. De Floriani,Hanan Samet +2 more
- 07 Jun 2004