Finite Sphere Packing
   HOME
*



picture info

Finite Sphere Packing
In mathematics, the theory of finite sphere packing concerns the question of how a finite number of equally-sized spheres can be most efficiently packed. The question of packing finitely many spheres has only been investigated in detail in recent decades, with much of the groundwork being laid by László Fejes Tóth. The similar problem for infinitely many spheres has a longer history of investigation, from which the Kepler conjecture is most well-known. Atoms in crystal structures can be simplistically viewed as closely-packed spheres and treated as infinite sphere packings thanks to their large number. Sphere packing problems are distinguished between packings in given containers and free packings. This article primarily discusses free packings. Packing and convex hulls In general, a ''packing'' refers to any arrangement of a set of spatially-connected, possibly differently-sized or differently-shaped objects in space such that none of them overlap. In the case of the finite ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Sphere
A sphere () is a Geometry, geometrical object that is a solid geometry, three-dimensional analogue to a two-dimensional circle. A sphere is the Locus (mathematics), set of points that are all at the same distance from a given point in three-dimensional space.. That given point is the centre (geometry), centre of the sphere, and is the sphere's radius. The earliest known mentions of spheres appear in the work of the Greek mathematics, ancient Greek mathematicians. The sphere is a fundamental object in many fields of mathematics. Spheres and nearly-spherical shapes also appear in nature and industry. Bubble (physics), Bubbles such as soap bubbles take a spherical shape in equilibrium. spherical Earth, The Earth is often approximated as a sphere in geography, and the celestial sphere is an important concept in astronomy. Manufactured items including pressure vessels and most curved mirrors and lenses are based on spheres. Spheres rolling, roll smoothly in any direction, so mos ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Regular Octahedron
In geometry, an octahedron (plural: octahedra, octahedrons) is a polyhedron with eight faces. The term is most commonly used to refer to the regular octahedron, a Platonic solid composed of eight equilateral triangles, four of which meet at each vertex. A regular octahedron is the dual polyhedron of a cube. It is a rectified tetrahedron. It is a square bipyramid in any of three orthogonal orientations. It is also a triangular antiprism in any of four orientations. An octahedron is the three-dimensional case of the more general concept of a cross polytope. A regular octahedron is a 3-ball in the Manhattan () metric. Regular octahedron Dimensions If the edge length of a regular octahedron is ''a'', the radius of a circumscribed sphere (one that touches the octahedron at all vertices) is :r_u = \frac a \approx 0.707 \cdot a and the radius of an inscribed sphere (tangent to each of the octahedron's faces) is :r_i = \frac a \approx 0.408\cdot a while the midradius, which t ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Geometry Of Numbers
Geometry of numbers is the part of number theory which uses geometry for the study of algebraic numbers. Typically, a ring of algebraic integers is viewed as a lattice in \mathbb R^n, and the study of these lattices provides fundamental information on algebraic numbers. The geometry of numbers was initiated by . The geometry of numbers has a close relationship with other fields of mathematics, especially functional analysis and Diophantine approximation, the problem of finding rational numbers that approximate an irrational quantity. Minkowski's results Suppose that \Gamma is a lattice in n-dimensional Euclidean space \mathbb^n and K is a convex centrally symmetric body. Minkowski's theorem, sometimes called Minkowski's first theorem, states that if \operatorname (K)>2^n \operatorname(\mathbb^n/\Gamma), then K contains a nonzero vector in \Gamma. The successive minimum \lambda_k is defined to be the inf of the numbers \lambda such that \lambda K contains k linearly independ ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Mixed Volume
In mathematics, more specifically, in convex geometry, the mixed volume is a way to associate a non-negative number to an of convex bodies in space. This number depends on the size and shape of the bodies and on their relative orientation to each other. Definition Let K_1, K_2, \dots, K_r be convex bodies in \mathbb^n and consider the function : f(\lambda_1, \ldots, \lambda_r) = \mathrm_n (\lambda_1 K_1 + \cdots + \lambda_r K_r), \qquad \lambda_i \geq 0, where \text_n stands for the n-dimensional volume and its argument is the Minkowski sum of the scaled convex bodies K_i. One can show that f is a homogeneous polynomial of degree n, therefore it can be written as : f(\lambda_1, \ldots, \lambda_r) = \sum_^r V(K_, \ldots, K_) \lambda_ \cdots \lambda_, where the functions V are symmetric. For a particular index function j \in \^n , the coefficient V(K_, \dots, K_) is called the mixed volume of K_, \dots, K_. Properties * The mixed volume is uniquely determined by the ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Claude Ambrose Rogers
Claude Ambrose Rogers FRS (1 November 1920 – 5 December 2005) was an English mathematician who worked in analysis and geometry. Research Much of his work concerns the Geometry of Numbers, Hausdorff Measures, Analytic Sets, Geometry and Topology of Banach Spaces, Selection Theorems and Finite-dimensional Convex Geometry. In the theory of Banach spaces and summability, he proved the Dvoretzky–Rogers lemma and the Dvoretzky–Rogers theorem, both with Aryeh Dvoretzky. He constructed a counterexample to a conjecture related to the Busemann–Petty problem. In the geometry of numbers, the Rogers bound is a bound for dense packings of spheres. Awards and honours Rogers was elected a Fellow of the Royal Society (FRS) in 1959. He won the London Mathematical Society's De Morgan Medal in 1977. Personal life Rogers was married to children's writer Joan North Joan Marian North (15 February 1920 – 1999) was a UK writer of children's books. Although set in the cont ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Minkowski Addition
In geometry, the Minkowski sum (also known as dilation) of two sets of position vectors ''A'' and ''B'' in Euclidean space is formed by adding each vector in ''A'' to each vector in ''B'', i.e., the set : A + B = \. Analogously, the Minkowski difference (or geometric difference) is defined using the complement operation as : A - B = \left(A^c + (-B)\right)^c In general A - B \ne A + (-B). For instance, in a one-dimensional case A = 2, 2/math> and B = 1, 1/math> the Minkowski difference A - B = 1, 1/math>, whereas A + (-B) = A + B = 3, 3 In a two-dimensional case, Minkowski difference is closely related to erosion (morphology) in image processing. The concept is named for Hermann Minkowski. Example For example, if we have two sets ''A'' and ''B'', each consisting of three position vectors (informally, three points), representing the vertices of two triangles in \mathbb^2, with coordinates :A = \ and :B = \ then their Minkowski sum is :A + B = \ which comp ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Steiner's Formula
In mathematics, more specifically, in convex geometry, the mixed volume is a way to associate a non-negative number to an of convex bodies in space. This number depends on the size and shape of the bodies and on their relative orientation to each other. Definition Let K_1, K_2, \dots, K_r be convex bodies in \mathbb^n and consider the function : f(\lambda_1, \ldots, \lambda_r) = \mathrm_n (\lambda_1 K_1 + \cdots + \lambda_r K_r), \qquad \lambda_i \geq 0, where \text_n stands for the n-dimensional volume and its argument is the Minkowski sum of the scaled convex bodies K_i. One can show that f is a homogeneous polynomial of degree n, therefore it can be written as : f(\lambda_1, \ldots, \lambda_r) = \sum_^r V(K_, \ldots, K_) \lambda_ \cdots \lambda_, where the functions V are symmetric. For a particular index function j \in \^n , the coefficient V(K_, \dots, K_) is called the mixed volume of K_, \dots, K_. Properties * The mixed volume is uniquely determined by ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Brunn–Minkowski Theorem
In mathematics, the Brunn–Minkowski theorem (or Brunn–Minkowski inequality) is an inequality relating the volumes (or more generally Lebesgue measures) of compact subsets of Euclidean space. The original version of the Brunn–Minkowski theorem ( Hermann Brunn 1887; Hermann Minkowski 1896) applied to convex sets; the generalization to compact nonconvex sets stated here is due to Lazar Lyusternik (1935). Statement Let ''n'' ≥ 1 and let ''μ'' denote the Lebesgue measure on R''n''. Let ''A'' and ''B'' be two nonempty compact subsets of R''n''. Then the following inequality holds: : \mu (A + B) \geq mu (A) + mu (B), where ''A'' + ''B'' denotes the Minkowski sum: :A + B := \. The theorem is also true in the setting where A, B, A + B are only assumed to be measurable and non-empty.Gardner, Richard J. (2002). "The Brunn–Minkowski inequality". Bull. Amer. Math. Soc. (N.S.) 39 (3): pp. 355–405 (electronic). doi:10.1090/S0273-0979-02-00941-2. . Multiplicative version ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Convex Geometry
In mathematics, convex geometry is the branch of geometry studying convex sets, mainly in Euclidean space. Convex sets occur naturally in many areas: computational geometry, convex analysis, discrete geometry, functional analysis, geometry of numbers, integral geometry, linear programming, probability theory, game theory, etc. Classification According to the Mathematics Subject Classification MSC2010, the mathematical discipline ''Convex and Discrete Geometry'' includes three major branches: * general convexity * polytopes and polyhedra * discrete geometry (though only portions of the latter two are included in convex geometry). General convexity is further subdivided as follows: *axiomatic and generalized convexity *convex sets without dimension restrictions *convex sets in topological vector spaces *convex sets in 2 dimensions (including convex curves) *convex sets in 3 dimensions (including convex surfaces) *convex sets in ''n'' dimensions (including convex hy ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Inradius
In geometry, the incircle or inscribed circle of a triangle is the largest circle that can be contained in the triangle; it touches (is tangent to) the three sides. The center of the incircle is a triangle center called the triangle's incenter. An excircle or escribed circle of the triangle is a circle lying outside the triangle, tangent to one of its sides and tangent to the extensions of the other two. Every triangle has three distinct excircles, each tangent to one of the triangle's sides. The center of the incircle, called the incenter, can be found as the intersection of the three internal angle bisectors. The center of an excircle is the intersection of the internal bisector of one angle (at vertex , for example) and the external bisectors of the other two. The center of this excircle is called the excenter relative to the vertex , or the excenter of . Because the internal bisector of an angle is perpendicular to its external bisector, it follows that the center of the in ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Cylinder
A cylinder (from ) has traditionally been a three-dimensional solid, one of the most basic of curvilinear geometric shapes. In elementary geometry, it is considered a prism with a circle as its base. A cylinder may also be defined as an infinite curvilinear surface in various modern branches of geometry and topology. The shift in the basic meaning—solid versus surface (as in ball and sphere)—has created some ambiguity with terminology. The two concepts may be distinguished by referring to solid cylinders and cylindrical surfaces. In the literature the unadorned term cylinder could refer to either of these or to an even more specialized object, the ''right circular cylinder''. Types The definitions and results in this section are taken from the 1913 text ''Plane and Solid Geometry'' by George Wentworth and David Eugene Smith . A ' is a surface consisting of all the points on all the lines which are parallel to a given line and which pass through a fixed plane curve in a p ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Tetrahedron
In geometry, a tetrahedron (plural: tetrahedra or tetrahedrons), also known as a triangular pyramid, is a polyhedron composed of four triangular faces, six straight edges, and four vertex corners. The tetrahedron is the simplest of all the ordinary convex polyhedra and the only one that has fewer than 5 faces. The tetrahedron is the three-dimensional case of the more general concept of a Euclidean simplex, and may thus also be called a 3-simplex. The tetrahedron is one kind of pyramid, which is a polyhedron with a flat polygon base and triangular faces connecting the base to a common point. In the case of a tetrahedron the base is a triangle (any of the four faces can be considered the base), so a tetrahedron is also known as a "triangular pyramid". Like all convex polyhedra, a tetrahedron can be folded from a single sheet of paper. It has two such nets. For any tetrahedron there exists a sphere (called the circumsphere) on which all four vertices lie, and another sphere ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]