Multiresolution representation and visualization of volume data
IEEE Transactions on Visualization and Computer GraphicsPublished 1 January 1997
Paolo Cignoni, C. Montani, Enrico Puppo, Roberto Scopigno
Citations103
SJR quartileQ1
SJR score1.06
SNIP2.13
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A system to represent and visualize scalar volume data at multiple resolution on a multiresolution model based on tetrahedral meshes with scattered vertices that can be obtained from any initial dataset is presented.
Abstract
A system to represent and visualize scalar volume data at multiple resolution is presented. The system is built on a multiresolution model based on tetrahedral meshes with scattered vertices that can be obtained from any initial dataset. 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 supports interactive visualization of a representation at an arbitrary level of resolution through isosurface and projective methods. The user can interactively adapt the quality of visualization to requirements of a specific application task and to the performance of a specific hardware platform. Representations at different resolutions can be used together to further enhance interaction and performance through progressive and multiresolution rendering.
Keywords
Computer ScienceEarth and Planetary SciencesEngineering
IEEE Transactions on Pattern Analysis and Machine IntelligenceA theory for multiresolution signal decomposition: the wavelet representation
21,081 Citations1989Stéphane Mallat
It is shown that the difference of information between the approximation of a signal at the resolutions 2/sup j+1/ and 2/Sup j/ can be extracted by decomposing this signal on a wavelet orthonormal basis of L/sup 2/(R/sup n/), the vector space of measurable, square-integrable n-dimensional functions.
Marching cubes: A high resolution 3D surface construction algorithm
10,197 Citations1987William E. Lorensen, H. E. Cline
A new algorithm, called marching cubes, is presented that creates triangle models of constant density surfaces from 3D medical data using a divide-and-conquer approach to generate inter-slice connectivity and a case table that defines triangle topology.
ACM SIGGRAPH Computer GraphicsMarching cubes: A high resolution 3D surface construction algorithm
8,540 Citations1987William E. Lorensen, H. E. Cline
Mathematics of ComputationComputational Geometry--An Introduction.
4,264 Citations1986Mikhail J. Atallah, Franco P. Preparata +1 more
Progressive meshes
2,770 Citations1996Hugues Hoppe
The progressive mesh (PM) representation is introduced, a new scheme for storing and transmitting arbitrary triangle meshes that addresses several practical problems in graphics: smooth geomorphing of level-of-detail approximations, progressive transmission, mesh compression, and selective refinement.
Decimation of triangle meshes
1,439 Citations1992W. J. Schroeder, Jonathan A. Zarge +1 more
An application independent algorithm that uses local operations on geometry and topology to reduce the number of triangles in a triangle mesh and results from two different geometric modeling applications illustrate the strengths of the algorithm.
Geometry compression
634 Citations1995Michael F. Deering
ACM Transactions on GraphicsOctrees for faster isosurface generation
573 Citations1992Jane Wilhelms, Allen Van Gelder
A new space-efficient design is introduced for octree representations of volumes whose resolutions are not conveniently a power of two; octrees following this design are called branch-on-need octrees (BONOs).
Simplification envelopes
516 Citations1996Jonathan D. Cohen, Amitabh Varshney +6 more
The idea of simplification envelopes for generating a hierarchy of level-of-detail approximations for a given polygonal model and guarantees that all points of an approximation are within a user-speciesable distance from the original model.
A polygonal approximation to direct scalar volume rendering
418 Citations1990Peter Shirley, Allan Tuchman
A method is presented that approximates tetrahedral volume cells with hardware renderable transparent triangles that produces results which are visually similar to more exact methods for scalar volume rendering, but is faster and has smaller memory requirements.
Hierarchical splatting
376 Citations1991David Laur, Pat Hanrahan
This paper presents a progressive refinement algorithm for volume rendering which uses a pyramidal volume representation, so an octtree can be fit to the pyramid given a user-supplied precision.
IEEE/ACM Transactions on Computational Biology and BioinformaticsSequencing-by-hybridization revisited: the analog-spectrum proposal
320 Citations2004F. P. Preparata
This paper proposes an alternative, called the analog-spectrum model, which more closely reflects the biochemical process, and reestablishes probe length as the performance-governing factor, adopting "semidegenerate bases" as suitable emulators of currently inadequate universal bases.
IEEE Computer Graphics and ApplicationsSuperfaces: polygonal mesh simplification with bounded error
270 Citations1996Alan D. Kalvin, Richard H. Taylor
The algorithm presented simplifies polyhedral meshes within prespecified tolerances based on a bounded approximation criterion and its face merging procedure is efficient and greedy-that is, it does not backtrack or undo any merging once completed and thus, the algorithm is practical for simplifying very large meshes.
Computer Aided Geometric DesignA data reduction scheme for triangulated surfaces
248 Citations1994Bernd Hamann
An algorithm is developed to iteratively remove triangles from the triangulation using an underlying parametric or implicit surface representation and an order is introduced on the set of triangles by considering curvature at their vertices.
ACM SIGGRAPH Computer GraphicsA polygonal approximation to direct scalar volume rendering
247 Citations1990Peter Shirley, Allan Tuchman
Computer Aided Geometric DesignConstruction of three-dimensional Delaunay triangulations using local transformations
231 Citations1991Barry Joe
It is proved that the conjecture that an algorithm which uses local transformations to construct a triangulation of a set of n three-dimensional points that is pseudo-locally-optimal with respect to the sphere criterion is true, and that the algorithm can be improved by removing unnecessary tests.
ACM Transactions on GraphicsVisibility-ordering meshed polyhedra
195 Citations1992Peter L. Williams
It is shown how the ordering algorithms used for domain decomposition of finite element meshes for parallel processing, and how the data structures used by these algorithms can be used to solve the spatial point location problem.
IEEE Transactions on Visualization and Computer GraphicsSpeeding up isosurface extraction using interval trees
183 Citations1997Paolo Cignoni, Pablo Pavón‐Mariño +3 more
The interval tree is an optimally efficient search structure proposed by Edelsbrunner (1980) to retrieve intervals on the real line that contain a given query value and the application of such a data structure to the fast location of cells intersected by an isosurface in a volume dataset is proposed.
Automatic extraction of Irregular Network digital terrain models
181 Citations1979Robert J. Fowler, James J. Little
A method is described for automatically extracting a TIN model from dense raster data by automatically triangulating a set of feature points derived from the raster model and results show that substantial savings in storage can be obtained.
International Journal of Geographical Information SystemsComparison of existing methods for building triangular irregular network, models of terrain from grid digital elevation models
142 Citations1991Jay Lee
Detailed structural and statistical comparisons show that the methods for extracting TINs from dense digital elevation models (DEMs) on a sample DEM perform with different rates of success in different settings.
ACM SIGGRAPH Computer GraphicsAutomatic extraction of Irregular Network digital terrain models
135 Citations1979Robert J. Fowler, James J. Little
The Visual ComputerRepresentation and visualization of terrain surfaces at variable resolution
115 Citations1997Paolo Cignoni, Enrico Puppo +1 more
EurographicsSimplification, LOD and MultiresolutionPrinciples and Applications
113 Citations1997Enrico Puppo, Roberto Scopigno
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.
A multiresolution framework for volume rendering
109 Citations1994Rüdiger Westermann
In dieser Arbeit wurde ein genereller hierarchischer Ansatz zur Visualisierung skalarer Volumendaten entwickelt, which resultierte in speziellen Verfahren zur Vorverarbeitung and Darstellung zeitvarianter Datensequenzen.
IEEE VisualizationMultiresolution tetrahedral framework for visualizing regular volume data
102 Citations1997Yong Zhou, Baoquan Chen +1 more
Multi-dimensional trees for controlled volume rendering and compression
93 Citations1994Jane Wilhelms, Allen Van Gelder
This paper explores the use of multi-dimensional trees to provide spatial and temporal efficiencies in imaging large data sets and compares the hierarchical model to actual data values, and the second compares the pixel values of images produced by different parameter settings.
Multiresolution modeling and visualization of volume data based on simplicial complexes
93 Citations1994Paolo Cignoni, Leila De Floriani +3 more
A multiresolution model for the representation and visualization of a scattered volumetric dataset, based on a decomposition of the three-dimensional domain into tetrahedra, is proposed, which allows an efficient extraction of compact isosurfaces with adaptive resolution levels as well as the development of progressive andMultiresolution rendering approaches.
Computer Aided Geometric DesignData point selection for piecewise linear curve approximation
92 Citations1994Bernd Hamann, Jiann-Liang Chen
The selected subset of data points is distributed in such a way that they are uniformly distributed with respect to integrated absolute curvature.
Symposium on Volume VisualizationHardware assisted volume rendering of unstructured grids by incremental slicing
83 Citations1996David M. Reed, Roni Yagel +3 more
SIAM Journal on ComputingSurface Approximation and Geometric Partitions
80 Citations1998Pankaj K. Agarwal, Subhash Suri
The main result of the paper is a polynomial-time approximation algorithm that computes a piecewise- linear surface of size O(Ko logKo), where Ko is the complexity of an optimal surface satisfying the constraints of the problem.
The multilevel finite element method for adaptive mesh optimization and visualization of volume data
78 Citations1997R. Grosso, Christoph Lürig +1 more
Discretized Marching Cubes
74 Citations2002C. Montani, Riccardo Scateni +1 more
An algorithm is presented that considerably reduces the number of polygons generated by a Marching Cubes-like scheme without excessively increasing the overall computational complexity.
IEEE Computer Graphics and ApplicationsGeneralized unstructured decimation [computer graphics]
63 Citations1996Kevin J. Renze, James H. Oliver
The research focuses on vertex removal methodology, not on the formulation of decimation criteria, and the resulting decimation algorithm is robust and efficient because it avoids floating-point classification computations.
IEEE Transactions on Visualization and Computer GraphicsMultiscale volume representation by a DoG wavelet
62 Citations1995Shigeru Muraki
A method for decomposing volume data into 3D DoG (difference of Gaussians) functions by using the frame theory of nonorthogonal wavelets is presented and its efficiency in describing the spatial structure of the volume is shown.
COMBINATORICAAn acyclicity theorem for cell complexes ind dimension
61 Citations1990Herbert Edelsbrunner
This paper shows that the in_front/behind relation defined for the faces of C with respect to any fixed viewpointx is acyclic, which has applications to hidden line/surface removal and other problems in computational geometry.
On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra
50 Citations1989Jim Ruppert, Raimund Seidel
The problem of deciding whether a given polyhedron can be tetrahedralized is NP-complete, and hence likely to be computationally intractable.
Hardware assisted volume rendering of unstructured grids by incremental slicing
49 Citations2002R. Yagel, D.M. Reed +3 more
This work describes an efficient method for rendering unstructured grids that is based on incremental slicing and hardware polygon rendering and shows that it is faster than existing methods and provides adaptive control and progressive image generation.
The multilevel finite element method for adaptive mesh optimization and visualization of volume data
47 Citations2002R. Grosso, Christoph Lürig +1 more
A method based on finite element approximations which combines these two approaches in a new and unique way that is conceptually simple and theoretically sound and shows significant speedups over conventional methods delivering comparable rendering quality from adaptively compressed datasets.
Computer Graphics ForumMagicsphere: an insight tool for 3D data visualization
42 Citations1994Paolo Cignoni, C. Montani +1 more
The MagicSphere idea originated as a solution to this problem, but its potential goes much further than this original scope: it has been designed as a very generical 3D widget: it defines a spherical volume of interest in the dataset modeling space.
Interactive splatting of nonrectilinear volumes
29 Citations2003Peter L. Williams
Various techniques are described for achieving interactive direct volume rendering of nonrectilinear data sets using fast projection (splatting) methods using graphics hardware, rendering approximations, parallelization and reduced resolution meshes.
Computer Aided Geometric DesignData point selection for piecewise trilinear approximation
27 Citations1994Bernd Hamann, Jiann-Liang Chen
A technique for the iterative selection of 3D points with associated function values (trivariate data) is presented, based on assigning weights to the given data and selecting the most important ones.
EurographicsOn the Optimization of Projective Volume Rendering
26 Citations1995Paolo Cignoni, C. Montani +2 more
This paper focuses on projective visualization of datasets represented via tetrahedral tessellations, and compares the results obtained by the optimization of the rendering process with those obtained by adopting a data simplification approach.
The Visual ComputerPursuing interactive visualization of irregular grids
26 Citations1993Jane Wilhelms
This paper explores algorithms for a particular kind of irregular grid known as a curvilinear grid, composed of six-sided cells that may be considered a result of the deformation of a regular rectilinear Grid.
An efficient algorithm for terrain simplification
26 Citations1997Pankaj K. Agarwal, Pavan K. Desikan
A randomized algorithm is presented that computes an {epsilon}-approximation of size O(c{sup 2} log{Sup 2} c) in O(n {sup 2+{delta}} + c{sup 3} log {Sup 3}c log n/c) expected time, where c is the size of the {Epsilon]- approximation with the minimum number of vertices and {delta} is any arbitrarily small positive
IEEE Transactions on Visualization and Computer GraphicsA multiscale model for structure-based volume rendering
21 Citations1995Bin Guo
This work uses a dyadic wavelet transform to construct g/sub s/(x) from f(x) and derive subvolumes with the following attractive properties: 1) the information contained in theSubvolumes are sufficient for reconstructing the entire V; and 2) the shapes of the subVolumes provide a hierarchical description of the geometric structures of V.
IEEE Computer Graphics and ApplicationsSpray rendering
19 Citations1994Alex Pang
The benefits, conceptual design, issues and directions of spray rendering are presented, including extensibility, grid independence, and ability to handle large data sets.
Dynamic maintenance of Delaunay triangulations
19 Citations1991Thomas Chiungtung Kao, David M. Mount +1 more
This work describes and analyzes the complexity of a procedure for computing and updating a Delaunay triangulation of a set of points in the plane subject to incremental insertions and deletions, based on a recent method of Guibas, Knuth, and Sharir.
Pyramidal simplicial complexes
19 Citations1995Michela Bertolotto, Leila De Floriani +1 more
A new mo{le] for Iepreseuting a liypersurface describing a scalar field in ally dimension at ,Iifferellt levels of detail is proposed for applications in which a “~loll-to~~ol{~gical” lelJlesrlltatioll is required.
EurographicsEfficient Visualization of Large—Scale Data on Hierarchical Meshes
16 Citations1997R. Neubauer, Mario Ohlberger +2 more
A multi-resolution approach is presented for data on a large class of hierarchical and nested grids that consists of a recursive traversal of mesh elements from the grid hierarchy combined with an adaptive stopping according to some error indicator which is closely related to the visual impression of data smoothness.