Name
Abstract | ||
|---|---|---|
The concept of Procrustes distance is applied to the shape analysis of the Delaunay simplexes. Procrustes distance provides a measure of coincidence of two point sets {xi} and {yi}, i=1..N. For this purpose the variance of point deviations is calculated at the optimal superposition of the sets. It allows to characterize the shape proximity of a given simplex to shape of a reference one, e.g. to the shape of the regular tetrahedron. This approach differs from the method used in physics, where the variations of edge lengths are calculated in order to characterize the simplex shape. We compare both methods on an example of structure analysis of dense packings of hard spheres. The method of Procrustes distance reproduces known structural results; however, it allows to distinguish more details because it deals with simplex vertices, which define the simplex uniquely, in contrast to simplex edges. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ISVD.2006.10 | Banff, Alberta, BC |
Keywords | Field | DocType |
shape proximity,simplex shape,structure analysis,dense packing,shape analysis,procrustes distance,delaunay simplex,simplex vertex,delaunay simplexes,point set,point deviation,crystallization,computer science,computational geometry,physics,mesh generation,combustion,application software,length measurement,kinetic theory,chemical analysis,regular tetrahedron | Combinatorics,Vertex (geometry),Computational geometry,Simplex,Hard spheres,Tetrahedron,Mathematics,Delaunay triangulation,Shape analysis (digital geometry),Procrustes | Conference |
ISBN | Citations | PageRank |
0-7695-2630-6 | 1 | 0.60 |
References | Authors | |
4 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. V. Anikeenko | 1 | 6 | 3.44 |
| N. N. Medvedev | 2 | 1 | 0.60 |
| M. L. Gavrilova | 3 | 58 | 8.23 |