|
Packing Problem
Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to either pack a single container as densely as possible or pack all objects using as few containers as possible. Many of these problems can be related to real-life packaging, storage and transportation issues. Each packing problem has a dual covering problem, which asks how many of the same objects are required to completely cover every region of the container, where objects are allowed to overlap. In a bin packing problem, people are given: * A ''container'', usually a two- or three-dimensional convex region, possibly of infinite size. Multiple containers may be given depending on the problem. * A set of ''objects'', some or all of which must be packed into one or more containers. The set may contain different objects with their sizes specified, or a single object of a fixed dimension that can be used repeatedly. Usually the pa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Covering Problem
In combinatorics and computer science, covering problems are computational problems that ask whether a certain combinatorial structure 'covers' another, or how large the structure has to be to do that. Covering problems are minimization problems and usually integer linear programs, whose dual problems are called packing problems. The most prominent examples of covering problems are the set cover problem, which is equivalent to the hitting set problem, and its special cases, the vertex cover problem and the edge cover problem. Covering problems allow the covering primitives to overlap; the process of covering something with non-overlapping primitives is called decomposition. General linear programming formulation In the context of linear programming, one can think of any minimization linear program as a covering problem if the coefficients in the constraint matrix, the objective function, and right-hand side are nonnegative. More precisely, consider the following general inte ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discrete & Computational Geometry
'' Discrete & Computational Geometry'' is a peer-reviewed mathematics journal published quarterly by Springer. Founded in 1986 by Jacob E. Goodman and Richard M. Pollack, the journal publishes articles on discrete geometry and computational geometry. Abstracting and indexing The journal is indexed in: * ''Mathematical Reviews'' * '' Zentralblatt MATH'' * ''Science Citation Index'' * ''Current Contents ''Current Contents'' is a rapid alerting service database from Clarivate, formerly the Institute for Scientific Information and Thomson Reuters. It is published online and in several different printed subject sections. History ''Current Contents ...'' Notable articles Two articles published in ''Discrete & Computational Geometry'', one by Gil Kalai in 1992 with a proof of a subexponential upper bound on the diameter of a polytope and another by Samuel Ferguson in 2006 on the Kepler conjecture on optimal three-dimensional sphere packing, earned their authors the Fulk ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Close-packing Of Spheres
In geometry, close-packing of equal spheres is a dense arrangement of congruent spheres in an infinite, regular arrangement (or Lattice (group), lattice). Carl Friedrich Gauss proved that the highest average density – that is, the greatest fraction of space occupied by spheres – that can be achieved by a Lattice (group), lattice packing is :\frac \approx 0.74048. The same packing density can also be achieved by alternate stackings of the same close-packed planes of spheres, including structures that are aperiodic in the stacking direction. The Kepler conjecture states that this is the highest density that can be achieved by any arrangement of spheres, either regular or irregular. This conjecture was proven by Thomas Callister Hales, Thomas Hales. The highest density is so far known only for 1, 2, 3, 8, and 24 dimensions. Many crystal structures are based on a close-packing of a single kind of atom, or a close-packing of large ions with smaller ions filling the spaces between t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Circle Packing
In geometry, circle packing is the study of the arrangement of circles (of equal or varying sizes) on a given surface such that no overlapping occurs and so that no circle can be enlarged without creating an overlap. The associated ''packing density'', , of an arrangement is the proportion of the surface covered by the circles. Generalisations can be made to higher dimensions – this is called ''sphere packing'', which usually deals only with identical spheres. The branch of mathematics generally known as "circle packing" is concerned with the geometry and combinatorics of packings of arbitrarily-sized circles: these give rise to discrete analogs of conformal mapping, Riemann surfaces and the like. Densest packing In the two-dimensional Euclidean plane, Joseph Louis Lagrange proved in 1773 that the highest-density lattice packing of circles is the hexagonal packing arrangement, in which the centres of the circles are arranged in a hexagonal lattice (staggered rows, like ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dimension
In physics and mathematics, the dimension of a mathematical space (or object) is informally defined as the minimum number of coordinates needed to specify any point within it. Thus, a line has a dimension of one (1D) because only one coordinate is needed to specify a point on itfor example, the point at 5 on a number line. A surface, such as the boundary of a cylinder or sphere, has a dimension of two (2D) because two coordinates are needed to specify a point on itfor example, both a latitude and longitude are required to locate a point on the surface of a sphere. A two-dimensional Euclidean space is a two-dimensional space on the plane. The inside of a cube, a cylinder or a sphere is three-dimensional (3D) because three coordinates are needed to locate a point within these spaces. In classical mechanics, space and time are different categories and refer to absolute space and time. That conception of the world is a four-dimensional space but not the one that w ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
N-sphere
In mathematics, an -sphere or hypersphere is an - dimensional generalization of the -dimensional circle and -dimensional sphere to any non-negative integer . The circle is considered 1-dimensional and the sphere 2-dimensional because a point within them has one and two degrees of freedom respectively. However, the typical embedding of the 1-dimensional circle is in 2-dimensional space, the 2-dimensional sphere is usually depicted embedded in 3-dimensional space, and a general -sphere is embedded in an -dimensional space. The term ''hyper''sphere is commonly used to distinguish spheres of dimension which are thus embedded in a space of dimension , which means that they cannot be easily visualized. The -sphere is the setting for -dimensional spherical geometry. Considered extrinsically, as a hypersurface embedded in -dimensional Euclidean space, an -sphere is the locus of points at equal distance (the ''radius'') from a given '' center'' point. Its interior, consisting of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sphere
A sphere (from Ancient Greek, Greek , ) is a surface (mathematics), surface analogous to the circle, a curve. In solid geometry, 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 center (geometry), ''center'' of the sphere, and the distance 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 surface 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. The Earth is spherical Earth, 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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Plane (geometry)
In mathematics, a Euclidean plane is a Euclidean space of dimension two, denoted \textbf^2 or \mathbb^2. It is a geometric space in which two real numbers are required to determine the position of each point. It is an affine space, which includes in particular the concept of parallel lines. It has also metrical properties induced by a distance, which allows to define circles, and angle measurement. A Euclidean plane with a chosen Cartesian coordinate system is called a '' Cartesian plane''. The set \mathbb^2 of the ordered pairs of real numbers (the real coordinate plane), equipped with the dot product, is often called ''the'' Euclidean plane or ''standard Euclidean plane'', since every Euclidean plane is isomorphic to it. History Books I through IV and VI of Euclid's Elements dealt with two-dimensional geometry, developing such notions as similarity of shapes, the Pythagorean theorem (Proposition 47), equality of angles and areas, parallelism, the sum of the angles ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Circle
A circle is a shape consisting of all point (geometry), points in a plane (mathematics), plane that are at a given distance from a given point, the Centre (geometry), centre. The distance between any point of the circle and the centre is called the radius. The length of a line segment connecting two points on the circle and passing through the centre is called the diameter. A circle bounds a region of the plane called a Disk (mathematics), disc. The circle has been known since before the beginning of recorded history. Natural circles are common, such as the full moon or a slice of round fruit. The circle is the basis for the wheel, which, with related inventions such as gears, makes much of modern machinery possible. In mathematics, the study of the circle has helped inspire the development of geometry, astronomy and calculus. Terminology * Annulus (mathematics), Annulus: a ring-shaped object, the region bounded by two concentric circles. * Circular arc, Arc: any Connected ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Circle Packing
In geometry, circle packing is the study of the arrangement of circles (of equal or varying sizes) on a given surface such that no overlapping occurs and so that no circle can be enlarged without creating an overlap. The associated ''packing density'', , of an arrangement is the proportion of the surface covered by the circles. Generalisations can be made to higher dimensions – this is called ''sphere packing'', which usually deals only with identical spheres. The branch of mathematics generally known as "circle packing" is concerned with the geometry and combinatorics of packings of arbitrarily-sized circles: these give rise to discrete analogs of conformal mapping, Riemann surfaces and the like. Densest packing In the two-dimensional Euclidean plane, Joseph Louis Lagrange proved in 1773 that the highest-density lattice packing of circles is the hexagonal packing arrangement, in which the centres of the circles are arranged in a hexagonal lattice (staggered rows, like ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Circle Packing Theorem
The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane whose interiors are disjoint. A circle packing is a connected collection of circles (in general, on any Riemann surface) whose interiors are disjoint. The intersection graph of a circle packing is the graph having a vertex (graph theory), vertex for each circle, and an edge (graph theory), edge for every pair of circles that are tangent circles, tangent. If the circle packing is on the plane, or, equivalently, on the sphere, then its intersection graph is called a coin graph; more generally, intersection graphs of interior-disjoint geometric objects are called tangency graphs or contact graphs. Coin graphs are always connected, simple graph, simple, and planar graph, planar. The circle packing theorem states that these are the only requirements for a graph to be a coin graph: Circle packing theorem: For every finite connected ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
