Mechanization of incidence projective geometry in higher dimensions, a combinatorial approach
From MaRDI portal
Publication:6653961
DOI10.4204/EPTCS.352.8MaRDI QIDQ6653961
David J. Braun, Pascal Schreck, Nicolas Magaud
Publication date: 17 December 2024
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cites Work
- Automated theorem proving in GeoGebra: current achievements
- The area method. A recapitulation
- A case study in formalizing projective geometry in Coq: Desargues theorem
- Visually dynamic presentation of proofs in plane geometry. II: Automated generation of visually dynamic presentations with the full-angle method and the deductive database method
- A simple non-Desarguesian plane geometry.
- Two cryptomorphic formalizations of projective incidence geometry
- A Formalization of Grassmann-Cayley Algebra in COQ and Its Application to Theorem Proving in Projective Geometry
- Generalized Theorems of Desargues for n-Dimensional Projective Space
- Matroids and Graphs
- INCIDENCE CONSTRAINTS: A COMBINATORIAL APPROACH
- Machine Proofs in Geometry
- A Maple Package for Automatic Theorem Proving and Discovery in 3D-Geometry
- Matroids and the greedy algorithm
This page was built for publication: Mechanization of incidence projective geometry in higher dimensions, a combinatorial approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653961)
