|
Inversive Distance
In inversive geometry, the inversive distance is a way of measuring the "distance" between two circles, regardless of whether the circles cross each other, are tangent to each other, or are disjoint from each other. Properties The inversive distance remains unchanged if the circles are inverted, or transformed by a Möbius transformation. One pair of circles can be transformed to another pair by a Möbius transformation if and only if both pairs have the same inversive distance. An analogue of the Beckman–Quarles theorem holds true for the inversive distance: if a bijection of the set of circles in the inversive plane preserves the inversive distance between pairs of circles at some chosen fixed distance \delta, then it must be a Möbius transformation that preserves all inversive distances.. Distance formula For two circles in the Euclidean plane with radii r and R, and distance d between their centers, the inversive distance can be defined by the formula. :I=\frac. This formul ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Inversive Geometry
Inversive activities are processes which self internalise the action concerned. For example, a person who has an Inversive personality internalises his emotions from any exterior source. An inversive heat source would be a heat source where all the heat remains within the object and is not subject to any format of transference Transference (german: Übertragung) is a phenomenon within psychotherapy in which the "feelings, attitudes, or desires" a person had about one thing are subconsciously projected onto the here-and-now Other. It usually concerns feelings from a ... or externalisation. Is the opposite of Transversive activities and objects which suggest by their very nature that the outcome is transferred to the secondary source. Psychoanalytic terminology Emotion ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hyperbolic Plane
In mathematics, hyperbolic geometry (also called Lobachevskian geometry or Bolyai– Lobachevskian geometry) is a non-Euclidean geometry. The parallel postulate of Euclidean geometry is replaced with: :For any given line ''R'' and point ''P'' not on ''R'', in the plane containing both line ''R'' and point ''P'' there are at least two distinct lines through ''P'' that do not intersect ''R''. (Compare the above with Playfair's axiom, the modern version of Euclid's parallel postulate.) Hyperbolic plane geometry is also the geometry of pseudospherical surfaces, surfaces with a constant negative Gaussian curvature. Saddle surfaces have negative Gaussian curvature in at least some regions, where they locally resemble the hyperbolic plane. A modern use of hyperbolic geometry is in the theory of special relativity, particularly the Minkowski model. When geometers first realised they were working with something other than the standard Euclidean geometry, they described their geomet ... [...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''/Engineering, Computing and Technology Notable articles The articles by Gil Kalai with a proof of a subexponential upper bound on the diameter of a polyhedron and by Samuel Ferguson on the Kepler conjecture, both published in Discrete & Computational geometry, earned their author the Fulkerson Prize The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and the American Mathematical Society (AMS). Up to three awards of $1,500 each are presented at e .... References External link ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Angular Defect
In geometry, the (angular) defect (or deficit or deficiency) means the failure of some angles to add up to the expected amount of 360° or 180°, when such angles in the Euclidean plane would. The opposite notion is the excess. Classically the defect arises in two ways: * the defect of a vertex of a polyhedron; * the defect of a hyperbolic triangle; and the excess also arises in two ways: * the excess of a toroidal polyhedron. * the excess of a spherical triangle; In the Euclidean plane, angles about a point add up to 360°, while interior angles in a triangle add up to 180° (equivalently, ''exterior'' angles add up to 360°). However, on a convex polyhedron the angles at a vertex add up to less than 360°, on a spherical triangle the interior angles always add up to more than 180° (the exterior angles add up to ''less'' than 360°), and the angles in a hyperbolic triangle always add up to less than 180° (the exterior angles add up to ''more'' than 360°). In modern terms, the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Manifold
In mathematics, a manifold is a topological space that locally resembles Euclidean space near each point. More precisely, an n-dimensional manifold, or ''n-manifold'' for short, is a topological space with the property that each point has a neighborhood that is homeomorphic to an open subset of n-dimensional Euclidean space. One-dimensional manifolds include lines and circles, but not lemniscates. Two-dimensional manifolds are also called surfaces. Examples include the plane, the sphere, and the torus, and also the Klein bottle and real projective plane. The concept of a manifold is central to many parts of geometry and modern mathematical physics because it allows complicated structures to be described in terms of well-understood topological properties of simpler spaces. Manifolds naturally arise as solution sets of systems of equations and as graphs of functions. The concept has applications in computer-graphics given the need to associate pictures with coordinates (e.g ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rigidity (mathematics)
In mathematics, a rigid collection ''C'' of mathematical objects (for instance sets or functions) is one in which every ''c'' ∈ ''C'' is uniquely determined by less information about ''c'' than one would expect. The above statement does not define a mathematical property. Instead, it describes in what sense the adjective rigid is typically used in mathematics, by mathematicians. __FORCETOC__ Examples Some examples include: #Harmonic functions on the unit disk are rigid in the sense that they are uniquely determined by their boundary values. #Holomorphic functions are determined by the set of all derivatives at a single point. A smooth function from the real line to the complex plane is not, in general, determined by all its derivatives at a single point, but it is if we require additionally that it be possible to extend the function to one on a neighbourhood of the real line in the complex plane. The Schwarz lemma is an example of such a rigidity theorem. #By the fu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Maximal Planar Graph
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other. Such a drawing is called a plane graph or planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to a point on a plane, and from every edge to a plane curve on that plane, such that the extreme points of each curve are the points mapped from its end nodes, and all curves are disjoint except on their extreme points. Every graph that can be drawn on a plane can be drawn on the sphere as well, and vice versa, by means of stereographic projection. Plane graphs can be encoded by combinatorial maps or rotation systems. An equivalence class of topologically equivalent drawings on the sphere, usually with additional assumptions such as the absence of isthmuses, is called a ... [...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 for each circle, and an edge for every pair of circles that are 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, and 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 connected simple planar graph ''G'' there is a circle packing in the plane whose intersection graph is (isom ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Planar Graph
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other. Such a drawing is called a plane graph or planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to a point on a plane, and from every edge to a plane curve on that plane, such that the extreme points of each curve are the points mapped from its end nodes, and all curves are disjoint except on their extreme points. Every graph that can be drawn on a plane can be drawn on the sphere as well, and vice versa, by means of stereographic projection. Plane graphs can be encoded by combinatorial maps or rotation systems. An equivalence class of topologically equivalent drawings on the sphere, usually with additional assumptions such as the absence of isthmuses, is called a pl ... [...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, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Diophantine Approximation
In number theory, the study of Diophantine approximation deals with the approximation of real numbers by rational numbers. It is named after Diophantus of Alexandria. The first problem was to know how well a real number can be approximated by rational numbers. For this problem, a rational number ''a''/''b'' is a "good" approximation of a real number ''α'' if the absolute value of the difference between ''a''/''b'' and ''α'' may not decrease if ''a''/''b'' is replaced by another rational number with a smaller denominator. This problem was solved during the 18th century by means of continued fractions. Knowing the "best" approximations of a given number, the main problem of the field is to find sharp upper and lower bounds of the above difference, expressed as a function of the denominator. It appears that these bounds depend on the nature of the real numbers to be approximated: the lower bound for the approximation of a rational number by another rational number is larger than ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rational Number
In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (e.g. ). The set of all rational numbers, also referred to as "the rationals", the field of rationals or the field of rational numbers is usually denoted by boldface , or blackboard bold \mathbb. A rational number is a real number. The real numbers that are rational are those whose decimal expansion either terminates after a finite number of digits (example: ), or eventually begins to repeat the same finite sequence of digits over and over (example: ). This statement is true not only in base 10, but also in every other integer base, such as the binary and hexadecimal ones (see ). A real number that is not rational is called irrational. Irrational numbers include , , , and . Since the set of rational numbers is countable, and the set of real numbers is uncountable ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.svg "Click for more on -> Circle Packing")
