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

    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 ]

  4. Simson line - Wikipedia

    en.wikipedia.org/wiki/Simson_line

    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] The concept was first published, however, by William Wallace in 1799, [3] and is sometimes called the Wallace line. [4]

  5. Line (geometry) - Wikipedia

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

    By extension, k points in a plane are collinear if and only if any (k–1) pairs of points have the same pairwise slopes. In Euclidean geometry, the Euclidean distance d(a,b) between two points a and b may be used to express the collinearity between three points by: [3] [4]

  6. Monge's theorem - Wikipedia

    en.wikipedia.org/wiki/Monge's_theorem

    The three apex points always define a plane in three dimensions, and all three centers of similarity must lie in the plane containing the circular bases. Hence, the three centers must lie on the intersection of the two planes, which must be a line in three dimensions. [2] Monge's theorem can also be proved by using Desargues' theorem.

  7. Euler line - Wikipedia

    en.wikipedia.org/wiki/Euler_line

    In conclusion, =, and so the three points , and (in this order) are collinear. In Dörrie's book, [7] the Euler line and the problem of Sylvester are put together into a single proof. However, most of the proofs of the problem of Sylvester rely on the fundamental properties of free vectors, independently of the Euler line.

  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. Desargues configuration - Wikipedia

    en.wikipedia.org/wiki/Desargues_configuration

    In all of these configurations, each point has three other points that are not collinear with it. But in the Desargues configuration, these three points are always collinear with each other (if the chosen point is the center of perspectivity, then the three points form the axis of perspectivity) while in the other configuration shown in the ...