When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Interstitial site - Wikipedia

    en.wikipedia.org/wiki/Interstitial_site

    The tetrahedral void is smaller in size and could fit an atom with a radius 0.225 times the size of the atoms making up the lattice. An octahedral void could fit an atom with a radius 0.414 times the size of the atoms making up the lattice. [1] An atom that fills this empty space could be larger than this ideal radius ratio, which would lead to ...

  3. List of voids - Wikipedia

    en.wikipedia.org/wiki/List_of_voids

    It was the first void to be discovered and is approximately 1/3 as far away as the much larger Boötes Void. [10] Corona Borealis Void: Eridanus Void: This void is separated from the Sculptor void by a sheet of galaxies. [11] Eridanus Supervoid (Great Void) 03 h 15 m 05 s −19° 35′ 02″ z=1 150 Mpc

  4. Close-packing of equal spheres - Wikipedia

    en.wikipedia.org/wiki/Close-packing_of_equal_spheres

    The distance between the centers along the shortest path namely that straight line will therefore be r 1 + r 2 where r 1 is the radius of the first sphere and r 2 is the radius of the second. In close packing all of the spheres share a common radius, r. Therefore, two centers would simply have a distance 2r.

  5. Tetrahedron - Wikipedia

    en.wikipedia.org/wiki/Tetrahedron

    Any two opposite edges of a tetrahedron lie on two skew lines, and the distance between the edges is defined as the distance between the two skew lines. Let d {\displaystyle d} be the distance between the skew lines formed by opposite edges a {\displaystyle a} and b − c {\displaystyle \mathbf {b} -\mathbf {c} } as calculated here .

  6. Delaunay triangulation - Wikipedia

    en.wikipedia.org/wiki/Delaunay_triangulation

    The Delaunay triangulation is a geometric spanner: In the plane (d = 2), the shortest path between two vertices, along Delaunay edges, is known to be no longer than 1.998 times the Euclidean distance between them. [7]

  7. Sphere packing - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing

    Here there is a choice between separating the spheres into regions of close-packed equal spheres, or combining the multiple sizes of spheres into a compound or interstitial packing. When many sizes of spheres (or a distribution) are available, the problem quickly becomes intractable, but some studies of binary hard spheres (two sizes) are ...

  8. Minkowski distance - Wikipedia

    en.wikipedia.org/wiki/Minkowski_distance

    The Minkowski distance can also be viewed as a multiple of the power mean of the component-wise differences between and . The following figure shows unit circles (the level set of the distance function where all points are at the unit distance from the center) with various values of :

  9. Truncated triangular pyramid number - Wikipedia

    en.wikipedia.org/wiki/Truncated_Triangular...

    A pyramid with side length 5 contains 35 spheres. Each layer represents one of the first five triangular numbers. A truncated triangular pyramid number [1] is found by removing some smaller tetrahedral number (or triangular pyramidal number) from each of the vertices of a bigger tetrahedral number.