Skip to main content

2001 | OriginalPaper | Buchkapitel

A Selective Refinement Approach for Computing the Distance Functions of Curves

verfasst von : Daniel E. Laney, Mark A. Duchaineau, Nelson L. Max

Erschienen in: Data Visualization 2001

Verlag: Springer Vienna

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Metadaten
Titel
A Selective Refinement Approach for Computing the Distance Functions of Curves
verfasst von
Daniel E. Laney
Mark A. Duchaineau
Nelson L. Max
Copyright-Jahr
2001
Verlag
Springer Vienna
DOI
https://doi.org/10.1007/978-3-7091-6215-6_23

Premium Partner