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 o...
Main Authors: | Václav Sadílek, Miroslav Vořechovský |
---|---|
Format: | Article |
Language: | English |
Published: |
Vilnius Gediminas Technical University
2018-09-01
|
Series: | Journal of Civil Engineering and Management |
Subjects: | |
Online Access: | https://www.tede.vgtu.lt/index.php/JCEM/article/view/5189 |
Similar Items
-
Analysis of Geographic and Pairwise Distances among Chinese Cashmere Goat Populations
by: Jian-Bin Liu, et al.
Published: (2013-03-01) -
Fast and accurate estimation of the covariance between pairwise maximum likelihood distances
by: Manuel Gil
Published: (2014-09-01) -
Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes
by: Jing Zhang, et al.
Published: (2019-09-01) -
On extension of pairwise θ-continuous maps
by: S. K. Sen, et al.
Published: (1996-01-01) -
An Asymptotic Existence Theory on Incomplete Mutually Orthogonal Latin Squares
by: van Bommel, Christopher Martin
Published: (2015)