enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Line (geometry) - Wikipedia

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

    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. Equivalently for three points in a plane, the points are collinear if and only if the slope between one pair of points equals the slope between any other pair of points (in which case the slope ...

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

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

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

    They proved that the maximum number of points in the grid with no three points collinear is (). Similarly to Erdős's 2D construction, this can be accomplished by using points ( x , y , x 2 + y 2 {\displaystyle (x,y,x^{2}+y^{2}} mod p ) {\displaystyle p)} , where p {\displaystyle p} is a prime congruent to 3 mod 4 . [ 20 ]

  5. Segre's theorem - Wikipedia

    en.wikipedia.org/wiki/Segre's_theorem

    For finite planes (i.e. the set of points is finite) we have a more convenient characterization: For a finite projective plane of order n (i.e. any line contains n + 1 points) a set of points is an oval if and only if | | = + and no three points are collinear (on a common line).

  6. Fano plane - Wikipedia

    en.wikipedia.org/wiki/Fano_plane

    There are () = 35 triples of points, seven of which are collinear triples, leaving 28 non-collinear triples or triangles. The configuration consisting of the three points of a triangle and the three lines joining pairs of these points is represented by a 6-cycle in the Heawood graph.

  7. Euclidean planes in three-dimensional space - Wikipedia

    en.wikipedia.org/wiki/Euclidean_planes_in_three...

    Therefore, the hypotenuses AO and DO are equal, and equal to the radius of S, so that D lies in S. This proves that C is contained in the intersection of P and S. As a corollary, on a sphere there is exactly one circle that can be drawn through three given points. [9]

  8. Cross-ratio - Wikipedia

    en.wikipedia.org/wiki/Cross-ratio

    The projective linear group of n-space = (+) has (n + 1) 2 − 1 dimensions (because it is (,) = ((+,)), projectivization removing one dimension), but in other dimensions the projective linear group is only 2-transitive – because three collinear points must be mapped to three collinear points (which is not a restriction in the projective line ...

  9. Ordered geometry - Wikipedia

    en.wikipedia.org/wiki/Ordered_geometry

    The interval AB is the segment AB and its end points A and B. The ray A/B (read as "the ray from A away from B") is the set of points P such that [PAB]. 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 ...