The closest pair of points problem or closest pair problem is a problem of computational geometry: given n {\displaystyle n} points in metric space, find...

registration Computational geometry – see Closest pair of points problem Cryptanalysis – for lattice problem Databases – e.g. content-based image retrieval...

problems stated in terms of points only are sometimes referred to as closest point problems, although the term "closest point problem" is also used synonymously...

applied.[how?] Mathematics portal Nearest centroid classifier Closest pair of points problem Nearest neighbor graph Segmentation-based object categorization...

related to the complexity of computing bichromatic closest pairs. In the bichromatic closest pair problem, the input is a set of points, given two different...

set of edges that connect points of the plane, the problem to determine whether they contain a triangulation is NP-complete. Some triangulations of a set...

A kinetic closest pair data structure is a kinetic data structure that maintains the closest pair of points, given a set P of n points that are moving...

each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" It is an NP-hard problem in...

data Closest pair of points problem, the algorithmic problem of finding two points that have the minimum distance among a larger set of points Euclidean...

geometry problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane. The corresponding problem in n-dimensional...

devoted to solving problems of a geometric nature. This field includes problems from classic geometry, like the closest pair of points problem, as well as more...

relationship as a pair of intersecting circles". Its solution involves a transcendental equation. The problem derives from "A Country House Visit", one of Jan Struther's...

as problems at all until the advent of computers. Consider, for example, the Closest pair problem: Given n points in the plane, find the two with the...

In this way, it avoids the problem of repeatedly finding closest pairs. Nevertheless, for many types of clustering problem, it can be guaranteed to come...

problem in 1893, and Tibor Gallai, who published one of the first proofs of this theorem in 1944. A line that contains exactly two of a set of points...

many problems, such as sorting (e.g., quicksort, merge sort), multiplying large numbers (e.g., the Karatsuba algorithm), finding the closest pair of points...

The Monty Hall problem is a brain teaser, in the form of a probability puzzle, based nominally on the American television game show Let's Make a Deal...

as an instance of the closest pair of points problem, taking worst-case time O(n log n) or (with randomized time and with the use of the floor function)...

problem in mathematics What is the asymptotic growth rate of the area of the smallest triangle determined by three out of n {\displaystyle n} points in...

point to the cluster with the closest centroid.[citation needed] Using only the centroid to redistribute the data has problems when clusters lack uniform...

well-separated pair decomposition (WSPD) of a set of points S ⊂ R d {\displaystyle S\subset \mathbb {R} ^{d}} , is a sequence of pairs of sets ( A i , B...

be confused with ray tracing of computer graphics) Slab method Closest pair of points Closest point problem Diameter of a point set Delaunay triangulation...

computer science, the maximum sum subarray problem, also known as the maximum segment sum problem, is the task of finding a contiguous subarray with the largest...

1988: Closest pair". In Aggarwal, Alok; Wein, Joel (eds.). Computational Geometry: Lecture Notes for 18.409, Spring 1988. Massachusetts Institute of Technology...

calculus operation of indefinite integration (i.e. finding antiderivatives) Closest pair problem: find the pair of points (from a set of points) with the smallest...

central-force problem is to determine the motion of a particle in a single central potential field. A central force is a force (possibly negative) that points from...

addresses one of DBSCAN's major weaknesses: the problem of detecting meaningful clusters in data of varying density. To do so, the points of the database...

numerical analysis, one of the most important problems is designing efficient and stable algorithms for finding the eigenvalues of a matrix. These eigenvalue...

to the particular optimization problem being solved) If it is bigger, remove from the input the points whose closest neighbor is farther than ε If it...

triangulation problem is the problem of finding a triangulation of minimal total edge length. That is, an input polygon or the convex hull of an input point...