enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Dividing a circle into areas - Wikipedia

    en.wikipedia.org/wiki/Dividing_a_circle_into_areas

    The number of points (n), chords (c) and regions (r G) for first 6 terms of Moser's circle problem. In geometry, the problem of dividing a circle into areas by means of an inscribed polygon with n sides in such a way as to maximise the number of areas created by the edges and diagonals, sometimes called Moser's circle problem (named after Leo Moser), has a solution by an inductive method.

  3. Delaunay triangulation - Wikipedia

    en.wikipedia.org/wiki/Delaunay_triangulation

    For four or more points on the same circle (e.g., the vertices of a rectangle) the Delaunay triangulation is not unique: each of the two possible triangulations that split the quadrangle into two triangles satisfies the "Delaunay condition", i.e., the requirement that the circumcircles of all triangles have empty interiors.

  4. Angular defect - Wikipedia

    en.wikipedia.org/wiki/Angular_defect

    The defect of any of the vertices of a regular dodecahedron (in which three regular pentagons meet at each vertex) is 36°, or π/5 radians, or 1/10 of a circle. Each of the angles measures 108°; three of these meet at each vertex, so the defect is 360° − (108° + 108° + 108°) = 36°.

  5. Pascal's theorem - Wikipedia

    en.wikipedia.org/wiki/Pascal's_theorem

    There exist 5-point, 4-point and 3-point degenerate cases of Pascal's theorem. In a degenerate case, two previously connected points of the figure will formally coincide and the connecting line becomes the tangent at the coalesced point. See the degenerate cases given in the added scheme and the external link on circle geometries.

  6. Concyclic points - Wikipedia

    en.wikipedia.org/wiki/Concyclic_points

    The vertices of every triangle fall on a circle called the circumcircle. (Because of this, some authors define "concyclic" only in the context of four or more points on a circle.) [2] Several other sets of points defined from a triangle are also concyclic, with different circles; see Nine-point circle [3] and Lester's theorem.

  7. Pick's theorem - Wikipedia

    en.wikipedia.org/wiki/Pick's_theorem

    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 ...

  8. Hyperbolic triangle - Wikipedia

    en.wikipedia.org/wiki/Hyperbolic_triangle

    In all the formulas stated below the sides a, b, and c must be measured in absolute length, a unit so that the Gaussian curvature K of the plane is −1. In other words, the quantity R in the paragraph above is supposed to be equal to 1. Trigonometric formulas for hyperbolic triangles depend on the hyperbolic functions sinh, cosh, and tanh.

  9. Signed area - Wikipedia

    en.wikipedia.org/wiki/Signed_area

    The mathematics of ancient Mesopotamia, Egypt, and Greece had no explicit concept of negative numbers or signed areas, but had notions of shapes contained by some boundary lines or curves, whose areas could be computed or compared by pasting shapes together or cutting portions away, amounting to addition or subtraction of areas. [1]