When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Straightedge and compass construction - Wikipedia

    en.wikipedia.org/wiki/Straightedge_and_compass...

    The "straightedge" and "compass" of straightedge-and-compass constructions are idealized versions of real-world rulers and compasses. The straightedge is an infinitely long edge with no markings on it. It can only be used to draw a line segment between two points, or to extend an existing line segment.

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

  4. Line segment - Wikipedia

    en.wikipedia.org/wiki/Line_segment

    A closed line segment includes both endpoints, while an open line segment excludes both endpoints; a half-open line segment includes exactly one of the endpoints. In geometry , a line segment is often denoted using an overline ( vinculum ) above the symbols for the two endpoints, such as in AB .

  5. Chord (geometry) - Wikipedia

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

    Common lines and line segments on a circle, including a chord in blue. A chord (from the Latin chorda, meaning "bowstring") of a circle is a straight line segment whose endpoints both lie on a circular arc. If a chord were to be extended infinitely on both directions into a line, the object is a secant line.

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

  7. Multiple line segment intersection - Wikipedia

    en.wikipedia.org/wiki/Multiple_line_segment...

    The Shamos–Hoey algorithm [1] applies this principle to solve the line segment intersection detection problem, as stated above, of determining whether or not a set of line segments has an intersection; the Bentley–Ottmann algorithm works by the same principle to list all intersections in logarithmic time per intersection.

  8. Constructible number - Wikipedia

    en.wikipedia.org/wiki/Constructible_number

    The square root of 2 is equal to the length of the hypotenuse of a right triangle with legs of length 1 and is therefore a constructible number. In geometry and algebra, a real number is constructible if and only if, given a line segment of unit length, a line segment of length | | can be constructed with compass and straightedge in a finite number of steps.

  9. Intercept theorem - Wikipedia

    en.wikipedia.org/wiki/Intercept_theorem

    In particular it is important to assure that for two given line segments, a new line segment can be constructed, such that its length equals the product of lengths of the other two. Similarly one needs to be able to construct, for a line segment of length , a new line segment of length . The intercept theorem can be used to show that for both ...