When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Intersection (geometry) - Wikipedia

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

    intersection of two polygons: window test. If one wants to determine the intersection points of two polygons, one can check the intersection of any pair of line segments of the polygons (see above). For polygons with many segments this method is rather time-consuming. In practice one accelerates the intersection algorithm by using window tests ...

  3. Line–line intersection - Wikipedia

    en.wikipedia.org/wiki/Line–line_intersection

    Line–line intersection. Common point (s) shared by two lines in Euclidean geometry. Two intersecting lines. In Euclidean geometry, the intersection of a line and a line can be the empty set, a point, or another line. Distinguishing these cases and finding the intersection have uses, for example, in computer graphics, motion planning, and ...

  4. Convex hull - Wikipedia

    en.wikipedia.org/wiki/Convex_hull

    The convex hull of the red set is the blue and red convex set. In geometry, the convex hull, convex envelope or convex closure[1] of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, or equivalently as the set of all ...

  5. Voronoi diagram - Wikipedia

    en.wikipedia.org/wiki/Voronoi_diagram

    Voronoi diagram. In mathematics, a Voronoi diagram is a partition of a plane into regions close to each of a given set of objects. It can be classified also as a tessellation. In the simplest case, these objects are just finitely many points in the plane (called seeds, sites, or generators). For each seed there is a corresponding region, called ...

  6. Intersecting chords theorem - Wikipedia

    en.wikipedia.org/wiki/Intersecting_chords_theorem

    In Euclidean geometry, the intersecting chords theorem, or just the chord theorem, is a statement that describes a relation of the four line segments created by two intersecting chords within a circle. It states that the products of the lengths of the line segments on each chord are equal. It is Proposition 35 of Book 3 of Euclid 's Elements.

  7. Internal and external angles - Wikipedia

    en.wikipedia.org/wiki/Internal_and_external_angles

    The sum of the internal angle and the external angle on the same vertex is π radians (180°). The sum of all the internal angles of a simple polygon is π (n −2) radians or 180 (n –2) degrees, where n is the number of sides. The formula can be proved by using mathematical induction: starting with a triangle, for which the angle sum is 180 ...

  8. Vertex (geometry) - Wikipedia

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

    A vertex of an angle is the endpoint where two lines or rays come together. In geometry, a vertex (pl.: vertices or vertexes) is a point where two or more curves, lines, or edges meet or intersect. As a consequence of this definition, the point where two lines meet to form an angle and the corners of polygons and polyhedron are vertices. [1][2][3]

  9. Intersection number - Wikipedia

    en.wikipedia.org/wiki/Intersection_number

    In mathematics, and especially in algebraic geometry, the intersection number generalizes the intuitive notion of counting the number of times two curves intersect to higher dimensions, multiple (more than 2) curves, and accounting properly for tangency. One needs a definition of intersection number in order to state results like Bézout's ...