signed distance function
In mathematics and applications, the signed distance function of a set S in a metric space determines how close a given point x is to the boundary of S, with that function having positive values at points x inside S, it decreases in value as x approaches the boundary of S where the signed distance function is zero, and it takes negative values outside of S.
Formally, if (X, d) is a metric space, the signed distance function f is defined by
where
(the ∂ symbol denotes the set boundary, while 'inf' is the infimum).
If S is a subset of the Euclidean space Rn with piecewise smooth boundary, the signed distance function is differentiable almost everywhere, and its gradient satisfies the eikonal equation
An efficient algorithm for calculating the signed distance function is the fast marching method by James Sethian.
Signed distance functions are applied for example in computer vision.
See also
References
- J.A. Sethian, Level set methods and fast marching methods. Cambridge University Press (1999). ISBN 0-521-64557-3.
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
