A selective refinement approach for computing the distance functions of curves

Authors:
Daniel E. Laney;Mark A. Duchaineau;Nelson L. Max
Affiliations:
Department of Applied Science, University of California at Davis;Lawrence Livermore National Laboratory;Department of Applied Science, University of California at Davis and Lawrence Livermore National Laboratory
Venue:
EGVISSYM'01 Proceedings of the 3rd Joint Eurographics - IEEE TCVG conference on Visualization
Year:
2001

Citing 9
Cited 0

Surface reconstruction from unorganized points

SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Real-time, continuous level of detail rendering of height fields

SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
ROAMing terrain: real-time optimally adapting meshes

VIS '97 Proceedings of the 8th conference on Visualization '97
3D scan conversion of CSG models into distance volumes

VVS '98 Proceedings of the 1998 IEEE symposium on Volume visualization
Using distance maps for accurate surface representation in sampled volumes

VVS '98 Proceedings of the 1998 IEEE symposium on Volume visualization
Very high resolution simulation of compressible turbulence on the IBM-SP system

SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Adaptively sampled distance fields: a general representation of shape for computer graphics

Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Time critical isosurface refinement and smoothing

VVS '00 Proceedings of the 2000 IEEE symposium on Volume visualization
Implicit modeling of swept surfaces and volumes

VIS '94 Proceedings of the conference on Visualization '94

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an adaptive signed distance transform algorithm for curves in the plane. A hierarchy of bounding boxes is required for the input curves. We demonstrate the algorithm on the isocontours of a turbulence simulation. The algorithm provides guaranteed error bounds with a selective refinement approach. The domain over which the signed distance function is desired is adaptively triangulated and piecewise discontinuous linear approximations are constructed within each triangle. The resulting transform performs work only were requested and does not rely on a preset sampling rate or other constraints.