Local feature size refers to several related concepts in
computer graphics and
computational geometry
Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems ar ...
for measuring the size of a geometric object near a particular point.
*Given a
smooth manifold , the local feature size at any point
is the distance between
and the
medial axis of
.
*Given a
planar straight-line graph, the local feature size at any point
is the radius of the smallest closed ball centered at
which intersects any two disjoint features (vertices or edges) of the graph.
See also
*
Nearest neighbour function
In probability and statistics, a nearest neighbor function, nearest neighbor distance distribution,A. Baddeley, I. Bárány, and R. Schneider. Spatial point processes and their applications. ''Stochastic Geometry: Lectures given at the CIME Summer ...
References
{{Reflist
Geometric algorithms