A Selective Refinement Approach for Computing the Distance Functions of Curves

Laney, Daniel E.; Duchaineau, Mark A.; Max, Nelson L.

A Selective Refinement Approach for Computing the Distance Functions of Curves

Files

213-222.pdf (445.8 KB)

Date

2001

Authors

Laney, Daniel E.
Duchaineau, Mark A.
Max, Nelson L.

Publisher

The Eurographics Association

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.

        @inproceedings{:10.2312/VisSym/VisSym01/213-222
,
booktitle = {Eurographics / IEEE VGTC Symposium on Visualization
},
editor = {David S. Ebert and Jean M. Favre and Ronald Peikert
},
title = {{A Selective Refinement Approach for Computing the Distance Functions of Curves
}},
author = {Laney, Daniel E. and 
Duchaineau, Mark A. and 
Max, Nelson L.
},
year = {2001
},
publisher = {The Eurographics Association
},
ISSN = {1727-5296
},
ISBN = {3-211-83674-8
},
DOI = {/10.2312/VisSym/VisSym01/213-222
}
}