Deferred data structure for the nearest neighbor problem (Q1183453): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57904598 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Deferred Data Structuring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Search in Planar Subdivisions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments / rank | |||
Normal rank | |||
Latest revision as of 14:48, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deferred data structure for the nearest neighbor problem |
scientific article |
Statements
Deferred data structure for the nearest neighbor problem (English)
0 references
28 June 1992
0 references
on-line algorithms
0 references
convex hulls
0 references
Voronoi diagrams
0 references
farthest neighbors
0 references
nearest neighbors
0 references
