z-logo
open-access-imgOpen Access
Nearest Neighbor Distance in Three-Dimensional Space
Author(s) -
Masashi Miyagawa
Publication year - 2018
Publication title -
forma
Language(s) - English
Resource type - Journals
eISSN - 2189-1311
pISSN - 0911-6036
DOI - 10.5047/forma.2018.002
Subject(s) - space (punctuation) , k nearest neighbors algorithm , mathematics , geography , computer science , artificial intelligence , operating system
This paper deals with the nearest neighbor distance in three-dimensional space. The distribution of the nearest neighbor distance is derived for grid and random point patterns. The distance is measured as the Euclidean and rectilinear distances. An application of the nearest neighbor distance can be found in facility location problems. The nearest neighbor distance represents the service level of facility location. The distribution shows how the distance to the nearest facility is distributed in a study region, and is useful for facility location problems in threedimensional space. The distribution of the kth nearest neighbor distance is also derived for the random pattern.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom