Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

A Selective Refinement Approach for Computing the Distance Functions of Curves

Conference ·

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.

Research Organization:
Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
Sponsoring Organization:
US Department of Energy (US)
DOE Contract Number:
W-7405-ENG-48
OSTI ID:
15006152
Report Number(s):
UCRL-JC-142632; TRN: US200405%%290
Resource Relation:
Conference: Joint Eurographics - IEEE Technical Committee on Visualization and Graphics Symposium on Visualization, Ascona (CH), 05/28/2001--05/30/2001; Other Information: PBD: 1 Dec 2000
Country of Publication:
United States
Language:
English

References (8)

Surface reconstruction from unorganized points July 1992
Real-time, continuous level of detail rendering of height fields January 1996
Acceleration of ray-casting using 3-D distance transforms September 1992
Very high resolution simulation of compressible turbulence on the IBM-SP system January 1999
A fast marching level set method for monotonically advancing fronts. February 1996
Time critical isosurface refinement and smoothing January 2000
Using distance maps for accurate surface representation in sampled volumes January 1998
Adaptively sampled distance fields: a general representation of shape for computer graphics January 2000