Convexgeometry is the branch of geometry studying convex set s, mainly in Euclidean space . Convex sets occur naturally in many areas of mathematics computational geometry , convex analysis , discrete geometry , functional analysis , geometry of numbers , integral geometry , linear programming , probability ... branches of the mathematical discipline Convex and Discrete Geometry are General Convexity , Polytopes and Polyhedra , Discrete Geometry. Further classification of General Convexity results in the following list 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 hypersurfaces finite dimensional Banach spaces random convex sets and integral geometry asymptotic theory of convex ... programs spherical and hyperbolic convexity The phrase convexgeometry is also used in combinatorics ... geometry is a relatively young mathematical discipline. Although the first known contributions to convex ... Fenchel W. Fenchel gave a comprehensive survey of convexgeometry in Euclidean space R sup n sup . Further development of convexgeometry in the 20th century and its relations to numerous mathematical disciplines are summarized in the Handbook of convexgeometry edited by P. M. Gruber and J. M. Wills. See also List of convexity topics References Expository articles on convexgeometry K. Ball, An elementary introduction to modern convexgeometry, in Flavors of Geometry, pp. 1 58, Math. Sci ... of convexgeometry. Vol. A. B, North Holland, Amsterdam, 1993. R. Schneider, Convex bodies the Brunn ... on history of convexgeometry W. Fenchel, Convexity through the ages, Danish Danish Mathematical ... , Handbook of convexgeometry. Vol. A, pp. 1 15, North Holland, Amsterdam, 1993. Category Convexgeometry ar de Konvexgeometrie es Geometr a convexa ... more details
Image Convex polygon illustration1.png right thumb A convex set. wiktionary convex The word convex means curving out or bulging outward , as opposed to Concave disambiguation concave . Convex or convexity may refer to Mathematics Convex set , a set of points containing all line segments between each pair of its points Convex function , a function with the Epigraph mathematics epigraph forming a convex set Convex polytope , a polytope which forms a convex set. These include convex polygon s. Convex hull , the minimal convex set containing a set of points X Convex combination , a linear combination of points with non negative coefficients that sum up to 1 Convex conjugate , a generalization of the Legendre transformation Convex bipartite graph , a special kind of bipartite graph Convex plane graph , a plane graph with convex faces Convex optimization Economics Convex preferences , a preference relation with convex upper contour sets Finance Bond convexity , a measure of the sensitivity of the price of a bond to changes in interest rates Optics Convex lens , a lens with surfaces that curve outward Art Convex and Concave , a lithograph print by the artist M. C. Escher Proper names Convex Computer , a company that produced a number of vector supercomputers, bought by HP in 1995 Convex Software Library , a client side open source solution for Internet Explorer which uses a hidden Java applet to process XForms See also Concave disambiguation , the opposite of convex List of convexity topics Obtuse angle disambig cs Konvexn de Konvex it Convesso ja ro Convexitate fi Konveksisuus sv Konvex ... more details
shapes, such as lines or spheres. Projective geometry Projective , Convexgeometryconvex and discrete ... closely connected with computational geometry , computer graphics , convexgeometry , discrete geometry ... theorem , an important result in Euclidean geometry Euclidean and projective geometry . Image Oxyrhynchus ... fragment of Euclid s Elements Geometry lang grc wikt geo earth , wikt metri measurement ... position of figures, and the properties of space. Geometry is one of the oldest mathematical sciences ... century BC geometry was put into an axiomatic system axiomatic form by Euclid , whose treatment Euclidean geometry set a standard for many centuries to follow. Archimedes developed ingenious techniques ... of geometry is called a geometer. The introduction of coordinates by Ren Descartes and the concurrent development of algebra marked a new stage for geometry, since geometric figures, such as plane curve s, could now be represented analytic geometry analytically , i.e., with functions and equations ..., the theory of perspective graphical perspective showed that there is more to geometry than just the metric properties of figures perspective is the origin of projective geometry . The subject of geometry ... with Euler and Carl Friedrich Gauss Gauss and led to the creation of topology and differential geometry .... Since the 19th century discovery of non Euclidean geometry , the concept of space has undergone a radical ... space , point etc. still have their intuitive meaning and abstract spaces. Contemporary geometry ... structure, allowing one to speak about length. Modern geometry has multiple strong bonds with physics , exemplified by the ties between pseudo Riemannian geometry and general relativity . One of the youngest ... of geometry makes it initially more accessible than other parts of mathematics, such as algebra or number ... provenance for example, in fractal geometry and algebraic geometry . ref It is quite common in algebraic geometry to speak about geometry of algebraic variety algebraic varieties over finite field ... more details
In mathematics , a convex body in n dimension al Euclidean space R sup n sup is a compact space compact convex set with non empty set empty interior topology interior . A convex body K is called symmetric if it is centrally symmetric with respect to the origin, i.e. a point x lies in K if and only if its antipode , &minus x , also lies in K . Symmetric convex bodies are in a bijection one to one correspondence with the unit ball s of norm mathematics norms on R sup n sup . Important examples of convex bodies are the Euclidean ball , the hypercube and the cross polytope . References cite journal last Gardner first Richard J. title The Brunn Minkowski inequality journal Bulletin of the American Mathematical Society Bull. Amer. Math. Soc. N.S. volume 39 issue 3 year 2002 pages 355&ndash 405 electronic doi 10.1090 S0273 0979 02 00941 2 Category Geometry es Cuerpo convexo ... more details
Unreferenced date December 2009 Image Convex combination illustration.svg right thumb Given three points math x 1, x 2, x 3 math in a plane as shown in the figure, the point math P math is a convex combination of the three points, while math Q math is not. br math Q math is however an affine combination of the three points, as their affine hull is the entire plane. A convex combination is a linear combination of point geometry points which can be vector geometric vector s, scalar mathematics scalars , or more generally points in an affine space where all coefficients are non negative and sum up to 1. All possible convex combinations will be within the convex hull of the given points. In fact, the collection of all such convex combinations of points in the set constitutes the set s convex hull ... space , a convex combination of these points is a point of the form math alpha 1x 1 alpha 2x 2 cdots ... alpha 1 alpha 2 cdots alpha n 1. math As a particular example, every convex combination of two points ... that are not closed under linear combinations but that are closed under convex combinations. For example, the interval math 0,1 math is convex but generates the real number line under linear combinations. Another example is the convex set of probability distribution s, as linear combinations preserve neither nonnegativity nor affinity i.e., having total integral one . Other objects A convex combination ..., conical, and convex combinations A conical combination is a linear combination with nonnegative coefficients Weighted mean s are functionally the same as convex combinations, but they use a different ... instead the sum is explicitly divided from the linear combination. Affine combination s are like convex ... s theorem convex hull Conical combination convex hull Conical combination Nonnegative linear combination Simplex DEFAULTSORT Convex Combination Category Convexgeometry Category Mathematical analysis Category Convex hulls es Combinaci n convexa fr Combinaison convexe it Combinazione convessa pl Kombinacja ... more details
, a solid cube geometry cube is convex, but anything that is hollow or has a dent in it, for example, a crescent shape, is not convex. The notion can be generalized to other spaces as described below. In vector spaces Image Convex supergraph.png right thumb A convex function function is convex if and only if the region in green above its graph of a function graph in blue is a convex set. Let ... other properties of convex sets are valid as well. Non Euclidean geometry The definition of a convex set and a convex hull extends naturally to non Euclidean geometry by defining a geodesic convexity ... of abstract convexity, more suited to discrete geometry , see the convex geometries associated ... geometry Category Mathematical analysis Category Convex analysis ar ca Conjunt convex ...Image Convex polygon illustration1.png right thumb alt Illustration of a convex set, which looks somewhat like a disk A green convex set contains the black line segment joining the points x and y. The entire line segment lies in the interior of the convex set A convex set. Image Convex polygon illustration2.png right thumb alt Illustration of a non convex set, which looks somewhat like a boomerang or wedge. A green non convexconvex set contains the black line segment joining the points x and y. Part of the line segment lies outside of the green non convex set. A non convex set, with a line segment outside the set. In Euclidean space , an object is convex if for every pair of points within the object ... spaces. A set mathematics set C in S is said to be convex if, for all x and y in C and all ... point on the line segment connecting x and y is in C . This implies that a convex set in a real ... connected . A set C is called absolutely convex if it is convex and balanced set balanced . The convex subset s of R the set of real numbers are simply the intervals of R . Some examples of convex ... of constant width . Some examples of convex subsets of Euclidean space Euclidean 3 space are the Archimedean ... more details
In mathematics , a convex graph may be a convex bipartite graph a convex plane graph the graph of a function graph of a convex function disambig ... more details
texts in discrete geometry , convex polytopes are often simply called polytopes . Gr nbaum points out that this is solely to avoid the endless repetition of the word convex , and that the discussion should throughout be understood as applying only to the convex variety. A polytope is called full dimensional ... over other fields . The face lattice A Face geometry face of a convex polytope is any intersection of the polytope ... computation FAQ . DEFAULTSORT Convex Polytope Category Polytopes Category Convexgeometry ...Image 3dpoly.svg thumb right A 3 dimensional convex polytope A convex polytope is a special case of a polytope , having the additional property that it is also a convex set of points in the n dimensional space R sup n sup . ref name grun Some authors use the terms convex polytope and convex polyhedron ...?id ofrBsl61lq8C&pg PA67&dq 22unbounded convex polyhedron 22&sig ACfU3U1Yv3iG XIn3hiuh84nK2e8UIcdAA ... convex polytope will be used below whenever the boundedness is critical to the discussed issue. Yet other texts treat a convex n polytope as a surface or n 1 manifold. Convex polytopes play an important ... . A comprehensive and influential book in the subject, called Convex Polytopes , was published ... of bounded convex polytopes can be found in the article polyhedron . In the 2 dimensional case ... the intersection of two non parallel half planes , a shape defined by a convex polygonal chain with two ray geometry ray s attached to its ends, and a convex polygon . Special cases of an unbounded convex polytope are a slab between two parallel hyperplanes, a wedge defined by two non parallel half space s, a polyhedral cylinder infinite prism geometry prism , and a polyhedral cone infinite prism geometry prism , defined by three or more half spaces passing through a common point. Definitions A convex polytope may be defined in a number of ways, depending on what is more suitable for the problem at hand. Gr nbaum s definition is in terms of a convex set of points in space. Other important ... more details
Convex Cone Category Convex analysis Category Geometry nl Convexe kegel pl Sto ek wypuk y vi ...Unreferenced date December 2009 In linear algebra , a convex cone is a subset of a vector space that is closure mathematics closed under linear combination s with positive coefficients. Image Convex cone illust.svg right thumb A convex cone light blue . Inside of it, the light red convex cone consists ... symbolize that the regions are infinite in extent. Definition A subset C of a vector space V is a convex ... vector space 0 are convex cones by this definition. Other examples are the set of all positive multiples ... is a positive scalar and x is an element of some convex set convex subset X of V . In particular ... gives an open resp. closed convex circular cone . Convex cones are closed under intersection ..., if C is a convex cone, so is its opposite C and C math cap math C is the largest linear subspace contained in C . Convex cones are linear cones If C is a convex cone, then for any positive scalar and any x in C the vector x 2 x 2 x is in C . It follows that a convex cone C is a special ... that a convex cone can also be defined as a linear cone that is closed under convex combination s, or just under addition s. More succinctly, a set C is a convex cone if and only if C C and C ... , in the definition of convex cone by non negative scalars , , not both zero . Blunt and pointed cones According to the above definition, if C is a convex cone, then C math cup math 0 is a convex cone, too. A convex cone is said to be pointed or blunt depending on whether it includes the null vector 0 or not. Blunt cones can be excluded from the definition of convex cone by substituting ... open or closed are convex cones. Moreover, any convex cone C that is not the whole space V must be contained in some closed half space H of V . In fact, a topologically closed convex cone is the intersection ... open convex cone. Salient convex cones and perfect half spaces A convex cone is said to be flat ... more details
Convex hull algorithms In computational geometry, a number of algorithms are known for computing the convex ... wikibooks Algorithm Implementation GeometryConvex hull Convex hull MathWorld urlname ConvexHull ...Image Extreme points illustration.png thumb right The convex hull of the red set contains also the blue convex set . In mathematics , the convex hull or convex envelope for a Set mathematics set of points X in a real number real vector space V is the minimal convex set containing X . In computational geometry , a basic problem is finding the convex hull for a given finite nonempty set of points in the plane mathematics plane . It is common to use the term convex hull for the boundary topology boundary of that set, which is a convex polygon , except in the degenerate case that points are collinear . The convex hull is then typically represented by a sequence of the vertices of the line segment ... thumb Convex hull elastic band analogy For planar objects , i.e., lying in the plane, the convex ... object when released, it will assume the shape of the required convex hull. It may seem natural to generalise ... surface in this case may not be the convex hull parts of the resulting surface may have negative curvature ... will spring back under tension to take the form of the convex hull of the points. Existence of the convex hull To show that the convex hull of a set X in a real vector space V exists, notice that X is contained in at least one convex set the whole space V , for example , and any intersection of convex sets containing X is also a convex set containing X . It is then clear that the convex hull is the intersection of all convex sets containing X . This can be used as an alternative definition of the convex hull. The convex hull operator Conv has the characteristic properties of a closure ... idempotent Conv Conv S Conv S . Thus, the convex hull operator is a proper hull operator. Algebraic characterization Algebraically, the convex hull of X can be characterized as the set of all ... more details
wiktionarypar plano convex Plano convex may refer to Plano convex lenses, in optics see Lens optics Types of simple lenses The plano convex type of mudbrick , used by the ancient Sumerians disambig ... more details
Convex analysis is the branch of mathematics devoted to the study of properties of convex function s and convex set s, often with applications in convex optimization convex minimization , a subdomain of optimization mathematics optimization theory . See also List of convexity topics References J. B. Hiriart Urruty, C. Lemar chal , Fundamentals of convex analysis, Springer Verlag, Berlin, 2001. R. T. Rockafellar , Convex analysis, Princeton University Press, Princeton, NJ, 1970. Reprint 1997. cite book last Singer first Ivan title Abstract convex analysis series Canadian Mathematical Society series of monographs and advanced texts publisher John Wiley & Sons, Inc. location New York year 1997 pages xxii 491 isbn 0 471 16015 6 id MR 1461544 J. Stoer, C. Witzgall, Convexity and optimization in finite dimensions. I, Springer, Berlin, 1970. cite book last Z linescu first C. title Convex analysis in general vector spaces publisher World Scientific Publishing Co., Inc River Edge, NJ, 2002 pages xx 367 isbn 981 238 067 1 id MR 1921556 Category Convex analysis Category Mathematical optimization Category Mathematical analysis Category Variational analysis mathanalysis stub fr Analyse convexe nl Convexe analyse ... more details
Image ConvexFunction.svg thumb 300px right Convex function on an interval. Image Epigraph convex.svg right thumb 300px A function in black is convex if and only if the region above its Graph of a function graph in green is a convex set . mergefrom Proper convex function discuss Talk Convex function Proper ... on an interval mathematics interval or on any convex subset of some vector space is called convex , concave upwards , concave up or convex cup , if for any two points math x 1 math and math x 2 math ... 1 t f x 2 . math A function is called strictly convex if math f tx 1 1 t x 2 t f x 1 1 t f x 2 , math ... be defined over a convex set , otherwise the point math tx 1 1 t x 2 , math may not lie in the function ... convex. Pictorially, a function is called convex if the function lies below or on the straight line ... is used A function is convex if its epigraph mathematics epigraph the set of points lying on or above the graph of a function graph is a convex set . These two definitions are equivalent, i.e., one ... of the red line in the above drawing note also that the function R is symmetric in x,y . f is convex ... of convexity is quite useful to prove the following results. A convex function f defined ... is shown in the examples section . A function is midpoint convex on an interval C if math f left ... weaker than convexity. For example, a real valued Lebesgue measurable function that is midpoint convex will be convex. ref Sierpinski Theorem, Donoghue 1969 , http books.google.com books?id P30Y7daiGvQC&pg PA12 p. 12 ref In particular, a continuous function that is midpoint convex will be convex. A differentiable function of one variable is convex on an interval if and only if its derivative is monotonically non decreasing on that interval. If a function is differentiable and convex then it is also continuously differentiable . A continuously differentiable function of one variable is convex ... of f x . A twice differentiable function of one variable is convex on an interval if and only ... more details
Convex optimization , a subfield of optimization mathematics mathematical optimization , studies the problem of minimizing convex function s. Given a real number real vector space math X math together with a convex function convex , real valued function mathematics function math f mathcal X to mathbb R math defined on a convex set convex subset math mathcal X math of math X math , the problem is to find ... of math mathcal X math and math f math makes the powerful tools of convex analysis applicable the Hahn ... that for linear programming , and effective computational methods. Convex minimization has applications ... optimal design , and finance . With recent improvements in computing and in optimization theory, convex minimization is nearly as straightforward as linear programming . Convex optimization has applications beyond minimizing convex functions. Convex optimization is useful also for some obviously maximizing concave functions and for the theory of maximizing convex functions The problem of maximizing a concave function can be re formulated equivalently as a problem of minimizing a convex function. Consider the restriction of a convex function to a compact set compact convex set Then, on that set ... s Convex Analysis states this maximum principle for extended real valued functions. ref Such results ... , and partial differential equation s. Theory The following statements are true about the convex minimization ... is convex. for each strictly convex function, if the function has a minimum, then the minimum is unique. These results are used by the theory of convex minimization along with geometric notions from ... lemma . Standard form Standard form is the usual and most intuitive form of describing a convex minimization problem. It consists of the following three parts A convex function math f x mathbb ... math g i x leq 0 math , where the functions math g i math are convex Equality constraints of the form ... in the form math h i x Ax b math , where math A math is a matrix and math b math is a vector. A convex ... more details
In economics , convex preferences refer to a property of an individual s ordering of various outcomes which roughly corresponds to the idea that averages are better than the extremes . The concept roughly corresponds to marginal utility The law of diminishing marginal utility the law of diminishing marginal utility but uses modern theory to represent the concept without requiring the use of utility function s. Comparable to the greater than or equal to Order theory Partially ordered sets ordering relation math geq math for real numbers, the notation math succeq math below can be translated as is at least as good as in Preference economics preference satisfaction . Use x , y , and z to denote three consumption bundles combinations of various quantities of various goods . Formally, a preference relation P on the consumption set X is Convex set convex if for any math x, y, z in X math where math y succeq x math and math z succeq x math , it is the case that math theta y 1 theta z succeq x math for any math theta in 0,1 math . That is, the preference ordering P is convex if for any two goods bundles that are each viewed as being at least as good as a third bundle, a weighted average of the two bundles is also viewed as being at least as good as the third bundle. Moreover, math P math is strictly convex if for any math x, y, z in X math where math y succeq x math , math z succeq x math ... the preference ordering P is strictly convex if for any two distinct goods bundles that are each ... a positive amount of each bundle is viewed as being better than the third bundle. A set of Convex function convex shaped indifference curve s displays convex preferences Given a convex indifference ... curve is a convex set . Convex preferences with their associated convex indifference mapping arise from Quasi convex function quasi concave utility functions, although these are not necessary for the analysis ... 507340 9 See also Convex function Level set Quasi convex function Semi continuous function Shapley Folkman ... more details
Original research date November 2010 Convex Computer Corporation was a company that developed, manufactured ... Convex was formed in 1982 by Bob Paluck and Steve Wallach in Richardson, Texas . It was originally ... lower performance, but with a much better price performance ratio . In order to lower costs, the Convex ... to their systems. The machines ran a BSD version of Unix known initially as Convex Unix then later ..., and rated at 50 MFLOPS peak for double precision per CPU 100 MFLOPS peak for single precision . It was Convex ..., the C3 and the Convex business model were overtaken by changes in the computer industry. The arrival ... a business in decline. By this time, even though Convex was the first vendor to ship a GaAs based product, they were losing money. In 1994, Convex introduced an entirely new design, known as the Exemplar ... of customers Convex attracted believed in Fortran and brute force rather than sophisticated ... be fixed. Eventually, Convex established a working partnership with HP s hardware and software divisions ... servers. In 1995, Hewlett Packard bought Convex. HP sold Convex Exemplar machines under the S Class ... was sold with the S and X Class products. Culture According to most former employees, Convex was a very ... Convex Beach Party where a truck load of sand would be dumped on the parking lot to simulate a beach ... fun and creativity. Convex had an unusually thorough interview process, which, for technical positions ... employee base who spent most of their waking hours ensuring Convex s success. The culture was one ..., extolling such slogans as What have you done for the customer today? Convex lasted longer than ... of the market, Convex had a graveyard of former competitor companies on its property. ref cite web author Stephanie Anderson Forest title CONVEX WANTS TO BE A FULL FLEDGED HEAVYWEIGHT url http www.businessweek.com archives 1991 b3210058.arc.htm accessdate 2009 05 29 ref Ex employees of Convex jokingly refer to themselves as ex cons . There is a http www.ex convex.org mailing list of Convex ... more details
Contents mostly taken from Legendre transformation . In mathematics , convex conjugation is a generalization ... f X to mathbb R cup infty math taking values on the extended real number line the convex conjugate ... of the convex hull of the function s Epigraph mathematics epigraph in terms of its supporting hyperplane supporting hyperplanes . http maze5.net ?page id 733 Examples The convex conjugate of an affine ... star left x right begin cases b, & x a infty, & x ne a. end cases math The convex conjugate of a power ... math where math tfrac 1 p tfrac 1 q 1. math The convex conjugate of the absolute value function ... x right 1. end cases math The convex conjugate of the exponential function math f x , beta cdot ... , & x 0 0 , & x 0 infty , & x 0. end cases math Convex conjugate and Legendre transform of the exponential function agree except that the domain mathematics domain of the convex conjugate is strictly ... the convex conjugate math begin align f star p int 0 p F 1 q , dq & p 1 F 1 p operatorname E left ..., math f text inc f math for &fnof nondecreasing. Properties The convex conjugate of a closed convex function is again a closed convex function. The convex conjugate of a polyhedral convex function a convex function with Polyhedron polyhedral epigraph mathematics epigraph is again a polyhedral convex function. Convex conjugation is Order theory order reversing if math f le g math then math f ge g math . Here math f le g iff forall x, f x le g x . math Biconjugate The convex conjugate of a function is always lower semi continuous . The biconjugate math f math the convex conjugate of the convex conjugate is also the closed convex hull , i.e. the largest lower semi continuous convex function with math f le f math . For Proper convex function proper functions f , f f sup sup if and only if f is convex and lower semi continuous. Fenchel s inequality For any function f and its convex conjugate ... properties Convex conjugation has the following scaling properties math f x a cdot g x Rightarrow ... more details
Refimprove date May 2010 No footnotes date May 2010 Artwork image file Convex and Concave.JPG title Convex and Concave artist M. C. Escher year 1955 type Lithography lithograph height 27.5 width 33.5 Convex and Concave is a Lithography lithograph print by the Netherlands Dutch artist M. C. Escher , first printed in March 1955. It depicts an ornate architectural structure with many stairs, pillars and other shapes. The relative aspects of the objects in the image are distorted in such a way that many of the structure s features can be seen as both convex shapes and concave impressions. This is a very good example of Escher s mastery in creating illusion of Impossible Architectures . The window s, roads, stairs and other shapes can be perceived as opening out in seemingly impossible ways and positions. The trick of using the cubes that appear as the motif in the Flag on right half of this print is easily identified. One can view these features as concave by viewing the image upside down. Note that all additional elements and decoration on the left are consistent with a viewpoint from above, while those on the right with a viewpoint from below hiding half the image makes it very easy to switch between convex and concave. See also Printmaking Sources Locher, J.L. 2000 . The Magic of M. C. Escher . Harry N. Abrams, Inc. ISBN 0 8109 6720 0. M. C. Escher Category Works by M. C. Escher Category 1955 works printmaking stub he ... more details
object. Discrete geometry has large overlap with convexgeometry and computational geometry , and is closely related to subjects such as finite geometry , combinatorial optimization , digital geometry , discrete differential geometry , geometric graph theory , toric geometry , and combinatorial topology ... geometry Polyhedron Polyhedra and polytope s Polyhedral combinatorics Convex lattice polytope Lattice ... and Computational Geometry, Second Edition publisher Chapman & Hall CRC location Boca Raton year 2004 isbn 1 58488 301 4 cite book author Gruber, Peter M. title Convex and Discrete Geometry publisher ... redirect3 Combinatorial geometry The term combinatorial geometry is also used in the theory of matroid s to refer to a simple matroid , especially in older texts Discrete geometry and combinatorial geometry are branches of geometry that study Combinatorics combinatorial properties and constructive methods of discrete mathematics discrete geometric objects. Most questions in discrete geometry involve ... geometry point s, line geometry lines , plane geometry plane s, circle s, sphere s, polygon ... Kepler Kepler , and Augustin Louis Cauchy Cauchy , modern discrete geometry has its origins ... Thue , projective configuration s by Reye and Ernst Steinitz Steinitz , the geometry of numbers by Minkowski ... Graphs Geometry Structural rigidity and flexibility Cauchy s theorem geometry Cauchy s theorem Flexible polyhedron Flexible polyhedra Incidence structure s Configuration geometry Configurations ... s Reflection group s Triangle group s Digital geometry Discrete differential geometry Geometric set partitioning and transversals See also Discrete and Computational Geometry Discrete mathematics Paul Erd s References cite book author Bezdek, Andr s Kuperberg, W. title Discrete geometry in honor of W ... 3 cite book author K roly Bezdek Bezdek, K roly title Classical Topics in Discrete Geometry publisher ... BraB, Peter title Research problems in discrete geometry publisher Springer location Berlin year 2005 ... more details
Image Hypercube.svg thumb The tesseract has 8 cubic cells, three per edge. Image Partial cubic honeycomb.png thumb The cubic honeycomb as shown by this 2x2x2 portion has four cube cubic cells per edge. In geometry , a cell is a three dimension al element that is part of a higher dimensional object. In polytopes A cell is a three dimension al polyhedron element that is part of the boundary of a higher dimensional polytope , such as a polychoron 4 polytope or convex uniform honeycomb honeycomb 3 space tessellation . For example, a cubic honeycomb is made of cube cubic cells, with 4 cubes on each edge. A tesseract is also made of cubic cells, but only has 3 cubes on each edge. In polychoron names Regular convex polychoron Regular convex polychora are sometimes named by how many cells they contain, just like n gon and n hedron are used as a shorthand for polygon al and Polyhedron polyhedral names. For example, the tesseract can also be called an octachoron or an 8 cell because it contains 8 cubic cells. See also Face geometry the two dimensional element analogue of cells for Polyhedron polyhedra and List of uniform planar tilings planar tilings . Facet geometry as the highest dimensional subelements in a 4 polytope or 3 space tessellation, and 3 faces more systematically. Hypercell s, or more clearly 4 faces , are four dimensional elements 5 polytope s and higher . Systematically n faces are elements in n 1 polytopes and higher. Cell complex External links GlossaryForHyperspace anchor Cell title Cell mathworld urlname Cell title Cell An incorrect definition a finite regular polytope Category Geometry Category Polytopes Category Honeycombs geometry Polyhedron stub cs Nadst na es Celda geometr a eo elo geometrio fr Cellule g om trie sv Cell geometri zh ... more details
geometry Category Convexgeometry Category Polyhedra ar ca Cara superf cie cs St na ...Image Tile 4,4.svg thumb Square tiling four square geometry square faces per vertex Image hexahedron.png thumb cube three square geometry square faces per vertex In geometry , a face of a polyhedron is any of the polygons that make up its boundaries. For example, any of the square geometry square s that bound a cube is a face of the cube. The suffix hedron is derived from the Greek word hedra which means face . Sometimes, in the case of a pyramid , the term face is understood to exclude the base. The two dimensional polygons that bound higher dimensional polytopes are also commonly called faces . Formally, however, a face is any of the lower dimensional boundaries of the polytope, more specifically called an n face . Formal definition In convexgeometry , a face of a polytope P is the intersection of any supporting hyperplane of P and P . From this definition it follows that the set of faces of a polytope includes the polytope itself and the empty set. For example, a polyhedron R sup 3 sup is entirely on one hyperplane of R sup 4 b . If R sup 4 sup were spacetime, the hyperplane at t 0 supports and contains the entire polyhedron. Thus, by the formal definition, the polyhedron is a face of itself. All of the following are the n faces of a 4 polytope 4 dimensional polytope 4 face the 4 dimensional 4 polytope itself 3 face any 3 dimensional cell geometry cell 2 face any 2 dimensional polygonal face using the common definition of face 1 face any 1 dimensional edge geometry edge 0 face any 0 dimensional vertex geometry vertex the empty set. Facets If the polytope lies in m dimensions, a face in the m 1 dimension is called a Facet mathematics facet . For example, a cell of a polychoron is a facet, a face of a polyhedron is a facet, an edge of a polygon is a facet, etc. A face in the n 2 dimension is called a Ridge geometry ridge . See also Euler characteristic External links ... more details
In number theory , the geometry of numbers studies convex body convex bodies and lattice group lattice s integer vectors in n dimensional space. The geometry of numbers was initiated by harvs txt authorlink Hermann Minkowski first Hermann last Minkowski year 1910 . The geometry of numbers has a close ..., New York, 1995. Second edition 2006. P. M. Gruber, Convex and discrete geometry, Springer Verlag, New York, 2007. P. M. Gruber, J. M. Wills editors , Handbook of convexgeometry. Vol. A. B, North ... is a lattice in n dimensional Euclidean space R sup n sup and K is a convex centrally symmetric body ... n vol K le 2 n vol R n Gamma . math Later research in the geometry of numbers In 1930 1960 research on the geometry of numbers was conducted by many number theorist s including Louis Mordell , Harold ... combinatorial theories that enumerate the lattice points in some convex bodies. ref Gr tschel et alia ... theorem seealso Siegel s lemma volume mathematics determinant Parallelepiped In the geometry of numbers ... F space Minkowski s geometry of numbers had a profound influence on functional analysis . Minkowski proved that symmetric convex bodies induce normed space norms in finite dimensional vector spaces. Minkwoski ... that the symmetric convex sets that are closed and bounded generate the topology of a Banach space ... to star shaped set s and other convex set non convex set s. ref Kalton et alia. Gardner ref References ... Geometry publisher Cambridge U. P. year 2006 J. W. S. Cassels . An Introduction to the Geometry ... Geometry of Numbers year 1939 publisher Macmillan Republished in 1964 by Dover. Edmund Hlawka ... 27585 7 MathSciNet id 0808777 C. G. Lekkerkererker. Geometry of Numbers . Wolters Noordhoff, North ..., 1986 Springer id G g044350 title Geometry of numbers first A.V. last Malyshev Citation last1 ..., Carl Ludwig authorlink Carl Ludwig Siegel title Lectures on the Geometry of Numbers year 1989 publisher Springer Verlag Rolf Schneider, Convex bodies the Brunn Minkowski theory, Cambridge University ... more details
Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry . Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational geometry. The main impetus for the development of computational geometry as a discipline was progress in computer ... problems in computational geometry are classical in nature, and may come from mathematical visualization . Other important applications of computational geometry include robotics motion planning ... planning , integrated circuit design IC geometry design and verification , computer aided engineering CAE programming of numerically controlled NC machines . The main branches of computational geometry are Combinatorial computational geometry , also called algorithmic geometry , which deals with geometric ... geometry in this sense by 1975. ref name PS cite book author Franco P. Preparata and Michael Ian Shamos title Computational Geometry An Introduction publisher Springer Verlag year 1985 id 1st edition ... computational geometry , also called machine geometry , computer aided geometric design CAGD , or geometric ... geometry and is often considered a branch of computer graphics or CAD. The term computational geometry in this meaning has been in use since 1971. ref A.R. Forrest, Computational geometry , Proc. Royal Society London , 321, series 4, 187 195 1971 ref Combinatorial computational geometry The primary goal of research in combinatorial computational geometry is to develop efficient algorithm s and data .... A classic result in computational geometry was the formulation of an algorithm that takes O n ... O n log log n time, have also been discovered. Citation needed date May 2010 Computational geometry .... Problem classes The core problems in computational geometry may be classified in different ways, according ... or found. Some fundamental problems of this type are Convex hull Given a set of points, find the smallest ... more details
Image Geometric lens.gif frame right A lens contained between two circular arcs of radius R , and centers at O sub 1 sub and O sub 2 sub In geometry , a lens is a wiktionary Convex convex shape comprising two circle circular Arc geometry arc s, joined at their endpoints. If the arcs have equal radii, it is called a symmetric lens . The corresponding wiktionary Concave concave shape is the Lune mathematics lune . The Vesica piscis is one form of a symmetrical lens the term is also used for lenses generally. In common usage, the term lens is also used to describe the shape of a three dimensional object obtained by rotating a two dimensional lens about its narrow axis of symmetry. Such a shape is described as BOLDED BECAUSE OF THE REDIRECT lenticular . See also Mrs. Miniver s problem References cite web accessdate June 13, 2005 url http mathworld.wolfram.com Lens.html title Lens author Eric W. Weisstein. work MathWorld which in turn cites cite journal author Pedoe, D. year 1995 title Circles A Mathematical View, rev. ed. journal Washington, DC Math. Assoc. Amer. volume pages cite book author Plummer, H. year 1960 title An Introductory Treatise of Dynamical Astronomy location York publisher Dover id cite book author Rawles, B. year 1997 title http www.GeometryCode.com sg Sacred Geometry Design Sourcebook Universal Dimensional Patterns . location Eagle Point, OR publisher Elysian Pub. id page 11 cite book author Watson, G. N. year 1966 title A Treatise on the Theory of Bessel Functions, 2nd ed. location Cambridge, England publisher Cambridge University Press id Category Geometric shapes geometry stub ... more details
Encyclopedia
top
