Optimal Expected-Time Algorithms for Closest Point Problems (Q3883531): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024766881 / rank | |||
Normal rank | |||
Latest revision as of 00:05, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal Expected-Time Algorithms for Closest Point Problems |
scientific article |
Statements
Optimal Expected-Time Algorithms for Closest Point Problems (English)
0 references
1980
0 references
computational geometry
0 references
closest point problems
0 references
minimum spanning trees
0 references
nearest neighbor searching
0 references
optimal algorithms
0 references
Voronoi diagrams
0 references
