|Title||A Selective Refinement Approach for Computing the Distance Function of Curves
(In Proceedings) |
|in||Proceedings of VisSym 2001|
Daniel E. Laney, Mark A. Duchaineau, Nelson Max |
|Date||May 28--30, 2001|
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 where requested and does not rely on a preset sampling rate or other constraints.