The design and analysis of spatial data structures
The design and analysis of spatial data structures
Multiresolution modeling and visualization of volume data based on simplicial complexes
VVS '94 Proceedings of the 1994 symposium on Volume visualization
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Octree-based decimation of marching cubes surfaces
Proceedings of the 7th conference on Visualization '96
Progressive tetrahedralizations
Proceedings of the conference on Visualization '98
Least squares surface approximation using multiquadrics and parametric domain distortion
Computer Aided Geometric Design
Construction of vector field hierarchies
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Adaptive, multiresolution visualization of large data sets using a distributed memory octree
SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
QSplat: a multiresolution point rendering system for large meshes
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Reconstruction and representation of 3D objects with radial basis functions
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Efficient adaptive simplification of massive meshes
Proceedings of the conference on Visualization '01
Efficient simplification of point-sampled surfaces
Proceedings of the conference on Visualization '02
Multiresolution Representation and Visualization of Volume Data
IEEE Transactions on Visualization and Computer Graphics
Simplification of Tetrahedral Meshes with Error Bounds
IEEE Transactions on Visualization and Computer Graphics
High-quality Volume Rendering of Adaptive Mesh Refinement Data
VMV '01 Proceedings of the Vision Modeling and Visualization Conference 2001
Repeated Knots in Least Squares Multiquadric Functions
Geometric Modelling, Dagstuhl, Germany, 1993
Surface Reconstruction Using Adaptive Clustering Methods
Geometric Modelling
Hierarchical Meshes for Volume Data
CGI '98 Proceedings of the Computer Graphics International 1998
PG '02 Proceedings of the 10th Pacific Conference on Computer Graphics and Applications
Delaunay refinement mesh generation
Delaunay refinement mesh generation
SHIC: A View-Dependent Rendering Framework for Isosurfaces
VV '04 Proceedings of the 2004 IEEE Symposium on Volume Visualization and Graphics
IEEE Computer Graphics and Applications
Hierarchical clustering of large volumetric datasets
GRAPHITE '05 Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia
IEEE Transactions on Visualization and Computer Graphics
Interactive Point-Based Rendering of Higher-Order Tetrahedral Data
IEEE Transactions on Visualization and Computer Graphics
Topology- and error-driven extension of scalar functions from surfaces to volumes
ACM Transactions on Graphics (TOG)
SMI 2012: Full Local approximation of scalar functions on 3D shapes and volumetric data
Computers and Graphics
Surface curvature line clustering for polyp detection in CT colonography
EG VCBM'08 Proceedings of the First Eurographics conference on Visual Computing for Biomedicine
Interactively visualizing procedurally encoded scalar fields
VISSYM'04 Proceedings of the Sixth Joint Eurographics - IEEE TCVG conference on Visualization
An integrated pipeline of decompression, simplification and rendering for irregular volume data
VG'05 Proceedings of the Fourth Eurographics / IEEE VGTC conference on Volume Graphics
Surface- and volume-based techniques for shape modeling and analysis
SIGGRAPH Asia 2013 Courses
| Hi-index | 0.00 |
We present a method to represent unstructured scalar fields at multiple levels of detail. Using a parallelizable classification algorithm to build a cluster hierarchy, we generate a multiresolution representation of a given volumetric scalar data set. The method uses principal component analysis (PCA) for cluster generation and a fitting technique based on radial basis functions (RBFs). Once the cluster hierarchy has been generated, we utilize a variety of techniques for extracting different levels of detail. The main strength of this work is its generality. Regardless of grid type, this method can be applied to any discrete scalar field representation, even one given as a "point cloud."