Generalizing The Morley Trisector and Various Theorems with Realizability Computations
Computational Geometry
2016-03-14 v1
Abstract
An approach is shown that proves various theorems of plane geometry in an algorithmic manner. The approach affords transparent proofs of a generalization of the Theorem of Morley and other well known results by casting them in terms of constraint satisfaction.
Cite
@article{arxiv.1603.03463,
title = {Generalizing The Morley Trisector and Various Theorems with Realizability Computations},
author = {Eric J. Braude},
journal= {arXiv preprint arXiv:1603.03463},
year = {2016}
}
Comments
23 pages, 21 figures