"The Efficiency of Using k-d Trees for Finding Nearest Neighbors in ..."

O. J. Murphy, Stanley M. Selkow (1986)

> Home

Details and statistics

DOI: 10.1016/0020-0190(86)90138-9

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/MurphyS86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/MurphyS86
O. J. Murphy, Stanley M. Selkow:
The Efficiency of Using k-d Trees for Finding Nearest Neighbors in Discrete Space. Inf. Process. Lett. 23(4): 215-218 (1986)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.