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. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1669955554 / rank | |||
Normal rank | |||
Revision as of 02:41, 20 March 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
