Closest point problem
Encyclopedia
Closest point problem may refer to:
  • Proximity problems
    Proximity problems
    Proximity problems is a class of problems in computational geometry which involve estimation of distances between geometric objects.A subset of these problems stated in terms of points only are sometimes referred to as closest point problems, although the term "closest point problem" is also used...

  • Nearest neighbor search
    Nearest neighbor search
    Nearest neighbor search , also known as proximity search, similarity search or closest point search, is an optimization problem for finding closest points in metric spaces. The problem is: given a set S of points in a metric space M and a query point q ∈ M, find the closest point in S to q...

The source of this article is wikipedia, the free encyclopedia.  The text of this article is licensed under the GFDL.
 
x
OK