enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Collinearity - Wikipedia

    en.wikipedia.org/wiki/Collinearity

    In particular, for three points in the plane (n = 2), the above matrix is square and the points are collinear if and only if its determinant is zero; since that 3 × 3 determinant is plus or minus twice the area of a triangle with those three points as vertices, this is equivalent to the statement that the three points are collinear if and only ...

  3. No-three-in-line problem - Wikipedia

    en.wikipedia.org/wiki/No-three-in-line_problem

    The no-three-in-line drawing of a complete graph is a special case of this result with =. [12] The no-three-in-line problem also has applications to another problem in discrete geometry, the Heilbronn triangle problem. In this problem, one must place points, anywhere in a unit square, not restricted to a grid. The goal of the placement is to ...

  4. Simson line - Wikipedia

    en.wikipedia.org/wiki/Simson_line

    The Simson line LN (red) of the triangle ABC with respect to point P on the circumcircle. In geometry, given a triangle ABC and a point P on its circumcircle, the three closest points to P on lines AB, AC, and BC are collinear. [1] The line through these points is the Simson line of P, named for Robert Simson. [2]

  5. Line (geometry) - Wikipedia

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

    In geometry, a straight line, usually abbreviated line, is an infinitely long object with no width, depth, or curvature, an idealization of such physical objects as a straightedge, a taut string, or a ray of light. Lines are spaces of dimension one, which may be embedded in spaces of dimension two, three, or higher.

  6. Delaunay triangulation - Wikipedia

    en.wikipedia.org/wiki/Delaunay_triangulation

    Three or more collinear points, where the circumcircles are of infinite radii. Four or more points on a perfect circle, where the triangulation is ambiguous and all circumcenters are trivially identical. In this case the Voronoi diagram contains vertices of degree four or greater and its dual graph contains polygonal faces with four or more sides.

  7. Ceva's theorem - Wikipedia

    en.wikipedia.org/wiki/Ceva's_theorem

    The left-hand side of this equation is a vector that has the same direction as the line CF, and the right-hand side has the same direction as the line AB. These lines have different directions since A, B, C are not collinear. It follows that the two members of the equation equal the zero vector, and

  8. Ordered geometry - Wikipedia

    en.wikipedia.org/wiki/Ordered_geometry

    The line AB is the interval AB and the two rays A/B and B/A. Points on the line AB are said to be collinear. An angle consists of a point O (the vertex) and two non-collinear rays out from O (the sides). A triangle is given by three non-collinear points (called vertices) and their three segments AB, BC, and CA.

  9. Triangle inequality - Wikipedia

    en.wikipedia.org/wiki/Triangle_inequality

    The figure at the right shows three examples beginning with clear inequality (top) and approaching equality (bottom). In the Euclidean case, equality occurs only if the triangle has a 180° angle and two 0° angles, making the three vertices collinear, as shown in the bottom example. Thus, in Euclidean geometry, the shortest distance between ...