1.
Geometry
–
Geometry is a branch of mathematics concerned with questions of shape, size, relative position of figures, and the properties of space. A mathematician who works in the field of geometry is called a geometer, Geometry arose independently in a number of early cultures as a practical way for dealing with lengths, areas, and volumes. Geometry began to see elements of mathematical science emerging in the West as early as the 6th century BC. By the 3rd century BC, geometry was put into a form by Euclid, whose treatment, Euclids Elements. Geometry arose independently in India, with texts providing rules for geometric constructions appearing as early as the 3rd century BC, islamic scientists preserved Greek ideas and expanded on them during the Middle Ages. By the early 17th century, geometry had been put on a solid footing by mathematicians such as René Descartes. Since then, and into modern times, geometry has expanded into non-Euclidean geometry and manifolds, while geometry has evolved significantly throughout the years, there are some general concepts that are more or less fundamental to geometry. These include the concepts of points, lines, planes, surfaces, angles, contemporary geometry has many subfields, Euclidean geometry is geometry in its classical sense. The mandatory educational curriculum of the majority of nations includes the study of points, lines, planes, angles, triangles, congruence, similarity, solid figures, circles, Euclidean geometry also has applications in computer science, crystallography, and various branches of modern mathematics. Differential geometry uses techniques of calculus and linear algebra to problems in geometry. It has applications in physics, including in general relativity, topology is the field concerned with the properties of geometric objects that are unchanged by continuous mappings. In practice, this often means dealing with large-scale properties of spaces, convex geometry investigates convex shapes in the Euclidean space and its more abstract analogues, often using techniques of real analysis. It has close connections to convex analysis, optimization and functional analysis, algebraic geometry studies geometry through the use of multivariate polynomials and other algebraic techniques. It has applications in areas, including cryptography and string theory. Discrete geometry is concerned mainly with questions of relative position of simple objects, such as points. It shares many methods and principles with combinatorics, Geometry has applications to many fields, including art, architecture, physics, as well as to other branches of mathematics. The earliest recorded beginnings of geometry can be traced to ancient Mesopotamia, the earliest known texts on geometry are the Egyptian Rhind Papyrus and Moscow Papyrus, the Babylonian clay tablets such as Plimpton 322. For example, the Moscow Papyrus gives a formula for calculating the volume of a truncated pyramid, later clay tablets demonstrate that Babylonian astronomers implemented trapezoid procedures for computing Jupiters position and motion within time-velocity space
2.
Shape
–
A shape is the form of an object or its external boundary, outline, or external surface, as opposed to other properties such as color, texture, or material composition. Psychologists have theorized that humans mentally break down images into simple geometric shapes called geons, examples of geons include cones and spheres. Some simple shapes can be put into broad categories, for instance, polygons are classified according to their number of edges as triangles, quadrilaterals, pentagons, etc. Each of these is divided into categories, triangles can be equilateral, isosceles, obtuse, acute, scalene, etc. while quadrilaterals can be rectangles, rhombi, trapezoids, squares. Other common shapes are points, lines, planes, and conic sections such as ellipses, circles, among the most common 3-dimensional shapes are polyhedra, which are shapes with flat faces, ellipsoids, which are egg-shaped or sphere-shaped objects, cylinders, and cones. If an object falls into one of these categories exactly or even approximately, thus, we say that the shape of a manhole cover is a disk, because it is approximately the same geometric object as an actual geometric disk. Similarity, Two objects are similar if one can be transformed into the other by a scaling, together with a sequence of rotations, translations. Isotopy, Two objects are isotopic if one can be transformed into the other by a sequence of deformations that do not tear the object or put holes in it. Sometimes, two similar or congruent objects may be regarded as having a different shape if a reflection is required to transform one into the other. For instance, the b and d are a reflection of each other, and hence they are congruent and similar. Sometimes, only the outline or external boundary of the object is considered to determine its shape, for instance, an hollow sphere may be considered to have the same shape as a solid sphere. Procrustes analysis is used in many sciences to determine whether or not two objects have the shape, or to measure the difference between two shapes. In advanced mathematics, quasi-isometry can be used as a criterion to state that two shapes are approximately the same. Simple shapes can often be classified into basic objects such as a point, a line, a curve, a plane. However, most shapes occurring in the world are complex. Some, such as plant structures and coastlines, may be so complicated as to defy traditional mathematical description – in which case they may be analyzed by differential geometry, or as fractals. In geometry, two subsets of a Euclidean space have the shape if one can be transformed to the other by a combination of translations, rotations. In other words, the shape of a set of points is all the information that is invariant to translations, rotations
3.
Line segment
–
In geometry, a line segment is a part of a line that is bounded by two distinct end points, and contains every point on the line between its endpoints. A closed line segment includes both endpoints, while a line segment excludes both endpoints, a half-open line segment includes exactly one of the endpoints. Examples of line include the sides of a triangle or square. More generally, when both of the end points are vertices of a polygon or polyhedron, the line segment is either an edge if they are adjacent vertices. When the end points both lie on a such as a circle, a line segment is called a chord. Sometimes one needs to distinguish between open and closed line segments, thus, the line segment can be expressed as a convex combination of the segments two end points. In geometry, it is defined that a point B is between two other points A and C, if the distance AB added to the distance BC is equal to the distance AC. Thus in R2 the line segment with endpoints A = and C = is the collection of points. A line segment is a connected, non-empty set, if V is a topological vector space, then a closed line segment is a closed set in V. However, an open line segment is an open set in V if and only if V is one-dimensional. More generally than above, the concept of a segment can be defined in an ordered geometry. A pair of segments can be any one of the following, intersecting, parallel, skew. The last possibility is a way that line segments differ from lines, in an axiomatic treatment of geometry, the notion of betweenness is either assumed to satisfy a certain number of axioms, or else be defined in terms of an isometry of a line. Segments play an important role in other theories, for example, a set is convex if the segment that joins any two points of the set is contained in the set. This is important because it transforms some of the analysis of sets to the analysis of a line segment. The Segment Addition Postulate can be used to add congruent segment or segments with equal lengths and consequently substitute other segments into another statement to make segments congruent. A line segment can be viewed as a case of an ellipse in which the semiminor axis goes to zero, the foci go to the endpoints. A complete orbit of this ellipse traverses the line segment twice, as a degenerate orbit this is a radial elliptic trajectory. In addition to appearing as the edges and diagonals of polygons and polyhedra, some very frequently considered segments in a triangle include the three altitudes, the three medians, the perpendicular bisectors of the sides, and the internal angle bisectors
4.
Polygonal chain
–
In geometry, a polygonal chain is a connected series of line segments. More formally, a polygonal chain P is a curve specified by a sequence of points called its vertices, the curve itself consists of the line segments connecting the consecutive vertices. A polygonal chain may also be called a curve, polygonal path, polyline, piecewise linear curve, broken line or, in geographic information systems. A simple polygonal chain is one in which only consecutive segments intersect, a closed polygonal chain is one in which the first vertex coincides with the last one, or, alternatively, the first and the last vertices are also connected by a line segment. A simple closed polygonal chain in the plane is the boundary of a simple polygon, often the term polygon is used in the meaning of closed polygonal chain, but in some cases it is important to draw a distinction between a polygonal area and a polygonal chain. A polygonal chain is called monotone, if there is a straight line L such that every line perpendicular to L intersects the chain at most once, every nontrivial monotone polygonal chain is open. In comparison, a polygon is a polygon that can be partitioned into exactly two monotone chains. The graphs of linear functions form monotone chains with respect to a horizontal line. Every set of at least n points contains a path of at least ⌊ n −1 ⌋ edges in which all slopes have the same sign. This is a corollary of the Erdős–Szekeres theorem, polygonal chains can often be used to approximate more complex curves. In this context, the Ramer–Douglas–Peucker algorithm can be used to find a chain with few segments that serves as an accurate approximation. Polygonal chains are also a data type in computational geometry. With geographic information system, linestrings may represent any linear geometry, linear rings are closed and simple polygonal chains used to build polygon geometries
5.
Edge (geometry)
–
For edge in graph theory, see Edge In geometry, an edge is a particular type of line segment joining two vertices in a polygon, polyhedron, or higher-dimensional polytope. In a polygon, an edge is a segment on the boundary. In a polyhedron or more generally a polytope, an edge is a segment where two faces meet. A segment joining two vertices while passing through the interior or exterior is not an edge but instead is called a diagonal. In graph theory, an edge is an abstract object connecting two vertices, unlike polygon and polyhedron edges which have a concrete geometric representation as a line segment. However, any polyhedron can be represented by its skeleton or edge-skeleton, conversely, the graphs that are skeletons of three-dimensional polyhedra can be characterized by Steinitzs theorem as being exactly the 3-vertex-connected planar graphs. Any convex polyhedrons surface has Euler characteristic V − E + F =2, where V is the number of vertices, E is the number of edges and this equation is known as Eulers polyhedron formula. Thus the number of edges is 2 less than the sum of the numbers of vertices and faces, for example, a cube has 8 vertices and 6 faces, and hence 12 edges. In a polygon, two edges meet at each vertex, more generally, by Balinskis theorem, at least d edges meet at every vertex of a convex polytope. Similarly, in a polyhedron, exactly two faces meet at every edge, while in higher dimensional polytopes three or more two-dimensional faces meet at every edge. Thus, the edges of a polygon are its facets, the edges of a 3-dimensional convex polyhedron are its ridges, archived from the original on 4 February 2007
6.
Vertex (geometry)
–
In geometry, a vertex is a point where two or more curves, lines, or edges meet. As a consequence of this definition, the point where two lines meet to form an angle and the corners of polygons and polyhedra are vertices. A vertex is a point of a polygon, polyhedron, or other higher-dimensional polytope. However, in theory, vertices may have fewer than two incident edges, which is usually not allowed for geometric vertices. However, a smooth approximation to a polygon will also have additional vertices. A polygon vertex xi of a simple polygon P is a principal polygon vertex if the diagonal intersects the boundary of P only at x and x, there are two types of principal vertices, ears and mouths. A principal vertex xi of a simple polygon P is called an ear if the diagonal that bridges xi lies entirely in P, according to the two ears theorem, every simple polygon has at least two ears. A principal vertex xi of a simple polygon P is called a mouth if the diagonal lies outside the boundary of P. Any convex polyhedrons surface has Euler characteristic V − E + F =2, where V is the number of vertices, E is the number of edges and this equation is known as Eulers polyhedron formula. Thus the number of vertices is 2 more than the excess of the number of edges over the number of faces, for example, a cube has 12 edges and 6 faces, and hence 8 vertices
7.
Triangle
–
A triangle is a polygon with three edges and three vertices. It is one of the shapes in geometry. A triangle with vertices A, B, and C is denoted △ A B C, in Euclidean geometry any three points, when non-collinear, determine a unique triangle and a unique plane. This article is about triangles in Euclidean geometry except where otherwise noted, triangles can be classified according to the lengths of their sides, An equilateral triangle has all sides the same length. An equilateral triangle is also a polygon with all angles measuring 60°. An isosceles triangle has two sides of equal length, some mathematicians define an isosceles triangle to have exactly two equal sides, whereas others define an isosceles triangle as one with at least two equal sides. The latter definition would make all equilateral triangles isosceles triangles, the 45–45–90 right triangle, which appears in the tetrakis square tiling, is isosceles. A scalene triangle has all its sides of different lengths, equivalently, it has all angles of different measure. Hatch marks, also called tick marks, are used in diagrams of triangles, a side can be marked with a pattern of ticks, short line segments in the form of tally marks, two sides have equal lengths if they are both marked with the same pattern. In a triangle, the pattern is no more than 3 ticks. Similarly, patterns of 1,2, or 3 concentric arcs inside the angles are used to indicate equal angles, triangles can also be classified according to their internal angles, measured here in degrees. A right triangle has one of its interior angles measuring 90°, the side opposite to the right angle is the hypotenuse, the longest side of the triangle. The other two sides are called the legs or catheti of the triangle, special right triangles are right triangles with additional properties that make calculations involving them easier. One of the two most famous is the 3–4–5 right triangle, where 32 +42 =52, in this situation,3,4, and 5 are a Pythagorean triple. The other one is a triangle that has 2 angles that each measure 45 degrees. Triangles that do not have an angle measuring 90° are called oblique triangles, a triangle with all interior angles measuring less than 90° is an acute triangle or acute-angled triangle. If c is the length of the longest side, then a2 + b2 > c2, a triangle with one interior angle measuring more than 90° is an obtuse triangle or obtuse-angled triangle. If c is the length of the longest side, then a2 + b2 < c2, a triangle with an interior angle of 180° is degenerate
8.
Polytope
–
In elementary geometry, a polytope is a geometric object with flat sides, and may exist in any general number of dimensions n as an n-dimensional polytope or n-polytope. For example, a polygon is a 2-polytope and a three-dimensional polyhedron is a 3-polytope. Polytopes in more than three dimensions were first discovered by Ludwig Schläfli, the German term polytop was coined by the mathematician Reinhold Hoppe, and was introduced to English mathematicians as polytope by Alicia Boole Stott. The term polytope is nowadays a broad term that covers a class of objects. Many of these definitions are not equivalent, resulting in different sets of objects being called polytopes and they represent different approaches to generalizing the convex polytopes to include other objects with similar properties. In this approach, a polytope may be regarded as a tessellation or decomposition of some given manifold, an example of this approach defines a polytope as a set of points that admits a simplicial decomposition. However this definition does not allow star polytopes with interior structures, the discovery of star polyhedra and other unusual constructions led to the idea of a polyhedron as a bounding surface, ignoring its interior. A polyhedron is understood as a surface whose faces are polygons, a 4-polytope as a hypersurface whose facets are polyhedra and this approach is used for example in the theory of abstract polytopes. In certain fields of mathematics, the terms polytope and polyhedron are used in a different sense and this terminology is typically confined to polytopes and polyhedra that are convex. A polytope comprises elements of different dimensionality such as vertices, edges, faces, cells, terminology for these is not fully consistent across different authors. For example, some authors use face to refer to an -dimensional element while others use face to denote a 2-face specifically, authors may use j-face or j-facet to indicate an element of j dimensions. Some use edge to refer to a ridge, while H. S. M. Coxeter uses cell to denote an -dimensional element, the terms adopted in this article are given in the table below, An n-dimensional polytope is bounded by a number of -dimensional facets. These facets are themselves polytopes, whose facets are -dimensional ridges of the original polytope, Every ridge arises as the intersection of two facets. Ridges are once again polytopes whose facets give rise to -dimensional boundaries of the original polytope and these bounding sub-polytopes may be referred to as faces, or specifically j-dimensional faces or j-faces. A 0-dimensional face is called a vertex, and consists of a single point, a 1-dimensional face is called an edge, and consists of a line segment. A 2-dimensional face consists of a polygon, and a 3-dimensional face, sometimes called a cell, the convex polytopes are the simplest kind of polytopes, and form the basis for several different generalizations of the concept of polytopes. A convex polytope is defined as the intersection of a set of half-spaces. This definition allows a polytope to be neither bounded nor finite, Polytopes are defined in this way, e. g. in linear programming
9.
Simple polygon
–
In geometry a simple polygon /ˈpɒlɪɡɒn/ is a flat shape consisting of straight, non-intersecting line segments or sides that are joined pair-wise to form a closed path. If the sides then the polygon is not simple. The qualifier simple is frequently omitted, with the definition then being understood to define a polygon in general. The definition given above ensures the following properties, A polygon encloses a region which always has a measurable area, the line segments that make-up a polygon meet only at their endpoints, called vertices or less formally corners. Exactly two edges meet at each vertex, the number of edges always equals the number of vertices. Two edges meeting at a corner are usually required to form an angle that is not straight, otherwise, according to the definition in use, this boundary may or may not form part of the polygon itself. A polygon in the plane is simple if and only if it is equivalent to a circle. Its interior is topologically equivalent to a disk, if a collection of non-crossing line segments forms the boundary of a region of the plane that is topologically equivalent to a disk, then this boundary is called a weakly simple polygon. In the image on the left, ABCDEFGHJKLM is a simple polygon according to this definition. Referring to the image above, ABCM is a boundary of a planar region with a hole FGHJ. The cut ED connects the hole with the exterior and is traversed twice in the resulting weakly simple polygonal representation and this formalizes the notion that such a polygon allows segments to touch but not to cross. However, this type of weakly simple polygon does not need to form the boundary of a region, as its interior can be empty. For example, referring to the image above, the polygonal chain ABCBA is a simple polygon according to this definition. Point in polygon testing involves determining, for a simple polygon P, simple formulae are known for computing polygon area, that is, the area of the interior of the polygon. Polygon partition is a set of units, which do not overlap. A polygon partition problem is a problem of finding a partition which is minimal in some sense, for example, a special case of polygon partition is Polygon triangulation, dividing a simple polygon into triangles. Although convex polygons are easy to triangulate, triangulating a general polygon is more difficult because we have to avoid adding edges that cross outside the polygon. Nevertheless, Bernard Chazelle showed in 1991 that any simple polygon with n vertices can be triangulated in Θ time, the same algorithm may also be used for determining whether a closed polygonal chain forms a simple polygon
10.
Star polygon
–
In geometry, a star polygon is a type of non-convex polygon. Only the regular polygons have been studied in any depth. The first usage is included in polygrams which includes polygons like the pentagram, star polygon names combine a numeral prefix, such as penta-, with the Greek suffix -gram. The prefix is normally a Greek cardinal, but synonyms using other prefixes exist, for example, a nine-pointed polygon or enneagram is also known as a nonagram, using the ordinal nona from Latin. The -gram suffix derives from γραμμή meaning a line, alternatively for integers p and q, it can be considered as being constructed by connecting every qth point out of p points regularly spaced in a circular placement. A regular star polygon is denoted by its Schläfli symbol, where p and q are relatively prime, the symmetry group of is dihedral group Dn of order 2n, independent of k. A regular star polygon can also be obtained as a sequence of stellations of a regular core polygon. Regular star polygons were first studied systematically by Thomas Bradwardine, if p and q are not coprime, a degenerate polygon will result with coinciding vertices and edges. For example will appear as a triangle, but can be labeled with two sets of vertices 1-6 and this should be seen not as two overlapping triangles, but a double-winding of a single unicursal hexagon. For |n/d|, the vertices have an exterior angle, β. These polygons are often seen in tiling patterns, the parametric angle α can be chosen to match internal angles of neighboring polygons in a tessellation pattern. The interior of a polygon may be treated in different ways. Three such treatments are illustrated for a pentagram, branko Grunbaum and Geoffrey Shephard consider two of them, as regular star polygons and concave isogonal 2n-gons. These include, Where a side occurs, one side is treated as outside and this is shown in the left hand illustration and commonly occurs in computer vector graphics rendering. The number of times that the polygonal curve winds around a given region determines its density, the exterior is given a density of 0, and any region of density >0 is treated as internal. This is shown in the illustration and commonly occurs in the mathematical treatment of polyhedra. Where a line may be drawn between two sides, the region in which the line lies is treated as inside the figure and this is shown in the right hand illustration and commonly occurs when making a physical model. When the area of the polygon is calculated, each of these approaches yields a different answer, star polygons feature prominently in art and culture
11.
Greek language
–
Greek is an independent branch of the Indo-European family of languages, native to Greece and other parts of the Eastern Mediterranean. It has the longest documented history of any living language, spanning 34 centuries of written records and its writing system has been the Greek alphabet for the major part of its history, other systems, such as Linear B and the Cypriot syllabary, were used previously. The alphabet arose from the Phoenician script and was in turn the basis of the Latin, Cyrillic, Armenian, Coptic, Gothic and many other writing systems. Together with the Latin texts and traditions of the Roman world, during antiquity, Greek was a widely spoken lingua franca in the Mediterranean world and many places beyond. It would eventually become the official parlance of the Byzantine Empire, the language is spoken by at least 13.2 million people today in Greece, Cyprus, Italy, Albania, Turkey, and the Greek diaspora. Greek roots are used to coin new words for other languages, Greek. Greek has been spoken in the Balkan peninsula since around the 3rd millennium BC, the earliest written evidence is a Linear B clay tablet found in Messenia that dates to between 1450 and 1350 BC, making Greek the worlds oldest recorded living language. Among the Indo-European languages, its date of earliest written attestation is matched only by the now extinct Anatolian languages, the Greek language is conventionally divided into the following periods, Proto-Greek, the unrecorded but assumed last ancestor of all known varieties of Greek. The unity of Proto-Greek would have ended as Hellenic migrants entered the Greek peninsula sometime in the Neolithic era or the Bronze Age, Mycenaean Greek, the language of the Mycenaean civilisation. It is recorded in the Linear B script on tablets dating from the 15th century BC onwards, Ancient Greek, in its various dialects, the language of the Archaic and Classical periods of the ancient Greek civilisation. It was widely known throughout the Roman Empire, after the Roman conquest of Greece, an unofficial bilingualism of Greek and Latin was established in the city of Rome and Koine Greek became a first or second language in the Roman Empire. The origin of Christianity can also be traced through Koine Greek, Medieval Greek, also known as Byzantine Greek, the continuation of Koine Greek in Byzantine Greece, up to the demise of the Byzantine Empire in the 15th century. Much of the written Greek that was used as the language of the Byzantine Empire was an eclectic middle-ground variety based on the tradition of written Koine. Modern Greek, Stemming from Medieval Greek, Modern Greek usages can be traced in the Byzantine period and it is the language used by the modern Greeks, and, apart from Standard Modern Greek, there are several dialects of it. In the modern era, the Greek language entered a state of diglossia, the historical unity and continuing identity between the various stages of the Greek language is often emphasised. Greek speakers today still tend to regard literary works of ancient Greek as part of their own rather than a foreign language and it is also often stated that the historical changes have been relatively slight compared with some other languages. According to one estimation, Homeric Greek is probably closer to demotic than 12-century Middle English is to modern spoken English, Greek is spoken by about 13 million people, mainly in Greece, Albania and Cyprus, but also worldwide by the large Greek diaspora. Greek is the language of Greece, where it is spoken by almost the entire population
12.
Convex polygon
–
A convex polygon is a simple polygon in which no line segment between two points on the boundary ever goes outside the polygon. Equivalently, it is a polygon whose interior is a convex set. In a convex polygon, all angles are less than or equal to 180 degrees. A simple polygon which is not convex is called concave, the following properties of a simple polygon are all equivalent to convexity, Every internal angle is less than or equal to 180 degrees. Every point on line segment between two points inside or on the boundary of the polygon remains inside or on the boundary. The polygon is contained in a closed half-plane defined by each of its edges. For each edge, the points are all on the same side of the line that the edge defines. The angle at each vertex contains all vertices in its edges. The polygon is the hull of its edges. Additional properties of convex polygons include, The intersection of two convex polygons is a convex polygon, a convex polygon may br triangulated in linear time through a fan triangulation, consisting in adding diagonals from one vertex to all other vertices. Hellys theorem, For every collection of at least three convex polygons, if the intersection of three of them is nonempty, then the whole collection has a nonempty intersection. Krein–Milman theorem, A convex polygon is the hull of its vertices. Thus it is defined by the set of its vertices. Hyperplane separation theorem, Any two convex polygons with no points in common have a separator line, if the polygons are closed and at least one of them is compact, then there are even two parallel separator lines. Inscribed triangle property, Of all triangles contained in a convex polygon, inscribing triangle property, every convex polygon with area A can be inscribed in a triangle of area at most equal to 2A. Equality holds for a parallelogram.5 × Area ≤ Area ≤2 × Area, the mean width of a convex polygon is equal to its perimeter divided by pi. So its width is the diameter of a circle with the perimeter as the polygon. Every polygon inscribed in a circle, if not self-intersecting, is convex, however, not every convex polygon can be inscribed in a circle
13.
Concave polygon
–
A simple polygon that is not convex is called concave, non-convex or reentrant. A concave polygon will always have at least one reflex interior angle—that is, some lines containing interior points of a concave polygon intersect its boundary at more than two points. Some diagonals of a concave polygon lie partly or wholly outside the polygon, some sidelines of a concave polygon fail to divide the plane into two half-planes one of which entirely contains the polygon. None of these three statements holds for a convex polygon, as with any simple polygon, the sum of the internal angles of a concave polygon is π radians, equivalently 180°×, where n is the number of sides. It is always possible to partition a concave polygon into a set of convex polygons, a polynomial-time algorithm for finding a decomposition into as few convex polygons as possible is described by Chazelle & Dobkin. A triangle can never be concave, but there exist concave polygons with n sides for any n >3, an example of a concave quadrilateral is the dart. At least one interior angle does not contain all vertices in its edges. The convex hull of the polygons vertices, and that of its edges
14.
Star-shaped polygon
–
A star-shaped polygon is a polygonal region in the plane that is a star domain, that is, a polygon that contains a point from which the entire polygon boundary is visible. Formally, a polygon P is star-shaped if there exists a point z such that for each point p of P the segment zp lies entirely within P, the set of all points z with this property is called the kernel of P. If a star-shaped polygon is convex, the distance between any two of its points is 1, and so the polygons link diameter is 1. Convex polygons are star shaped, and a convex polygon coincides with its own kernel, regular star polygons are star-shaped, with their center always in the kernel. Antiparallelograms and self-intersecting Lemoine hexagons are star-shaped, with the kernel consisting of a single point, visibility polygons are star-shaped as every point within them must be visible to the center by definition. The kernel of a polygon is the intersection of all its interior half-planes, the intersection of an arbitrary set of N half-planes may be found in Θ time using the divide and conquer approach. However, for the case of kernels of polygons, a method is possible
15.
Complex polytope
–
In geometry, a complex polytope is a generalization of a polytope in real space to an analogous structure in a complex Hilbert space, where each real dimension is accompanied by an imaginary one. A complex polytope may be understood as a collection of points, lines, planes, and so on, where every point is the junction of multiple lines, every line of multiple planes. Precise definitions exist only for the regular polytopes, which are configurations. The regular complex polytopes have been characterized, and can be described using a symbolic notation developed by Coxeter. Some complex polytopes which are not fully regular have also been described, the complex line C1 has one dimension with real coordinates and another with imaginary coordinates. Applying real coordinates to both dimensions is said to give it two dimensions over the real numbers, a real plane, with the imaginary axis labelled as such, is called an Argand diagram. Because of this it is called the complex plane. Complex 2-space is thus a four-dimensional space over the reals, a complex n-polytope in complex n-space is the analogue of a real n-polytope in real n-space. There is no natural complex analogue of the ordering of points on a real line, because of this a complex polytope cannot be seen as a contiguous surface and it does not bound an interior in the way that a real polytope does. In the case of polytopes, a precise definition can be made by using the notion of symmetry. For any regular polytope the symmetry group acts transitively on the flags, thus, by definition, regular complex polytopes are configurations in complex unitary space. The regular complex polytopes were discovered by Shephard, and the theory was developed by Coxeter. A complex polytope exists in the space of equivalent dimension. For example, the vertices of a polygon are points in the complex plane C2. Thus, an edge can be given a system consisting of a single complex number. In a regular polytope the vertices incident on the edge are arranged symmetrically about their centroid. So we may assume that the vertices on the edge satisfy the equation x p −1 =0 where p is the number of incident vertices. Thus, in the Argand diagram of the edge, the points lie at the vertices of a regular polygon centered on the origin
16.
Hilbert space
–
The mathematical concept of a Hilbert space, named after David Hilbert, generalizes the notion of Euclidean space. It extends the methods of algebra and calculus from the two-dimensional Euclidean plane. A Hilbert space is a vector space possessing the structure of an inner product that allows length. Furthermore, Hilbert spaces are complete, there are limits in the space to allow the techniques of calculus to be used. Hilbert spaces arise naturally and frequently in mathematics and physics, typically as infinite-dimensional function spaces, the earliest Hilbert spaces were studied from this point of view in the first decade of the 20th century by David Hilbert, Erhard Schmidt, and Frigyes Riesz. They are indispensable tools in the theories of partial differential equations, quantum mechanics, Fourier analysis —and ergodic theory, john von Neumann coined the term Hilbert space for the abstract concept that underlies many of these diverse applications. The success of Hilbert space methods ushered in a very fruitful era for functional analysis, geometric intuition plays an important role in many aspects of Hilbert space theory. Exact analogs of the Pythagorean theorem and parallelogram law hold in a Hilbert space, at a deeper level, perpendicular projection onto a subspace plays a significant role in optimization problems and other aspects of the theory. An element of a Hilbert space can be specified by its coordinates with respect to a set of coordinate axes. When that set of axes is countably infinite, this means that the Hilbert space can also usefully be thought of in terms of the space of sequences that are square-summable. The latter space is often in the literature referred to as the Hilbert space. One of the most familiar examples of a Hilbert space is the Euclidean space consisting of vectors, denoted by ℝ3. The dot product takes two vectors x and y, and produces a real number x·y, If x and y are represented in Cartesian coordinates, then the dot product is defined by ⋅ = x 1 y 1 + x 2 y 2 + x 3 y 3. The dot product satisfies the properties, It is symmetric in x and y, x · y = y · x. It is linear in its first argument, · y = ax1 · y + bx2 · y for any scalars a, b, and vectors x1, x2, and y. It is positive definite, for all x, x · x ≥0, with equality if. An operation on pairs of vectors that, like the dot product, a vector space equipped with such an inner product is known as a inner product space. Every finite-dimensional inner product space is also a Hilbert space, multivariable calculus in Euclidean space relies on the ability to compute limits, and to have useful criteria for concluding that limits exist
17.
Complex number
–
A complex number is a number that can be expressed in the form a + bi, where a and b are real numbers and i is the imaginary unit, satisfying the equation i2 = −1. In this expression, a is the part and b is the imaginary part of the complex number. If z = a + b i, then ℜ z = a, ℑ z = b, Complex numbers extend the concept of the one-dimensional number line to the two-dimensional complex plane by using the horizontal axis for the real part and the vertical axis for the imaginary part. The complex number a + bi can be identified with the point in the complex plane, a complex number whose real part is zero is said to be purely imaginary, whereas a complex number whose imaginary part is zero is a real number. In this way, the numbers are a field extension of the ordinary real numbers. As well as their use within mathematics, complex numbers have applications in many fields, including physics, chemistry, biology, economics, electrical engineering. The Italian mathematician Gerolamo Cardano is the first known to have introduced complex numbers and he called them fictitious during his attempts to find solutions to cubic equations in the 16th century. Complex numbers allow solutions to equations that have no solutions in real numbers. For example, the equation 2 = −9 has no real solution, Complex numbers provide a solution to this problem. The idea is to extend the real numbers with the unit i where i2 = −1. According to the theorem of algebra, all polynomial equations with real or complex coefficients in a single variable have a solution in complex numbers. A complex number is a number of the form a + bi, for example, −3.5 + 2i is a complex number. The real number a is called the part of the complex number a + bi. By this convention the imaginary part does not include the unit, hence b. The real part of a number z is denoted by Re or ℜ. For example, Re = −3.5 Im =2, hence, in terms of its real and imaginary parts, a complex number z is equal to Re + Im ⋅ i. This expression is known as the Cartesian form of z. A real number a can be regarded as a number a + 0i whose imaginary part is 0
18.
Equiangular polygon
–
In Euclidean geometry, an equiangular polygon is a polygon whose vertex angles are equal. If the lengths of the sides are equal then it is a regular polygon. Isogonal polygons are equiangular polygons which alternate two edge lengths, the only equiangular triangle is the equilateral triangle. Rectangles, including the square, are the only equiangular quadrilaterals, for a convex equiangular n-gon each internal angle is 180°, this is the equiangular polygon theorem. A rectangle with integer side lengths may be tiled by squares. A cyclic polygon is equiangular if and only if the sides are equal. Thus if n is odd, a polygon is equiangular if. For prime p, every integer-sided equiangular p-gon is regular, moreover, every integer-sided equiangular pk-gon has p-fold rotational symmetry. The Geometrical Foundation of Natural Structure, A Source Book of Design, P.32 A Property of Equiangular Polygons, What Is It About. A discussion of Vivianis theorem at Cut-the-knot
19.
Circumscribed circle
–
In geometry, the circumscribed circle or circumcircle of a polygon is a circle which passes through all the vertices of the polygon. The center of circle is called the circumcenter and its radius is called the circumradius. A polygon which has a circle is called a cyclic polygon. All regular simple polygons, all isosceles trapezoids, all triangles, a related notion is the one of a minimum bounding circle, which is the smallest circle that completely contains the polygon within it. All triangles are cyclic, i. e. every triangle has a circumscribed circle and this can be proven on the grounds that the general equation for a circle with center and radius r in the Cartesian coordinate system is 2 +2 = r 2. Since this equation has three parameters only three points coordinate pairs are required to determine the equation of a circle, since a triangle is defined by its three vertices, and exactly three points are required to determine a circle, every triangle can be circumscribed. The circumcenter of a triangle can be constructed by drawing any two of the three perpendicular bisectors, the center is the point where the perpendicular bisectors intersect, and the radius is the length to any of the three vertices. This is because the circumcenter is equidistant from any pair of the triangles vertices, in coastal navigation, a triangles circumcircle is sometimes used as a way of obtaining a position line using a sextant when no compass is available. The horizontal angle between two landmarks defines the circumcircle upon which the observer lies, in the Euclidean plane, it is possible to give explicitly an equation of the circumcircle in terms of the Cartesian coordinates of the vertices of the inscribed triangle. Suppose that A = B = C = are the coordinates of points A, B, using the polarization identity, these equations reduce to the condition that the matrix has a nonzero kernel. Thus the circumcircle may alternatively be described as the locus of zeros of the determinant of this matrix, a similar approach allows one to deduce the equation of the circumsphere of a tetrahedron. A unit vector perpendicular to the containing the circle is given by n ^ = × | × |. An equation for the circumcircle in trilinear coordinates x, y, z is a/x + b/y + c/z =0, an equation for the circumcircle in barycentric coordinates x, y, z is a2/x + b2/y + c2/z =0. The isogonal conjugate of the circumcircle is the line at infinity, given in coordinates by ax + by + cz =0. Additionally, the circumcircle of a triangle embedded in d dimensions can be using a generalized method. Let A, B, and C be d-dimensional points, which form the vertices of a triangle and we start by transposing the system to place C at the origin, a = A − C, b = B − C. The circumcenter, p0, is given by p 0 = ×2 ∥ a × b ∥2 + C, the Cartesian coordinates of the circumcenter are U x =1 D U y =1 D with D =2. Without loss of generality this can be expressed in a form after translation of the vertex A to the origin of the Cartesian coordinate systems
20.
Circle
–
A circle is a simple closed shape in Euclidean geometry. The distance between any of the points and the centre is called the radius, a circle is a simple closed curve which divides the plane into two regions, an interior and an exterior. Annulus, the object, the region bounded by two concentric circles. Arc, any connected part of the circle, centre, the point equidistant from the points on the circle. Chord, a segment whose endpoints lie on the circle. Circumference, the length of one circuit along the circle, or the distance around the circle and it is a special case of a chord, namely the longest chord, and it is twice the radius. Disc, the region of the bounded by a circle. Lens, the intersection of two discs, passant, a coplanar straight line that does not touch the circle. Radius, a line segment joining the centre of the circle to any point on the circle itself, or the length of such a segment, sector, a region bounded by two radii and an arc lying between the radii. Segment, a region, not containing the centre, bounded by a chord, secant, an extended chord, a coplanar straight line cutting the circle at two points. Semicircle, an arc that extends from one of a diameters endpoints to the other, in non-technical common usage it may mean the diameter, arc, and its interior, a two dimensional region, that is technically called a half-disc. A half-disc is a case of a segment, namely the largest one. Tangent, a straight line that touches the circle at a single point. The word circle derives from the Greek κίρκος/κύκλος, itself a metathesis of the Homeric Greek κρίκος, the origins of the words circus and circuit are closely related. The circle has been known since before the beginning of recorded history, natural circles would have been observed, such as the Moon, Sun, and a short plant stalk blowing in the wind on sand, which forms a circle shape in the sand. The circle is the basis for the wheel, which, with related inventions such as gears, in mathematics, the study of the circle has helped inspire the development of geometry, astronomy and calculus. Some highlights in the history of the circle are,1700 BCE – The Rhind papyrus gives a method to find the area of a circular field. The result corresponds to 256/81 as a value of π.300 BCE – Book 3 of Euclids Elements deals with the properties of circles
21.
Isogonal figure
–
In geometry, a polytope is isogonal or vertex-transitive if, loosely speaking, all its vertices are equivalent. That implies that each vertex is surrounded by the kinds of face in the same or reverse order. Technically, we say that for any two vertices there exists a symmetry of the polytope mapping the first isometrically onto the second. Other ways of saying this are that the group of automorphisms of the polytope is transitive on its vertices, all vertices of a finite n-dimensional isogonal figure exist on an -sphere. The term isogonal has long used for polyhedra. Vertex-transitive is a synonym borrowed from modern ideas such as symmetry groups, all regular polygons, apeirogons and regular star polygons are isogonal. The dual of a polygon is an isotoxal polygon. Some even-sided polygons and apeirogons which alternate two edge lengths, for example a rectangle, are isogonal, all planar isogonal 2n-gons have dihedral symmetry with reflection lines across the mid-edge points. An isogonal polyhedron and 2D tiling has a kind of vertex. An isogonal polyhedron with all faces is also a uniform polyhedron. Geometrically distorted variations of uniform polyhedra and tilings can also be given the vertex configuration, isogonal polyhedra and 2D tilings may be further classified, Regular if it is also isohedral and isotoxal, this implies that every face is the same kind of regular polygon. Quasi-regular if it is also isotoxal but not isohedral, semi-regular if every face is a regular polygon but it is not isohedral or isotoxal. Uniform if every face is a polygon, i. e. it is regular, quasiregular or semi-regular. Noble if it is also isohedral and these definitions can be extended to higher-dimensional polytopes and tessellations. Most generally, all uniform polytopes are isogonal, for example, the dual of an isogonal polytope is called an isotope which is transitive on its facets. A polytope or tiling may be called if its vertices form k transitivity classes. A more restrictive term, k-uniform is defined as a figure constructed only from regular polygons. They can be represented visually with colors by different uniform colorings, edge-transitive Face-transitive Peter R. Cromwell, Polyhedra, Cambridge University Press 1997, ISBN 0-521-55432-2, p.369 Transitivity Grünbaum, Branko, Shephard, G. C
22.
Group action
–
In mathematics, an action of a group is a way of interpreting the elements of the group as acting on some space in a way that preserves the structure of that space. Common examples of spaces that groups act on are sets, vector spaces, actions of groups on vector spaces are called representations of the group. Some groups can be interpreted as acting on spaces in a canonical way, more generally, symmetry groups such as the homeomorphism group of a topological space or the general linear group of a vector space, as well as their subgroups, also admit canonical actions. A common way of specifying non-canonical actions is to describe a homomorphism φ from a group G to the group of symmetries of a set X. The action of an element g ∈ G on a point x ∈ X is assumed to be identical to the action of its image φ ∈ Sym on the point x. The homomorphism φ is also called the action of G. Thus, if G is a group and X is a set, if X has additional structure, then φ is only called an action if for each g ∈ G, the permutation φ preserves the structure of X. The abstraction provided by group actions is a one, because it allows geometrical ideas to be applied to more abstract objects. Many objects in mathematics have natural group actions defined on them, in particular, groups can act on other groups, or even on themselves. Because of this generality, the theory of group actions contains wide-reaching theorems, such as the orbit stabilizer theorem, the group G is said to act on X. The set X is called a G-set. In complete analogy, one can define a group action of G on X as an operation X × G → X mapping to x. g. =. h for all g, h in G and all x in X, for a left action h acts first and is followed by g, while for a right action g acts first and is followed by h. Because of the formula −1 = h−1g−1, one can construct an action from a right action by composing with the inverse operation of the group. Also, an action of a group G on X is the same thing as a left action of its opposite group Gop on X. It is thus sufficient to only consider left actions without any loss of generality. The trivial action of any group G on any set X is defined by g. x = x for all g in G and all x in X, that is, every group element induces the identity permutation on X. In every group G, left multiplication is an action of G on G, g. x = gx for all g, x in G
23.
Equilateral polygon
–
In geometry, three or more than three straight lines make a polygon and an equilateral polygon is a polygon which has all sides of the same length. Except in the case, it need not be equiangular. If the number of sides is at least five, an equilateral polygon need not be a convex polygon, all regular polygons and isotoxal polygons are equilateral. An equilateral triangle is a triangle with 60° internal angles. An equilateral quadrilateral is called a rhombus, an isotoxal polygon described by an angle α and it includes the square as a special case. A convex equilateral pentagon can be described by two angles α and β, which determine the other angles. Concave equilateral pentagons exist, as do concave equilateral polygons with any number of sides. An equilateral polygon which is cyclic is a regular polygon, a tangential polygon is equilateral if and only if the alternate angles are equal. Thus if the number of n is odd, a tangential polygon is equilateral if. The principal diagonals of a hexagon each divide the hexagon into quadrilaterals, in any convex equilateral hexagon with common side a, there exists a principal diagonal d1 such that d 1 a ≤2 and a principal diagonal d2 such that d 2 a >3. Triambi are equilateral hexagons with trigonal symmetry, Equilateral triangle With interactive animation A Property of Equiangular Polygons, a discussion of Vivianis theorem at Cut-the-knot
24.
Tangential polygon
–
In Euclidean geometry, a tangential polygon, also known as a circumscribed polygon, is a convex polygon that contains an inscribed circle. This is a circle that is tangent to each of the polygons sides, the dual polygon of a tangential polygon is a cyclic polygon, which has a circumscribed circle passing through each of its vertices. All triangles are tangential, as are all regular polygons with any number of sides, a well-studied group of tangential polygons are the tangential quadrilaterals, which include the rhombi and kites. A convex polygon has an incircle if and only if all of its internal angle bisectors are concurrent and this common point is the incenter. There exists a tangential polygon of n sequential sides a1. An if and only if the system of equations x 1 + x 2 = a 1, x 2 + x 3 = a 2, …, x n + x 1 = a n has a solution in positive reals. If such a solution exists, then x1, xn are the tangent lengths of the polygon. If the number n of sides is odd, then for any set of sidelengths a 1, …. But if n is even there are an infinitude of them, for example, in the quadrilateral case where all sides are equal we can have a rhombus with any value of the acute angles, and all rhombi are tangential to an incircle. If the n sides of a polygon are a1. An, the inradius is r = K s =2 K ∑ i =1 n a i where K is the area of the polygon, for a tangential polygon with an odd number of sides, all sides are equal if and only if all angles are equal. A tangential polygon with an number of sides has all sides equal if. In a tangential polygon with an number of sides, the sum of the odd numbered sides lengths is equal to the sum of the even numbered sides lengths. A tangential polygon has an area than any other polygon with the same perimeter. In a tangential hexagon ABCDEF, the main diagonals AD, BE, and CF are concurrent according to Brianchons theorem
25.
Inscribed circle
–
In geometry, the incircle or inscribed circle of a triangle is the largest circle contained in the triangle, it touches the three sides. The center of the incircle is a center called the triangles incenter. An excircle or escribed circle of the triangle is a circle lying outside the triangle, tangent to one of its sides, every triangle has three distinct excircles, each tangent to one of the triangles sides. The center of the incircle, called the incenter, can be found as the intersection of the three angle bisectors. The center of an excircle is the intersection of the internal bisector of one angle, the center of this excircle is called the excenter relative to the vertex A, or the excenter of A. Because the internal bisector of an angle is perpendicular to its external bisector, polygons with more than three sides do not all have an incircle tangent to all sides, those that do are called tangential polygons. See also Tangent lines to circles, suppose △ A B C has an incircle with radius r and center I. The distance from vertex A to the incenter I is, d = c sin cos = b sin cos The trilinear coordinates for a point in the triangle is the ratio of distances to the triangle sides. Because the Incenter is the distance of all sides the trilinear coordinates for the incenter are 1,1,1. The barycentric coordinates for a point in a triangle give weights such that the point is the average of the triangle vertex positions. The Cartesian coordinates of the incenter are an average of the coordinates of the three vertices using the side lengths of the triangle relative to the perimeter—i. e. Using the barycentric coordinates given above, normalized to sum to unity—as weights. If the three vertices are located at, and, and the sides opposite these vertices have corresponding lengths a, b, additionally, I A ⋅ I B ⋅ I C =4 R r 2, where R and r are the triangles circumradius and inradius respectively. The collection of triangle centers may be given the structure of a group under multiplication of trilinear coordinates, in this group. Then the incircle has the radius r = x y z x + y + z, the product of the incircle radius r and the circumcircle radius R of a triangle with sides a, b, and c is r R = a b c 2. Some relations among the sides, incircle radius, and circumcircle radius are, a b + b c + c a = s 2 + r, any line through a triangle that splits both the triangles area and its perimeter in half goes through the triangles incenter. There are either one, two, or three of these for any given triangle, the distance from any vertex to the incircle tangency on either adjacent side is half the sum of the vertexs adjacent sides minus half the opposite side. Thus for example for vertex B and adjacent tangencies TA and TC, the incircle radius is no greater than one-ninth the sum of the altitudes
26.
Isotoxal figure
–
In geometry, a polytope, or a tiling, is isotoxal or edge-transitive if its symmetries act transitively on its edges. The term isotoxal is derived from the Greek τοξον meaning arc, an isotoxal polygon is an equilateral polygon, but not all equilateral polygons are isotoxal. The duals of isotoxal polygons are isogonal polygons, in general, an isotoxal 2n-gon will have Dn dihedral symmetry. A rhombus is a polygon with D2 symmetry. All regular polygons are isotoxal, having double the symmetry order. A regular 2n-gon is a polygon and can be marked with alternately colored vertices. An isotoxal polyhedron or tiling must be either isogonal or isohedral or both, regular polyhedra are isohedral, isogonal and isotoxal. Quasiregular polyhedra are isogonal and isotoxal, but not isohedral, their duals are isohedral and isotoxal, not every polyhedron or 2-dimensional tessellation constructed from regular polygons is isotoxal. An isotoxal polyhedron has the dihedral angle for all edges. There are nine convex isotoxal polyhedra formed from the Platonic solids,8 formed by the Kepler–Poinsot polyhedra, cS1 maint, Multiple names, authors list Coxeter, Harold Scott MacDonald, Longuet-Higgins, M. S. Miller, J. C. P. Uniform polyhedra, Philosophical Transactions of the Royal Society of London, mathematical and Physical Sciences,246, 401–450, doi,10. 1098/rsta.1954.0003, ISSN 0080-4614, JSTOR91532, MR0062446
27.
Regular polygon
–
In Euclidean geometry, a regular polygon is a polygon that is equiangular and equilateral. Regular polygons may be convex or star, in the limit, a sequence of regular polygons with an increasing number of sides becomes a circle, if the perimeter is fixed, or a regular apeirogon, if the edge length is fixed. These properties apply to all regular polygons, whether convex or star, a regular n-sided polygon has rotational symmetry of order n. All vertices of a regular polygon lie on a common circle and that is, a regular polygon is a cyclic polygon. Together with the property of equal-length sides, this implies that every regular polygon also has a circle or incircle that is tangent to every side at the midpoint. Thus a regular polygon is a tangential polygon, a regular n-sided polygon can be constructed with compass and straightedge if and only if the odd prime factors of n are distinct Fermat primes. The symmetry group of a regular polygon is dihedral group Dn, D2, D3. It consists of the rotations in Cn, together with reflection symmetry in n axes that pass through the center, if n is even then half of these axes pass through two opposite vertices, and the other half through the midpoint of opposite sides. If n is odd then all pass through a vertex. All regular simple polygons are convex and those having the same number of sides are also similar. An n-sided convex regular polygon is denoted by its Schläfli symbol, for n <3 we have two degenerate cases, Monogon, degenerate in ordinary space. Digon, a line segment, degenerate in ordinary space. In certain contexts all the polygons considered will be regular, in such circumstances it is customary to drop the prefix regular. For instance, all the faces of uniform polyhedra must be regular, for n >2 the number of diagonals is n 2, i. e.0,2,5,9. for a triangle, square, pentagon, hexagon. The diagonals divide the polygon into 1,4,11,24, for a regular n-gon inscribed in a unit-radius circle, the product of the distances from a given vertex to all other vertices equals n. For a regular simple n-gon with circumradius R and distances di from a point in the plane to the vertices. For a regular n-gon, the sum of the distances from any interior point to the n sides is n times the apothem. This is a generalization of Vivianis theorem for the n=3 case, the sum of the perpendiculars from a regular n-gons vertices to any line tangent to the circumcircle equals n times the circumradius
28.
Rectilinear polygon
–
A rectilinear polygon is a polygon all of whose edge intersections are at right angles. Thus the interior angle at each vertex is either 90° or 270°, rectilinear polygons are a special case of isothetic polygons. In many cases another definition is preferable, a polygon is a polygon with sides parallel to the axes of Cartesian coordinates. The distinction becomes crucial when spoken about sets of polygons, the definition would imply that sides of all polygons in the set are aligned with the same coordinate axes. Within the framework of the definition it is natural to speak of horizontal edges. Rectilinear polygons are also known as orthogonal polygons, other terms in use are iso-oriented, axis-aligned, and axis-oriented polygons. The importance of the class of rectilinear polygons comes from the following and they are convenient for the representation of shapes in integrated circuit mask layouts due to their simplicity for design and manufacturing. Many manufactured objects result in orthogonal polygons, problems in computational geometry stated in terms of polygons often allow for more efficient algorithms when restricted to orthogonal polygons. An example is provided by the art gallery theorem for orthogonal polygons, a rectilinear polygon has edges of two types, horizontal and vertical. Lemma, The number of edges is equal to the number of vertical edges. Corollary, Orthogonal polygons have a number of edges. A rectilinear polygon has corners of two types, corners in which the angle is interior to the polygon are called convex. A knob is an edge whose two endpoints are convex corners, an antiknob is an edge whose two endpoints are concave corners. A rectilinear polygon that is simple is also called hole-free because it has no holes - only a single continuous boundary. It has several interesting properties, The number of convex corners is four more than the number of concave corners, to see why, imagine that you traverse the boundary of the polygon clockwise. At a convex corner, you turn 90° right, at any concave corner, finally you must make an entire 360° turn and come back to the original point, hence the number of right turns must be 4 more than the number of left turns. Corollary, every rectilinear polygon has at least 4 convex corners, the number of knobs is four more than the number of antiknobs. To see why, let X be the number of convex corners and Y the number of concave corners. Let XX the number of convex corners followed by a corner, XY the number of convex corners followed by a concave corner, YX
29.
Monotone polygon
–
In geometry, a polygon P in the plane is called monotone with respect to a straight line L, if every line orthogonal to L intersects P at most twice. Similarly, a polygonal chain C is called monotone with respect to a straight line L, following the terminology for monotone functions, the former definition describes polygons strictly monotone with respect to L. Assume that L coincides with the x-axis, in fact, this property may be taken for the definition of monotone polygon and it gives the polygon its name. A convex polygon is monotone with respect to any straight line, a linear time algorithm is known to report all directions in which a given simple polygon is monotone. A monotone polygon may be triangulated in linear time. For a given set of points in the plane, a tour is a monotone polygon that connects the points. The minimum perimeter bitonic tour for a point set with respect to a fixed direction may be found in polynomial time using dynamic programming. It is easily shown that such a minimal bitonic tour is a simple polygon, a simple polygon may be easily cut into monotone polygons in O time. However, since a triangle is a polygon, polygon triangulation is in fact cutting a polygon into monotone ones. Cutting a simple polygon into the number of uniformly monotone polygons can be performed in polynomial time. In the context of planning, two nonintersecting monotone polygons are separable by a single translation and this separation may be found in linear time. A polygon is called sweepable, if a line may be continuously moved over the whole polygon in such a way that at any moment its intersection with the polygonal area is a convex set. A monotone polygon is sweepable by a line which does not change its orientation during the sweep, a polygon is strictly sweepable if no portion of its area is swept more than once. Both types of sweepability are recognized in quadratic time, there is no single straightforward generalization of polygon monotonicity to higher dimensions. In one approach the preserved monotonicity trait is the line L, a three-dimensional polyhedron is called weakly monotonic in direction L if all cross-sections orthogonal to L are simple polygons. If the cross-sections are convex, then the polyhedron is called weakly monotonic in convex sense, both types may be recognized in polynomial time. In another approach the preserved one-dimensional trait is the orthogonal direction and this gives rise for the notion of polyhedral terrain in three dimensions, a polyhedral surface with the property that each vertical line intersects the surface at most by one point or segment. Orthogonal convexity, for polygons which are monotone simultaneously with respect to two orthogonal directions, also a generalization for any number of fixed directions
30.
Euclidean geometry
–
Euclidean geometry is a mathematical system attributed to the Alexandrian Greek mathematician Euclid, which he described in his textbook on geometry, the Elements. Euclids method consists in assuming a set of intuitively appealing axioms. Although many of Euclids results had been stated by earlier mathematicians, Euclid was the first to show how these propositions could fit into a comprehensive deductive and logical system. The Elements begins with plane geometry, still taught in school as the first axiomatic system. It goes on to the geometry of three dimensions. Much of the Elements states results of what are now called algebra and number theory, for more than two thousand years, the adjective Euclidean was unnecessary because no other sort of geometry had been conceived. Euclids axioms seemed so obvious that any theorem proved from them was deemed true in an absolute, often metaphysical. Today, however, many other self-consistent non-Euclidean geometries are known, Euclidean geometry is an example of synthetic geometry, in that it proceeds logically from axioms to propositions without the use of coordinates. This is in contrast to analytic geometry, which uses coordinates, the Elements is mainly a systematization of earlier knowledge of geometry. Its improvement over earlier treatments was recognized, with the result that there was little interest in preserving the earlier ones. There are 13 total books in the Elements, Books I–IV, Books V and VII–X deal with number theory, with numbers treated geometrically via their representation as line segments with various lengths. Notions such as numbers and rational and irrational numbers are introduced. The infinitude of prime numbers is proved, a typical result is the 1,3 ratio between the volume of a cone and a cylinder with the same height and base. Euclidean geometry is a system, in which all theorems are derived from a small number of axioms. To produce a straight line continuously in a straight line. To describe a circle with any centre and distance and that all right angles are equal to one another. Although Euclids statement of the only explicitly asserts the existence of the constructions. The Elements also include the five common notions, Things that are equal to the same thing are also equal to one another
31.
Internal and external angles
–
In geometry, an angle of a polygon is formed by two sides of the polygon that share an endpoint. For a simple polygon, regardless of whether it is convex or non-convex, a polygon has exactly one internal angle per vertex. If every internal angle of a polygon is less than 180°. In contrast, an angle is an angle formed by one side of a simple polygon. The sum of the angle and the external angle on the same vertex is 180°. The sum of all the angles of a simple polygon is 180° where n is the number of sides. The formula can be proved using induction and starting with a triangle for which the angle sum is 180°. The sum of the angles of any simple convex or non-convex polygon is 360°. The interior angle concept can be extended in a consistent way to crossed polygons such as star polygons by using the concept of directed angles, in other words, 360k° represents the sum of all the exterior angles. For example, for convex and concave polygons k =1, since the exterior angle sum is 360°
32.
Pi
–
The number π is a mathematical constant, the ratio of a circles circumference to its diameter, commonly approximated as 3.14159. It has been represented by the Greek letter π since the mid-18th century, being an irrational number, π cannot be expressed exactly as a fraction. Still, fractions such as 22/7 and other numbers are commonly used to approximate π. The digits appear to be randomly distributed, in particular, the digit sequence of π is conjectured to satisfy a specific kind of statistical randomness, but to date no proof of this has been discovered. Also, π is a number, i. e. a number that is not the root of any non-zero polynomial having rational coefficients. This transcendence of π implies that it is impossible to solve the ancient challenge of squaring the circle with a compass, ancient civilizations required fairly accurate computed values for π for practical reasons. It was calculated to seven digits, using techniques, in Chinese mathematics. The extensive calculations involved have also used to test supercomputers. Because its definition relates to the circle, π is found in many formulae in trigonometry and geometry, especially those concerning circles, ellipses, and spheres. Because of its role as an eigenvalue, π appears in areas of mathematics. It is also found in cosmology, thermodynamics, mechanics, attempts to memorize the value of π with increasing precision have led to records of over 70,000 digits. In English, π is pronounced as pie, in mathematical use, the lowercase letter π is distinguished from its capitalized and enlarged counterpart ∏, which denotes a product of a sequence, analogous to how ∑ denotes summation. The choice of the symbol π is discussed in the section Adoption of the symbol π, π is commonly defined as the ratio of a circles circumference C to its diameter d, π = C d The ratio C/d is constant, regardless of the circles size. For example, if a circle has twice the diameter of another circle it will also have twice the circumference, preserving the ratio C/d. This definition of π implicitly makes use of geometry, although the notion of a circle can be extended to any curved geometry. Here, the circumference of a circle is the arc length around the perimeter of the circle, a quantity which can be defined independently of geometry using limits. An integral such as this was adopted as the definition of π by Karl Weierstrass, definitions of π such as these that rely on a notion of circumference, and hence implicitly on concepts of the integral calculus, are no longer common in the literature. One such definition, due to Richard Baltzer, and popularized by Edmund Landau, is the following, the cosine can be defined independently of geometry as a power series, or as the solution of a differential equation
33.
Radian
–
The radian is the standard unit of angular measure, used in many areas of mathematics. The length of an arc of a circle is numerically equal to the measurement in radians of the angle that it subtends. The unit was formerly an SI supplementary unit, but this category was abolished in 1995, separately, the SI unit of solid angle measurement is the steradian. The radian is represented by the symbol rad, so for example, a value of 1.2 radians could be written as 1.2 rad,1.2 r,1. 2rad, or 1. 2c. Radian describes the angle subtended by a circular arc as the length of the arc divided by the radius of the arc. One radian is the angle subtended at the center of a circle by an arc that is equal in length to the radius of the circle. Conversely, the length of the arc is equal to the radius multiplied by the magnitude of the angle in radians. As the ratio of two lengths, the radian is a number that needs no unit symbol, and in mathematical writing the symbol rad is almost always omitted. When quantifying an angle in the absence of any symbol, radians are assumed, and it follows that the magnitude in radians of one complete revolution is the length of the entire circumference divided by the radius, or 2πr / r, or 2π. Thus 2π radians is equal to 360 degrees, meaning that one radian is equal to 180/π degrees, the concept of radian measure, as opposed to the degree of an angle, is normally credited to Roger Cotes in 1714. He described the radian in everything but name, and he recognized its naturalness as a unit of angular measure, the idea of measuring angles by the length of the arc was already in use by other mathematicians. For example, al-Kashi used so-called diameter parts as units where one part was 1/60 radian. The term radian first appeared in print on 5 June 1873, in examination questions set by James Thomson at Queens College, Belfast. He had used the term as early as 1871, while in 1869, Thomas Muir, then of the University of St Andrews, in 1874, after a consultation with James Thomson, Muir adopted radian. As stated, one radian is equal to 180/π degrees, thus, to convert from radians to degrees, multiply by 180/π. The length of circumference of a circle is given by 2 π r, so, to convert from radians to gradians multiply by 200 / π, and to convert from gradians to radians multiply by π /200. This is because radians have a mathematical naturalness that leads to a more elegant formulation of a number of important results, most notably, results in analysis involving trigonometric functions are simple and elegant when the functions arguments are expressed in radians. Because of these and other properties, the trigonometric functions appear in solutions to problems that are not obviously related to the functions geometrical meanings
34.
Degree (angle)
–
A degree, usually denoted by °, is a measurement of a plane angle, defined so that a full rotation is 360 degrees. It is not an SI unit, as the SI unit of measure is the radian. Because a full rotation equals 2π radians, one degree is equivalent to π/180 radians, the original motivation for choosing the degree as a unit of rotations and angles is unknown. One theory states that it is related to the fact that 360 is approximately the number of days in a year. Ancient astronomers noticed that the sun, which follows through the path over the course of the year. Some ancient calendars, such as the Persian calendar, used 360 days for a year, the use of a calendar with 360 days may be related to the use of sexagesimal numbers. The earliest trigonometry, used by the Babylonian astronomers and their Greek successors, was based on chords of a circle, a chord of length equal to the radius made a natural base quantity. One sixtieth of this, using their standard sexagesimal divisions, was a degree, Aristarchus of Samos and Hipparchus seem to have been among the first Greek scientists to exploit Babylonian astronomical knowledge and techniques systematically. Timocharis, Aristarchus, Aristillus, Archimedes, and Hipparchus were the first Greeks known to divide the circle in 360 degrees of 60 arc minutes, eratosthenes used a simpler sexagesimal system dividing a circle into 60 parts. Furthermore, it is divisible by every number from 1 to 10 except 7 and this property has many useful applications, such as dividing the world into 24 time zones, each of which is nominally 15° of longitude, to correlate with the established 24-hour day convention. Finally, it may be the case more than one of these factors has come into play. For many practical purposes, a degree is a small enough angle that whole degrees provide sufficient precision. When this is not the case, as in astronomy or for geographic coordinates, degree measurements may be written using decimal degrees, with the symbol behind the decimals. Alternatively, the sexagesimal unit subdivisions can be used. One degree is divided into 60 minutes, and one minute into 60 seconds, use of degrees-minutes-seconds is also called DMS notation. These subdivisions, also called the arcminute and arcsecond, are represented by a single and double prime. For example,40. 1875° = 40° 11′ 15″, or, using quotation mark characters, additional precision can be provided using decimals for the arcseconds component. The older system of thirds, fourths, etc. which continues the sexagesimal unit subdivision, was used by al-Kashi and other ancient astronomers, but is rarely used today
35.
Angle
–
In planar geometry, an angle is the figure formed by two rays, called the sides of the angle, sharing a common endpoint, called the vertex of the angle. Angles formed by two rays lie in a plane, but this plane does not have to be a Euclidean plane, Angles are also formed by the intersection of two planes in Euclidean and other spaces. Angles formed by the intersection of two curves in a plane are defined as the angle determined by the tangent rays at the point of intersection. Similar statements hold in space, for example, the angle formed by two great circles on a sphere is the dihedral angle between the planes determined by the great circles. Angle is also used to designate the measure of an angle or of a rotation and this measure is the ratio of the length of a circular arc to its radius. In the case of an angle, the arc is centered at the vertex. In the case of a rotation, the arc is centered at the center of the rotation and delimited by any other point and its image by the rotation. The word angle comes from the Latin word angulus, meaning corner, cognate words are the Greek ἀγκύλος, meaning crooked, curved, both are connected with the Proto-Indo-European root *ank-, meaning to bend or bow. Euclid defines a plane angle as the inclination to each other, in a plane, according to Proclus an angle must be either a quality or a quantity, or a relationship. In mathematical expressions, it is common to use Greek letters to serve as variables standing for the size of some angle, lower case Roman letters are also used, as are upper case Roman letters in the context of polygons. See the figures in this article for examples, in geometric figures, angles may also be identified by the labels attached to the three points that define them. For example, the angle at vertex A enclosed by the rays AB, sometimes, where there is no risk of confusion, the angle may be referred to simply by its vertex. However, in geometrical situations it is obvious from context that the positive angle less than or equal to 180 degrees is meant. Otherwise, a convention may be adopted so that ∠BAC always refers to the angle from B to C. Angles smaller than an angle are called acute angles. An angle equal to 1/4 turn is called a right angle, two lines that form a right angle are said to be normal, orthogonal, or perpendicular. Angles larger than an angle and smaller than a straight angle are called obtuse angles. An angle equal to 1/2 turn is called a straight angle, Angles larger than a straight angle but less than 1 turn are called reflex angles
36.
Turn (geometry)
–
A turn is a unit of plane angle measurement equal to 2π radians, 360° or 400 gon. A turn is also referred to as a revolution or complete rotation or full circle or cycle or rev or rot, a turn can be subdivided in many different ways, into half turns, quarter turns, centiturns, milliturns, binary angles, points etc. A turn can be divided in 100 centiturns or 1000 milliturns, with each corresponding to an angle of 0. 36°. A protractor divided in centiturns is normally called a percentage protractor, binary fractions of a turn are also used. Sailors have traditionally divided a turn into 32 compass points, the binary degree, also known as the binary radian, is 1⁄256 turn. The binary degree is used in computing so that an angle can be represented to the maximum possible precision in a single byte, other measures of angle used in computing may be based on dividing one whole turn into 2n equal parts for other values of n. The notion of turn is used for planar rotations. Two special rotations have acquired appellations of their own, a rotation through 180° is commonly referred to as a half-turn, the word turn originates via Latin and French from the Greek word τόρνος. In 1697, David Gregory used π/ρ to denote the perimeter of a divided by its radius. However, earlier in 1647, William Oughtred had used δ/π for the ratio of the diameter to perimeter, the first use of the symbol π on its own with its present meaning was in 1706 by the Welsh mathematician William Jones. Euler adopted the symbol with that meaning in 1737, leading to its widespread use, percentage protractors have existed since 1922, but the terms centiturns and milliturns were introduced much later by Sir Fred Hoyle. The German standard DIN1315 proposed the unit symbol pla for turns, since 2011, the HP 39gII and HP Prime support the unit symbol tr for turns. In 2016, support for turns was also added to newRPL for the HP 50g, one turn is equal to 2π radians. In 1958, Albert Eagle proposed the Greek letter tau τ as a symbol for 1/2π and his proposal used a pi with three legs symbol to denote the constant. In 2010, Michael Hartl proposed to use tau to represent Palais circle constant, τ=2π. First, τ is the number of radians in one turn, which allows fractions of a turn to be expressed directly, for instance. Second, τ visually resembles π, whose association with the constant is unavoidable. Hartls Tau Manifesto gives many examples of formulas that are simpler if tau is used instead of pi, however, a rebuttal was given in The Pi Manifesto, stating a variety of reasons tau should not supplant pi
37.
Pentagram
–
A pentagram is the shape of a five-pointed star drawn with five straight strokes. The word pentagram comes from the Greek word πεντάγραμμον, from πέντε, five + γραμμή, the word pentacle is sometimes used synonymously with pentagram The word pentalpha is a learned modern revival of a post-classical Greek name of the shape. The pentagram is the simplest regular star polygon, the pentagram contains ten points and fifteen line segments. It is represented by the Schläfli symbol, like a regular pentagon, and a regular pentagon with a pentagram constructed inside it, the regular pentagram has as its symmetry group the dihedral group of order 10. The pentagram can be constructed by connecting alternate vertices of a pentagon and it can also be constructed as a stellation of a pentagon, by extending the edges of a pentagon until the lines intersect. Each intersection of edges sections the edges in the golden ratio, also, the ratio of the length of the shorter segment to the segment bounded by the two intersecting edges is φ. As the four-color illustration shows, r e d g r e e n = g r e e n b l u e = b l u e m a g e n t a = φ. The pentagram includes ten isosceles triangles, five acute and five obtuse isosceles triangles, in all of them, the ratio of the longer side to the shorter side is φ. The acute triangles are golden triangles, the obtuse isosceles triangle highlighted via the colored lines in the illustration is a golden gnomon. The pentagram of Venus is the apparent path of the planet Venus as observed from Earth, the tips of the five loops at the center of the figure have the same geometric relationship to one another as the five vertices, or points, of a pentagram. Groups of five intersections of curves, equidistant from the center, have the same geometric relationship. In early monumental Sumerian script, or cuneiform, a pentagram glyph served as a logogram for the word ub, meaning corner, angle, nook, the word Pentemychos was the title of the cosmogony of Pherecydes of Syros. Here, the five corners are where the seeds of Chronos are placed within the Earth in order for the cosmos to appear. The pentangle plays an important symbolic role in the 14th-century English poem Sir Gawain, heinrich Cornelius Agrippa and others perpetuated the popularity of the pentagram as a magic symbol, attributing the five neoplatonic elements to the five points, in typical Renaissance fashion. By the mid-19th century a distinction had developed amongst occultists regarding the pentagrams orientation. With a single point upwards it depicted spirit presiding over the four elements of matter, however, the influential writer Eliphas Levi called it evil whenever the symbol appeared the other way up. It is the goat of lust attacking the heavens with its horns and it is the sign of antagonism and fatality. It is the goat of lust attacking the heavens with its horns, faust, The pentagram thy peace doth mar
38.
Antiparallelogram
–
In geometry, an antiparallelogram is a quadrilateral having, like a parallelogram, two opposite pairs of equal-length sides, but in which the sides of one pair cross each other. The longer of the two pairs will always be the one that crosses, antiparallelograms are also called contraparallelograms or crossed parallelograms. An antiparallelogram is a case of a crossed quadrilateral, which has generally unequal edges. A special form of the antiparallelogram is a rectangle, in which two opposite edges are parallel. Every antiparallelogram has an axis of symmetry through its crossing point, because of this symmetry, it has two pairs of equal angles as well as two pairs of equal sides. Together with the kites and the isosceles trapezoids, antiparallelograms form one of three classes of quadrilaterals with a symmetry axis. The convex hull of an antiparallelogram is a trapezoid, and every antiparallelogram may be formed from the non-parallel sides. Every antiparallelogram is a quadrilateral, meaning that its four vertices all lie on a single circle. The antiparallelograms that form the faces of these dual uniform polyhedra are the same antiparallelograms that form the figure of the original uniform polyhedron. One form of a non-uniform but flexible polyhedron, the Bricard octahedron, in this context it is also called a butterfly or bow-tie linkage. As a linkage, it has a point of instability in which it can be converted into a parallelogram and vice versa. The other moving short edge of the antiparallelogram has as its endpoints the foci of another moving ellipse, for the antiparallelogram formed by the sides and diagonals of a square, it is the lemniscate of Bernoulli. The antiparallelogram is an important feature in the design of Harts inversor, kempe called the nested-antiparallelogram linkage a multiplicator, as it could be used to multiply an angle by an integer. Without bracing an antiparallelogram linkage can be turned into a normal parallelogram and it can be braced to stop this happening using a construction by Abbott and Barton 2004. This construction can be used to fix a problem in Kempes Universality Theorem, for instance, for three bodies, there are five solutions of this type, given by the five Lagrangian points
39.
Orbit (dynamics)
–
In mathematics, in the study of dynamical systems, an orbit is a collection of points related by the evolution function of the dynamical system. The orbit is a subset of the space and the set of all orbits is a partition of the phase space. Understanding the properties of orbits by using topological methods is one of the objectives of the theory of dynamical systems. For discrete-time dynamical systems, the orbits are sequences, for real systems, the orbits are curves, and for holomorphic dynamical systems. An orbit which consists of a point is called constant orbit. A non-constant orbit is called closed or periodic if there exists a t ≠0 in I such that Φ = x, given a real dynamical system, I is an open interval in the real numbers, that is I =. For any x in M γ x +, = is called positive semi-orbit through x and γ x −, = is called negative semi-orbit through x. For a general system, especially in homogeneous dynamics, when one has a nice group G acting on a probability space X in a measure-preserving way. X ⊂ X will be called if the stabilizer S t a b G is a lattice inside G. In addition, a term is a bounded orbit, when the set G. Such questions are related to deep measure-classification theorems. It could be a periodic orbit if it converges to a periodic orbit. Such orbits are not closed because they never truly repeat, an orbit can also be chaotic. These orbits come close to the initial point, but fail to ever converge to a periodic orbit. They exhibit sensitive dependence on conditions, meaning that small differences in the initial value will cause large differences in future points of the orbit. There are other properties of orbits that allow for different classifications, an orbit can be hyperbolic if nearby points approach or diverge from the orbit exponentially fast. Wandering set Phase space method Cobweb plot or Verhulst diagram Periodic points of complex quadratic mappings and multiplier of orbit Orbit portrait Anatole Katok, introduction to the modern theory of dynamical systems
40.
Area
–
Area is the quantity that expresses the extent of a two-dimensional figure or shape, or planar lamina, in the plane. Surface area is its analog on the surface of a three-dimensional object. It is the analog of the length of a curve or the volume of a solid. The area of a shape can be measured by comparing the shape to squares of a fixed size, in the International System of Units, the standard unit of area is the square metre, which is the area of a square whose sides are one metre long. A shape with an area of three square metres would have the area as three such squares. In mathematics, the square is defined to have area one. There are several formulas for the areas of simple shapes such as triangles, rectangles. Using these formulas, the area of any polygon can be found by dividing the polygon into triangles, for shapes with curved boundary, calculus is usually required to compute the area. Indeed, the problem of determining the area of plane figures was a motivation for the historical development of calculus. For a solid such as a sphere, cone, or cylinder. Formulas for the areas of simple shapes were computed by the ancient Greeks. Area plays an important role in modern mathematics, in addition to its obvious importance in geometry and calculus, area is related to the definition of determinants in linear algebra, and is a basic property of surfaces in differential geometry. In analysis, the area of a subset of the plane is defined using Lebesgue measure, in general, area in higher mathematics is seen as a special case of volume for two-dimensional regions. Area can be defined through the use of axioms, defining it as a function of a collection of certain plane figures to the set of real numbers and it can be proved that such a function exists. An approach to defining what is meant by area is through axioms, area can be defined as a function from a collection M of special kind of plane figures to the set of real numbers which satisfies the following properties, For all S in M, a ≥0. If S and T are in M then so are S ∪ T and S ∩ T, if S and T are in M with S ⊆ T then T − S is in M and a = a − a. If a set S is in M and S is congruent to T then T is also in M, every rectangle R is in M. If the rectangle has length h and breadth k then a = hk, let Q be a set enclosed between two step regions S and T
41.
Cartesian coordinates
–
Each reference line is called a coordinate axis or just axis of the system, and the point where they meet is its origin, usually at ordered pair. The coordinates can also be defined as the positions of the projections of the point onto the two axis, expressed as signed distances from the origin. One can use the principle to specify the position of any point in three-dimensional space by three Cartesian coordinates, its signed distances to three mutually perpendicular planes. In general, n Cartesian coordinates specify the point in an n-dimensional Euclidean space for any dimension n and these coordinates are equal, up to sign, to distances from the point to n mutually perpendicular hyperplanes. The invention of Cartesian coordinates in the 17th century by René Descartes revolutionized mathematics by providing the first systematic link between Euclidean geometry and algebra. Using the Cartesian coordinate system, geometric shapes can be described by Cartesian equations, algebraic equations involving the coordinates of the points lying on the shape. For example, a circle of radius 2, centered at the origin of the plane, a familiar example is the concept of the graph of a function. Cartesian coordinates are also tools for most applied disciplines that deal with geometry, including astronomy, physics, engineering. They are the most common system used in computer graphics, computer-aided geometric design. Nicole Oresme, a French cleric and friend of the Dauphin of the 14th Century, used similar to Cartesian coordinates well before the time of Descartes. The adjective Cartesian refers to the French mathematician and philosopher René Descartes who published this idea in 1637 and it was independently discovered by Pierre de Fermat, who also worked in three dimensions, although Fermat did not publish the discovery. Both authors used a single axis in their treatments and have a length measured in reference to this axis. The concept of using a pair of axes was introduced later, after Descartes La Géométrie was translated into Latin in 1649 by Frans van Schooten and these commentators introduced several concepts while trying to clarify the ideas contained in Descartes work. Many other coordinate systems have developed since Descartes, such as the polar coordinates for the plane. The development of the Cartesian coordinate system would play a role in the development of the Calculus by Isaac Newton. The two-coordinate description of the plane was later generalized into the concept of vector spaces. Choosing a Cartesian coordinate system for a one-dimensional space – that is, for a straight line—involves choosing a point O of the line, a unit of length, and an orientation for the line. An orientation chooses which of the two half-lines determined by O is the positive, and which is negative, we say that the line is oriented from the negative half towards the positive half
42.
Centroid
–
In mathematics and physics, the centroid or geometric center of a plane figure is the arithmetic mean position of all the points in the shape. The definition extends to any object in space, its centroid is the mean position of all the points in all of the coordinate directions. Informally, it is the point at which a cutout of the shape could be balanced on the tip of a pin. While in geometry the term barycenter is a synonym for centroid, in astrophysics and astronomy, in physics, the center of mass is the arithmetic mean of all points weighted by the local density or specific weight. If a physical object has uniform density, then its center of mass is the same as the centroid of its shape, in geography, the centroid of a radial projection of a region of the Earths surface to sea level is known as the regions geographical center. The geometric centroid of an object always lies in the object. A non-convex object might have a centroid that is outside the figure itself, the centroid of a ring or a bowl, for example, lies in the objects central void. If the centroid is defined, it is a point of all isometries in its symmetry group. In particular, the centroid of an object lies in the intersection of all its hyperplanes of symmetry. The centroid of many figures can be determined by this principle alone, in particular, the centroid of a parallelogram is the meeting point of its two diagonals. This is not true for other quadrilaterals, for the same reason, the centroid of an object with translational symmetry is undefined, because a translation has no fixed point. The centroid of a triangle is the intersection of the three medians of the triangle and it lies on the triangles Euler line, which also goes through various other key points including the orthocenter and the circumcenter. Any of the three medians through the centroid divides the area in half. Let P be any point in the plane of a triangle with vertices A, B, and C and centroid G. The sum of the squares of the sides equals three times the sum of the squared distances of the centroid from the vertices, A B2 + B C2 + C A2 =3. A triangles centroid is the point that maximizes the product of the distances of a point from the triangles sidelines. For other properties of a centroid, see below. The body is held by the pin inserted at a point near the perimeter, in such a way that it can freely rotate around the pin
43.
Absolute value
–
In mathematics, the absolute value or modulus |x| of a real number x is the non-negative value of x without regard to its sign. Namely, |x| = x for a x, |x| = −x for a negative x. For example, the value of 3 is 3. The absolute value of a number may be thought of as its distance from zero, generalisations of the absolute value for real numbers occur in a wide variety of mathematical settings. For example, a value is also defined for the complex numbers. The absolute value is related to the notions of magnitude, distance. The term absolute value has been used in this sense from at least 1806 in French and 1857 in English, the notation |x|, with a vertical bar on each side, was introduced by Karl Weierstrass in 1841. Other names for absolute value include numerical value and magnitude, in programming languages and computational software packages, the absolute value of x is generally represented by abs, or a similar expression. Thus, care must be taken to interpret vertical bars as an absolute value sign only when the argument is an object for which the notion of an absolute value is defined. For any real number x the value or modulus of x is denoted by |x| and is defined as | x | = { x, if x ≥0 − x. As can be seen from the definition, the absolute value of x is always either positive or zero. Indeed, the notion of a distance function in mathematics can be seen to be a generalisation of the absolute value of the difference. Since the square root notation without sign represents the square root. This identity is used as a definition of absolute value of real numbers. The absolute value has the four fundamental properties, The properties given by equations - are readily apparent from the definition. To see that equation holds, choose ε from so that ε ≥0, some additional useful properties are given below. These properties are either implied by or equivalent to the properties given by equations -, for example, Absolute value is used to define the absolute difference, the standard metric on the real numbers. Since the complex numbers are not ordered, the definition given above for the absolute value cannot be directly generalised for a complex number
44.
Shoelace formula
–
The shoelace formula or shoelace algorithm is a mathematical algorithm to determine the area of a simple polygon whose vertices are described by their Cartesian coordinates in the plane. The user cross-multiplies corresponding coordinates to find the area encompassing the polygon and it is called the shoelace formula because of the constant cross-multiplying for the coordinates making up the polygon, like tying shoelaces. It is also called the shoelace method. It has applications in surveying and forestry, among other areas, the formula was described by Meister in 1769 and by Gauss in 1795. It can be verified by dividing the polygon into triangles, the area formula is derived by taking each edge AB, and calculating the area of triangle ABO with a vertex at the origin O, by taking the cross-product and dividing by 2. The area formula is valid for any non-self-intersecting polygon, which can be convex or concave, N are the vertices of the polygon. This is because the formula can be viewed as a case of Greens Theorem. The user must know the points of the polygon in a Cartesian plane, for example, take a triangle with coordinates. This formula is just the expansion of those given above for the case n =3. Using it, one can find that the area of the triangle equals one half of the value of 10 +32 +7 −4 −35 −16. The number of variables depends on the number of sides of the polygon, for example, a pentagon will be defined up to x5 and y5, A pent. As an example, choose the triangle vertices, and. Then construct the matrix by “walking around” the triangle and ending with the initial point. First, draw diagonal down and to the right slashes, do the same thing with slashes diagonal down and to the left, + + =8. Then take the difference of two numbers, |−| =14. Halving this gives the area of the triangle,7, organizing the numbers like this makes the formula easier to recall and evaluate. With all the slashes drawn, the matrix loosely resembles a shoe with the laces done up, giving rise to the algorithms name
45.
Pick's theorem
–
In the example shown, we have i =7 interior points and b =8 boundary points, so the area is A =7 + 8/2 −1 =7 +4 −1 =10 square units. Note that the theorem as stated above is valid for simple polygons, i. e. ones that consist of a single piece. For a polygon that has h holes, with a boundary in the form of h +1 simple closed curves, the result was first described by Georg Alexander Pick in 1899. The Reeve tetrahedron shows that there is no analogue of Picks theorem in three dimensions that expresses the volume of a polytope by counting its interior and boundary points, however, there is a generalization in higher dimensions via Ehrhart polynomials. The formula also generalizes to surfaces of polyhedra, consider a polygon P and a triangle T, with one edge in common with P. Assume Picks theorem is true for both P and T separately, we want to show that it is true for the polygon PT obtained by adding T to P. Since P and T share an edge, all the points along the edge in common are merged to interior points. So, calling the number of points in common c. From the above follows i P + i T = i P T − and b P + b T = b P T +2 +2. Therefore, if the theorem is true for polygons constructed from n triangles, for general polytopes, it is well known that they can always be triangulated. That this is true in dimension 2 is an easy fact, to finish the proof by mathematical induction, it remains to show that the theorem is true for triangles. Integer points in convex polyhedra Picks Theorem at cut-the-knot Picks Theorem Picks Theorem proof by Tom Davis Picks Theorem by Ed Pegg, Jr. the Wolfram Demonstrations Project
46.
Isoperimetric inequality
–
In mathematics, the isoperimetric inequality is a geometric inequality involving the surface area of a set and its volume. The equality holds when S is a ball in R n, on a plane, i. e. when n =2, the isoperimetric inequality relates square of the circumference of a closed curve and the area of a plane region it encloses. Isoperimetric literally means having the same perimeter, the isoperimetric problem is to determine a plane figure of the largest possible area whose boundary has a specified length. The closely related Didos problem asks for a region of the area bounded by a straight line. It is named after Dido, the founder and first queen of Carthage. The solution to the problem is given by a circle and was known already in Ancient Greece. However, the first mathematically rigorous proof of this fact was obtained only in the 19th century, since then, many other proofs have been found. The isoperimetric problem has been extended in multiple ways, for example, to curves on surfaces, perhaps the most familiar physical manifestation of the 3-dimensional isoperimetric inequality is the shape of a drop of water. Namely, a drop will assume a symmetric round shape. Since the amount of water in a drop is fixed, surface forces the drop into a shape which minimizes the surface area of the drop. The classical isoperimetric problem dates back to antiquity, the problem can be stated as follows, Among all closed curves in the plane of fixed perimeter, which curve maximizes the area of its enclosed region. This question can be shown to be equivalent to the problem, Among all closed curves in the plane enclosing a fixed area. German astronomer and astrologer Johannes Kepler invoked the principle in discussing the morphology of the solar system. Although the circle appears to be a solution to the problem. The first progress toward the solution was made by Swiss geometer Jakob Steiner in 1838, Steiner showed that if a solution existed, then it must be the circle. Steiners proof was completed later by other mathematicians. It can further be shown that any closed curve which is not fully symmetrical can be tilted so that it encloses more area. The one shape that is convex and symmetrical is the circle, although this, in itself