A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Evaluation of pairwise distances among points forming a regular orthogonal grid in a hypercube
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 naïve 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.
Evaluation of pairwise distances among points forming a regular orthogonal grid in a hypercube
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 naïve 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.
Evaluation of pairwise distances among points forming a regular orthogonal grid in a hypercube
Václav Sadílek (author) / Miroslav Vořechovský (author)
2018
Article (Journal)
Electronic Resource
Unknown
Metadata by DOAJ is licensed under CC BY-SA 1.0
Isorange Pairwise Orthogonal Transform
| Online Contents | 2015
Image Processing and Analysis - Pairwise Orthogonal Transform for Spectral Image Coding
| Online Contents | 2011
Evaluation for forming at T–shaped forming points during press forming
| British Library Online Contents | 1991
Hypercube Point Concentrations Sampling Technique
| British Library Conference Proceedings | 2006
Nested maximin Latin hypercube designs
| British Library Online Contents | 2010