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. Point in polygon - Wikipedia

    en.wikipedia.org/wiki/Point_in_polygon

    A point is inside the polygon if either count of intersections is odd or point lies on an edge of the polygon. If none of the conditions are true, then point lies outside. [4] One way to compute the winding number is to sum up the angles subtended by each side of the polygon. [5] However, this involves costly inverse trigonometric functions ...

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

  5. Trapezoid - Wikipedia

    en.wikipedia.org/wiki/Trapezoid

    In geometry, a trapezoid (/ ˈtræpəzɔɪd /) in North American English, or trapezium (/ trəˈpiːziəm /) in British English, [1][2] is a quadrilateral that has one pair of parallel sides. The parallel sides are called the bases of the trapezoid. The other two sides are called the legs (or the lateral sides) if they are not parallel ...

  6. Convex polygon - Wikipedia

    en.wikipedia.org/wiki/Convex_polygon

    In geometry, a convex polygon is a polygon that is the boundary of a convex set. This means that the line segment between two points of the polygon is contained in the union of the interior and the boundary of the polygon. In particular, it is a simple polygon (not self-intersecting). [1] Equivalently, a polygon is convex if every line that ...

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

  8. Van Aubel's theorem - Wikipedia

    en.wikipedia.org/wiki/Van_Aubel's_theorem

    In plane geometry, Van Aubel's theorem describes a relationship between squares constructed on the sides of a quadrilateral. Starting with a given convex quadrilateral, construct a square, external to the quadrilateral, on each side. Van Aubel's theorem states that the two line segments between the centers of opposite squares are of equal ...

  9. Intersection curve - Wikipedia

    en.wikipedia.org/wiki/Intersection_curve

    Intersection curve. In geometry, an intersection curve is a curve that is common to two geometric objects. In the simplest case, the intersection of two non-parallel planes in Euclidean 3-space is a line. In general, an intersection curve consists of the common points of two transversally intersecting surfaces, meaning that at any common point ...