On the Fractal Dimension of Isosurfaces

Authors:
Marc Khoury;Rephael Wenger
Affiliations:
Computer and Information Science Department at The Ohio State University;Computer and Information Science Department at The Ohio State University
Venue:
IEEE Transactions on Visualization and Computer Graphics
Year:
2010

Citing 0
Cited 3

Box-counting algorithm on GPU and multi-core CPU: an OpenCL cross-platform study

The Journal of Supercomputing
Dense isocontour imaging

SIGGRAPH Asia 2013 Technical Briefs
Evaluating isosurfaces with level-set-based information maps

EuroVis '13 Proceedings of the 15th Eurographics Conference on Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

A (3D) scalar grid is a regular $n_1 x n_2 x n_3$ grid of vertices where each vertex v is associated with some scalar value $s_v$. ;Applying trilinear interpolation, the scalar grid determines a scalar function g where $g(v) = s_v$ for each grid vertex v. An isosurface with ;isovalue s is a triangular mesh which approximates the level set $g^{-1}(α)$. The fractal dimension of an isosurface represents the growth ;in the isosurface as the number of grid cubes increases. We dene and discuss the fractal isosurface dimension. Plotting the fractal ;dimension as a function of the isovalues in a data set provides information about the isosurfaces determined by the data set. We present statistics on the average fractal dimension of 60 publicly available benchmark data sets. We also show the fractal dimension is highly correlated with topological noise in the benchmark data sets, measuring the topological noise by the number of connected components in the isosurface. Lastly, we present a formula predicting the fractal dimension as a function of noise and validate the formula with experimental results.