A Selective Refinement Approach for Computing the Distance Functions of Curves

VisSym(2001)

引用 2|浏览0
暂无评分
摘要
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.
更多
查看译文
关键词
Scalar Field,Linear Approximation,Distance Approximation,Distance Node,Active List
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要