Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.
Concept
Desargues configuration
Summary
In geometry, the Desargues configuration is a configuration of ten points and ten lines, with three points per line and three lines per point. It is named after Girard Desargues.
The Desargues configuration can be constructed in two dimensions from the points and lines occurring in Desargues's theorem, in three dimensions from five planes in general position, or in four dimensions from the 5-cell, the four-dimensional regular simplex. It has a large group of symmetries, taking any point to any other point and any line to any other line. It is also self-dual, meaning that if the points are replaced by lines and vice versa using projective duality, the same configuration results.
Graphs associated with the Desargues configuration include the Desargues graph (its graph of point-line incidences) and the Petersen graph (its graph of non-incident lines). The Desargues configuration is one of ten different configurations with ten points and lines, three points per line, and three lines per point, nine of which can be realized in the Euclidean plane.
Two triangles and are said to be in perspective centrally if the lines , , and meet in a common point, called the center of perspectivity. They are in perspective axially if the intersection points of the corresponding triangle sides, , , and all lie on a common line, the axis of perspectivity. Desargues's theorem in geometry states that these two conditions are equivalent: if two triangles are in perspective centrally then they must also be in perspective axially, and vice versa. When this happens, the ten points and ten lines of the two perspectivities (the six triangle vertices, three crossing points, and center of perspectivity, and the six triangle sides, three lines through corresponding pairs of vertices, and axis of perspectivity) together form an instance of the Desargues configuration.
Although it may be embedded in two dimensions, the Desargues configuration has a very simple construction in three dimensions: for any configuration of five planes in general position in Euclidean space, the ten points where three planes meet and the ten lines formed by the intersection of two of the planes together form an instance of the configuration.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related publications (4)
Related concepts (6)
Desargues graph
In the mathematical field of graph theory, the Desargues graph is a distance-transitive, cubic graph with 20 vertices and 30 edges. It is named after Girard Desargues, arises from several different combinatorial constructions, has a high level of symmetry, is the only known non-planar cubic partial cube, and has been applied in chemical databases. The name "Desargues graph" has also been used to refer to a ten-vertex graph, the complement of the Petersen graph, which can also be formed as the bipartite half of the 20-vertex Desargues graph.
Configuration (geometry)
In mathematics, specifically projective geometry, a configuration in the plane consists of a finite set of points, and a finite arrangement of lines, such that each point is incident to the same number of lines and each line is incident to the same number of points. Although certain specific configurations had been studied earlier (for instance by Thomas Kirkman in 1849), the formal study of configurations was first introduced by Theodor Reye in 1876, in the second edition of his book Geometrie der Lage, in the context of a discussion of Desargues' theorem.
Levi graph
In combinatorial mathematics, a Levi graph or incidence graph is a bipartite graph associated with an incidence structure. From a collection of points and lines in an incidence geometry or a projective configuration, we form a graph with one vertex per point, one vertex per line, and an edge for every incidence between a point and a line. They are named for Friedrich Wilhelm Levi, who wrote about them in 1942. The Levi graph of a system of points and lines usually has girth at least six: Any 4-cycles would correspond to two lines through the same two points.
Related courses (2)
MATH-126: Geometry for architects II
Ce cours traite des 3 sujets suivants : la perspective, la géométrie descriptive, et une initiation à la géométrie projective.
MATH-124: Geometry for architects I
Ce cours entend exposer les fondements de la géométrie à un triple titre :
1/ de technique mathématique essentielle au processus de conception du projet,
2/ d'objet privilégié des logiciels de concept