Evaluation of pairwise distances among points forming a regular orthogonal grid in a hypercube

Loading...
Thumbnail Image
Date
2018-09-21
ORCID
Advisor
Referee
Mark
Journal Title
Journal ISSN
Volume Title
Publisher
VGTU Press
Altmetrics
Abstract
Cartesian grid is a basic arrangement of points that form a regular orthogonal grid (ROG). In some applications, it is needed to evaluate all pairwise distances among ROG points. This paper focuses on ROG discretization of a unit hypercube of arbitrary dimension. A method for the fast enumeration of all pairwise distances and their counts for a high number of points arranged into high-dimensional ROG is presented. The proposed method exploits the regular and collapsible pattern of ROG to reduce the number of evaluated distances. The number of unique distances is identified and frequencies are determined using combinatorial rules. The measured computational speed-up compared to a nave approach corresponds to the presented theoretical analysis. The proposed method and algorithm may find applications in various fields. The paper shows application focused on the behaviour of various distance measures with the motivation to find the lower bounds on the criteria of point distribution uniformity in Monte Carlo integration.
Description
Citation
Journal of civil engineering and management. 2018, vol. 24, issue 5, p. 410-423.
https://www.tede.vgtu.lt/index.php/JCEM/article/view/5189
Document type
Peer-reviewed
Document version
Accepted version
Date of access to the full text
Language of document
en
Study field
Comittee
Date of acceptance
Defence
Result of defence
Document licence
Creative Commons Attribution 4.0 International
http://creativecommons.org/licenses/by/4.0/
Citace PRO