|
Discrete Geometry
Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects. Most questions in discrete geometry involve finite or discrete sets of basic geometric objects, such as points, lines, planes, circles, spheres, polygons, and so forth. The subject focuses on the combinatorial properties of these objects, such as how they intersect one another, or how they may be arranged to cover a larger object. Discrete geometry has a large overlap with convex geometry 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. History Although polyhedra and tessellations had been studied for many years by people such as Kepler and Cauchy, modern discrete geometry has its origins in the late 19th century. Early topic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Matroid
In combinatorics, a branch of mathematics, a matroid is a structure that abstracts and generalizes the notion of linear independence in vector spaces. There are many equivalent ways to define a matroid axiomatically, the most significant being in terms of: independent sets; bases or circuits; rank functions; closure operators; and closed sets or flats. In the language of partially ordered sets, a finite matroid is equivalent to a geometric lattice. Matroid theory borrows extensively from the terminology of both linear algebra and graph theory, largely because it is the abstraction of various notions of central importance in these fields. Matroids have found applications in geometry, topology, combinatorial optimization, network theory and coding theory. Definition There are many equivalent ( cryptomorphic) ways to define a (finite) matroid.A standard source for basic definitions and results about matroids is Oxley (1992). An older standard source is Welsh (1976). See Brylawsk ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computational Geometry
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. While modern computational geometry is a recent development, it is one of the oldest fields of computing with a history stretching back to antiquity. Computational complexity is central to computational geometry, with great practical significance if algorithms are used on very large datasets containing tens or hundreds of millions of points. For such sets, the difference between O(''n''2) and O(''n'' log ''n'') may be the difference between days and seconds of computation. The main impetus for the development of computational geometry as a discipline was progress in computer graphics and computer-aided design and manufacturing (CAD/ CAM), but many problems in computational geometry ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Axel Thue
Axel Thue (; 19 February 1863 – 7 March 1922) was a Norwegian mathematician, known for his original work in diophantine approximation and combinatorics. Work Thue published his first important paper in 1909. He stated in 1914 the so-called word problem for semigroups or Thue problem, closely related to the halting problem In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running, or continue to run forever. Alan Turing proved in 1936 that a g .... Ronald V. Book and Friedrich Otto, ''String-rewriting Systems'', Springer, 1993, , p. 36. His only known PhD student was Thoralf Skolem. The esoteric programming language Thue is named after him. Publications * * See also * * * * * * References External links * Axel Thue private archiveexists at NTNU University LibrarDorabiblioteket 1863 births 1922 deaths 20th-century Norwegian mathematici ... [...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 ro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Augustin-Louis Cauchy
Baron Augustin-Louis Cauchy (, ; ; 21 August 178923 May 1857) was a French mathematician, engineer, and physicist who made pioneering contributions to several branches of mathematics, including mathematical analysis and continuum mechanics. He was one of the first to state and rigorously prove theorems of calculus, rejecting the heuristic principle of the generality of algebra of earlier authors. He almost singlehandedly founded complex analysis and the study of permutation groups in abstract algebra. A profound mathematician, Cauchy had a great influence over his contemporaries and successors; Hans Freudenthal stated: "More concepts and theorems have been named for Cauchy than for any other mathematician (in elasticity alone there are sixteen concepts and theorems named for Cauchy)." Cauchy was a prolific writer; he wrote approximately eight hundred research articles and five complete textbooks on a variety of topics in the fields of mathematics and mathematical physics. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Johannes Kepler
Johannes Kepler (; ; 27 December 1571 – 15 November 1630) was a German astronomer, mathematician, astrologer, natural philosopher and writer on music. He is a key figure in the 17th-century Scientific Revolution, best known for his laws of planetary motion, and his books '' Astronomia nova'', '' Harmonice Mundi'', and '' Epitome Astronomiae Copernicanae''. These works also provided one of the foundations for Newton's theory of universal gravitation. Kepler was a mathematics teacher at a seminary school in Graz, where he became an associate of Prince Hans Ulrich von Eggenberg. Later he became an assistant to the astronomer Tycho Brahe in Prague, and eventually the imperial mathematician to Emperor Rudolf II and his two successors Matthias and Ferdinand II. He also taught mathematics in Linz, and was an adviser to General Wallenstein. Additionally, he did fundamental work in the field of optics, invented an improved version of the refracting (or Keplerian) telescop ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tessellation
A tessellation or tiling is the covering of a surface, often a plane, using one or more geometric shapes, called ''tiles'', with no overlaps and no gaps. In mathematics, tessellation can be generalized to higher dimensions and a variety of geometries. A periodic tiling has a repeating pattern. Some special kinds include ''regular tilings'' with regular polygonal tiles all of the same shape, and ''semiregular tilings'' with regular tiles of more than one shape and with every corner identically arranged. The patterns formed by periodic tilings can be categorized into 17 wallpaper groups. A tiling that lacks a repeating pattern is called "non-periodic". An ''aperiodic tiling'' uses a small set of tile shapes that cannot form a repeating pattern. A ''tessellation of space'', also known as a space filling or honeycomb, can be defined in the geometry of higher dimensions. A real physical tessellation is a tiling made of materials such as cemented ceramic squares or hexagons. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polyhedra
In geometry, a polyhedron (plural polyhedra or polyhedrons; ) is a three-dimensional shape with flat polygonal faces, straight edges and sharp corners or vertices. A convex polyhedron is the convex hull of finitely many points, not all on the same plane. Cubes and pyramids are examples of convex polyhedra. A polyhedron is a 3-dimensional example of a polytope, a more general concept in any number of dimensions. Definition Convex polyhedra are well-defined, with several equivalent standard definitions. However, the formal mathematical definition of polyhedra that are not required to be convex has been problematic. Many definitions of "polyhedron" have been given within particular contexts,. some more rigorous than others, and there is not universal agreement over which of these to choose. Some of these definitions exclude shapes that have often been counted as polyhedra (such as the self-crossing polyhedra) or include shapes that are often not considered as valid pol ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Combinatorial Topology
In mathematics, combinatorial topology was an older name for algebraic topology, dating from the time when topological invariants of spaces (for example the Betti numbers) were regarded as derived from combinatorial decompositions of spaces, such as decomposition into simplicial complexes. After the proof of the simplicial approximation theorem this approach provided rigour. The change of name reflected the move to organise topological classes such as cycles-modulo-boundaries explicitly into abelian groups. This point of view is often attributed to Emmy Noether, and so the change of title may reflect her influence. The transition is also attributed to the work of Heinz Hopf, who was influenced by Noether, and to Leopold Vietoris and Walther Mayer, who independently defined homology. A fairly precise date can be supplied in the internal notes of the Bourbaki group. While topology was still ''combinatorial'' in 1942, it had become ''algebraic'' by 1944. This corresponds also to th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Toric Geometry
In algebraic geometry, a toric variety or torus embedding is an algebraic variety containing an algebraic torus as an open dense subset, such that the action of the torus on itself extends to the whole variety. Some authors also require it to be normal. Toric varieties form an important and rich class of examples in algebraic geometry, which often provide a testing ground for theorems. The geometry of a toric variety is fully determined by the combinatorics of its associated fan, which often makes computations far more tractable. For a certain special, but still quite general class of toric varieties, this information is also encoded in a polytope, which creates a powerful connection of the subject with convex geometry. Familiar examples of toric varieties are affine space, projective spaces, products of projective spaces and bundles over projective space. Toric varieties from tori The original motivation to study toric varieties was to study torus embeddings. Given the algebra ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geometric Graph Theory
Geometric graph theory in the broader sense is a large and amorphous subfield of graph theory, concerned with graphs defined by geometric means. In a stricter sense, geometric graph theory studies combinatorial and geometric properties of geometric graphs, meaning graphs drawn in the Euclidean plane with possibly intersecting straight-line edges, and topological graphs, where the edges are allowed to be arbitrary continuous curves connecting the vertices, thus it is "the theory of geometric and topological graphs" (Pach 2013). Geometric graphs are also known as spatial networks. Different types of geometric graphs A ''planar straight-line graph'' is a graph in which the vertices are embedded as points in the Euclidean plane, and the edges are embedded as non-crossing line segments. Fáry's theorem states that any planar graph may be represented as a planar straight line graph. A triangulation is a planar straight line graph to which no more edges may be added, so called b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discrete Differential Geometry
Discrete differential geometry is the study of discrete counterparts of notions in differential geometry. Instead of smooth curves and surfaces, there are polygons, meshes, and simplicial complexes. It is used in the study of computer graphics, geometry processing and topological combinatorics. See also *Discrete Laplace operator *Discrete exterior calculus * Discrete Morse theory * Topological combinatorics *Spectral shape analysis Spectral shape analysis relies on the spectrum (eigenvalues and/or eigenfunctions) of the Laplace–Beltrami operator to compare and analyze geometric shapes. Since the spectrum of the Laplace–Beltrami operator is invariant under isometries, i ... * Abstract differential geometry * Analysis on fractals * Discrete calculus ReferencesDiscrete differential geometry Forum* * * Alexander I. Bobenko, Yuri B. Suris (2008), "Discrete Differential Geometry", American Mathematical Society, Differential geometry Simplicial sets {{differential- ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.svg "Click for more on -> Circle Packing")
