An optimized divide-and-conquer algorithm for the closest-pair problem in the planar case (Q2637298): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1669955554 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1010.5908 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multidimensional divide-and-conquer / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4945521 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4133127 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4140384 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2747613 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An improved algorithm for finding the closest pair of points / rank | |||
Normal rank | |||
Latest revision as of 07:55, 7 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimized divide-and-conquer algorithm for the closest-pair problem in the planar case |
scientific article |
Statements
An optimized divide-and-conquer algorithm for the closest-pair problem in the planar case (English)
0 references
11 February 2014
0 references
geometrical problem and computation
0 references
closest-pair problem
0 references
basic-2 algorithm
0 references
