When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Pick's theorem - Wikipedia

    en.wikipedia.org/wiki/Pick's_theorem

    [5] The subdivision of the polygon into triangles forms a planar graph, and Euler's formula + = gives an equation that applies to the number of vertices, edges, and faces of any planar graph. The vertices are just the grid points of the polygon; there are = + of them. The faces are the triangles of the subdivision, and the single region of the ...

  3. Schwarz–Christoffel mapping - Wikipedia

    en.wikipedia.org/wiki/Schwarz–Christoffel_mapping

    In complex analysis, a Schwarz–Christoffel mapping is a conformal map of the upper half-plane or the complex unit disk onto the interior of a simple polygon.Such a map is guaranteed to exist by the Riemann mapping theorem (stated by Bernhard Riemann in 1851); the Schwarz–Christoffel formula provides an explicit construction.

  4. Constructible polygon - Wikipedia

    en.wikipedia.org/wiki/Constructible_polygon

    A regular polygon with n sides can be constructed with ruler, compass, and angle trisector if and only if =, where r, s, k ≥ 0 and where the p i are distinct Pierpont primes greater than 3 (primes of the form +). [8]: Thm. 2 These polygons are exactly the regular polygons that can be constructed with Conic section, and the regular polygons ...

  5. List of polygons - Wikipedia

    en.wikipedia.org/wiki/List_of_polygons

    Individual polygons are named (and sometimes classified) according to the number of sides, combining a Greek-derived numerical prefix with the suffix -gon, e.g. pentagon, dodecagon. The triangle, quadrilateral and nonagon are exceptions, although the regular forms trigon, tetragon, and enneagon are sometimes encountered as well.

  6. Euclidean geometry - Wikipedia

    en.wikipedia.org/wiki/Euclidean_geometry

    defining the distance between two points P = (p x, p y) and Q = (q x, q y) is then known as the Euclidean metric, and other metrics define non-Euclidean geometries. In terms of analytic geometry, the restriction of classical geometry to compass and straightedge constructions means a restriction to first- and second-order equations, e.g., y = 2 ...

  7. E-function - Wikipedia

    en.wikipedia.org/wiki/E-function

    The exponential function is an E-function, in its case c n = 1 for all of the n. If λ is an algebraic number then the Bessel function J λ is an E-function. The sum or product of two E-functions is an E-function. In particular E-functions form a ring. If a is an algebraic number and f(x) is an E-function then f(ax) will be an E-function.

  8. Finite subdivision rule - Wikipedia

    en.wikipedia.org/wiki/Finite_subdivision_rule

    A subdivision rule takes a tiling of the plane by polygons and turns it into a new tiling by subdividing each polygon into smaller polygons. It is finite if there are only finitely many ways that every polygon can subdivide. Each way of subdividing a tile is called a tile type. Each tile type is represented by a label (usually a letter).

  9. Euler characteristic - Wikipedia

    en.wikipedia.org/wiki/Euler_characteristic

    This equation, stated by Euler in 1758, [2] is known as Euler's polyhedron formula. [3] It corresponds to the Euler characteristic of the sphere (i.e. = ), and applies identically to spherical polyhedra. An illustration of the formula on all Platonic polyhedra is given below.