Automatic constructibility checking of a corpus of geometric construction problems

DOI10.1007/s11786-016-0247-3zbMath1342.51018OpenAlexW2295918980MaRDI QIDQ294375

Pascal Schreck, Pascal Mathis

Publication date: 16 June 2016

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-016-0247-3

zbMATH Keywords

Galois theoryregular chainsstraightedge and compass constructionsWernick's list

Mathematics Subject Classification ID

Geometric constructions in real or complex geometry (51M15) Software, source code, etc. for problems pertaining to geometry (51-04) Geometry education (97G99)

Related Items (2)

Using jointly geometry and algebra to determine RC-constructibility ⋮ On the mechanization of straightedge and compass constructions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solvability by radicals is in polynomial time
• A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
• On the theories of triangular sets
• Towards Understanding Triangle Construction Problems
• Computer Theorem Proving for Verifiable Solving of Geometric Construction Problems
• On the construction of a triangle from the feet of its angle bisectors
• The transitive groups of degree up to eleven⁺
• Triangle Constructions with Three Located Points
• Update on William Wernick's "Triangle Constructions with Three Located Points"

This page was built for publication: Automatic constructibility checking of a corpus of geometric construction problems