A Data Structure and an Algorithm for the Nearest Point Problem (Q3659157): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q111898988, #quickstatements; #temporary_batch_1706368214787 |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1109/tse.1983.235263 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2091967195 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:31, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Data Structure and an Algorithm for the Nearest Point Problem |
scientific article |
Statements
A Data Structure and an Algorithm for the Nearest Point Problem (English)
0 references
1983
0 references
tree structure
0 references
nearest point
0 references
storage binary search
0 references