A Selective Refinement Approach for Computing the Distance Functions of Curves
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
Similar Records
Adaptive signed distance transform for curves with guaranteed error bounds
Isosurface Computation Made Simple: Hardware acceleration,Adaptive Refinement and tetrahedral Stripping
A comparison of adaptive refinement techniques for elliptic problems
Conference
·
2000
·
OSTI ID:15006290
Isosurface Computation Made Simple: Hardware acceleration,Adaptive Refinement and tetrahedral Stripping
Conference
·
2004
·
OSTI ID:893172
A comparison of adaptive refinement techniques for elliptic problems
Technical Report
·
1987
·
OSTI ID:5971932