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. Vertex (curve) - Wikipedia

    en.wikipedia.org/wiki/Vertex_(curve)

    The dots are the vertices of the curve, each corresponding to a cusp on the evolute. In the geometry of plane curves, a vertex is a point of where the first derivative of curvature is zero. [1] This is typically a local maximum or minimum of curvature, [2] and some authors define a vertex to be more specifically a local extremum of curvature. [3]

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

  6. Vertex (geometry) - Wikipedia

    en.wikipedia.org/wiki/Vertex_(geometry)

    where V is the number of vertices, E is the number of edges, and F is the number of faces. This equation is known as Euler's 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, since a cube has 12 edges and 6 faces, the formula implies that it has eight vertices.

  7. Descartes' theorem - Wikipedia

    en.wikipedia.org/wiki/Descartes'_theorem

    Kissing circles. Given three mutually tangent circles (black), there are, in general, two possible answers (red) as to what radius a fourth tangent circle can have.In geometry, Descartes' theorem states that for every four kissing, or mutually tangent circles, the radii of the circles satisfy a certain quadratic equation.

  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. Truncation (geometry) - Wikipedia

    en.wikipedia.org/wiki/Truncation_(geometry)

    Types of truncation on a square, {4}, showing red original edges, and new truncated edges in cyan. A uniform truncated square is a regular octagon, t{4}={8}. A complete truncated square becomes a new square, with a diagonal orientation. Vertices are sequenced around counterclockwise, 1-4, with truncated pairs of vertices as a and b.