Closest Pair of Points Algorithms (Q7361735)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Closest_Pair_Points
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Closest Pair of Points Algorithms |
AFP entry Closest_Pair_Points |
Statements
13 January 2020
0 references
Martin Rau
0 references
Tobias Nipkow
0 references
Closest Pair of Points Algorithms (English)
0 references
This entry provides two related verified divide-and-conquer algorithms solving the fundamental Closest Pair of Points problem in Computational Geometry. Functional correctness and the optimal running time of O ( n log n ) are proved. Executable code is generated which is empirically competitive with handwritten reference implementations.
0 references
