When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Reuleaux triangle - Wikipedia

    en.wikipedia.org/wiki/Reuleaux_triangle

    At any point during this rotation, two of the corners of the Reuleaux triangle touch two adjacent sides of the square, while the third corner of the triangle traces out a curve near the opposite vertex of the square. The shape traced out by the rotating Reuleaux triangle covers approximately 98.8% of the area of the square. [29]

  3. Circular triangle - Wikipedia

    en.wikipedia.org/wiki/Circular_triangle

    The intersection of three circular disks forms a convex circular triangle. For instance, a Reuleaux triangle is a special case of this construction where the three disks are centered on the vertices of an equilateral triangle, with radius equal to the side length of the triangle. However, not every convex circular triangle is formed as an ...

  4. Bézier triangle - Wikipedia

    en.wikipedia.org/wiki/Bézier_triangle

    in accordance with the formulation of the § nth-order Bézier triangle. The corners of the triangle are the points α 3, β 3 and γ 3. The edges of the triangle are themselves Bézier curves, with the same control points as the Bézier triangle. By removing the γu term, a regular Bézier curve results.

  5. Triangle - Wikipedia

    en.wikipedia.org/wiki/Triangle

    A triangle is a polygon with three corners and three sides, one of the basic shapes in geometry. ... A curvilinear triangle is a shape with three curved sides, ...

  6. List of two-dimensional geometric shapes - Wikipedia

    en.wikipedia.org/wiki/List_of_two-dimensional...

    2 Curved. Toggle Curved subsection. 2.1 Composed of circular arcs. ... Primitive Heronian triangle; Right triangle. 30-60-90 triangle; Isosceles right triangle ...

  7. Inscribed square problem - Wikipedia

    en.wikipedia.org/wiki/Inscribed_square_problem

    It is tempting to attempt to solve the inscribed square problem by proving that a special class of well-behaved curves always contains an inscribed square, and then to approximate an arbitrary curve by a sequence of well-behaved curves and infer that there still exists an inscribed square as a limit of squares inscribed in the curves of the sequence.

  8. Polygon triangulation - Wikipedia

    en.wikipedia.org/wiki/Polygon_triangulation

    In computational geometry, polygon triangulation is the partition of a polygonal area (simple polygon) P into a set of triangles, [1] i.e., finding a set of triangles with pairwise non-intersecting interiors whose union is P. Triangulations may be viewed as special cases of planar straight-line graphs.

  9. Incircle and excircles - Wikipedia

    en.wikipedia.org/wiki/Incircle_and_excircles

    The Nagel triangle or extouch triangle of is denoted by the vertices , , and that are the three points where the excircles touch the reference and where is opposite of , etc. This T A T B T C {\displaystyle \triangle T_{A}T_{B}T_{C}} is also known as the extouch triangle of A B C {\displaystyle \triangle ABC} .