# On strict strong constructibility with a compass alone

@article{Avron1990OnSS, title={On strict strong constructibility with a compass alone}, author={Arnon Avron}, journal={Journal of Geometry}, year={1990}, volume={38}, pages={12-15} }

We show that every point in the plane which can be constructed by a compass and a ruler, given a setS of points, can be constructed using a compass alone so that the following restriction is met. LetO andK be two arbitrarily chosen distinct points ofS. Then every point is obtained as a proper intersection of two circles that are either completely symmetrical with respect to the lineOK or have both their centers on this line.

## 11 Citations

### A new look at euclid’s second proposition

- Mathematics
- 1993

ConclusionsWe mention in closing that even the 20th-centuryAlgorithm CO pales by comparison withAlgorithm Euclid from the point of view of robustness with respect to singularities. Consider, for…

### An exercise in an interactive geometrical research

- MathematicsAnnals of Mathematics and Artificial Intelligence
- 2005

We describe how an interactive research with a computer led to a new, simple proof of the classical Mascheroni-Mohr theorem concerning constructions with a compass alone. We then discuss the…

### On a Discrete Version of the Mohr-Mascheroni Theorem

- Mathematics
- 2013

We introduce a new geometric tool called n-compass and
show that the famous theorem of Mascheroni and Mohr remains valid if the
traditional compass is replaced by the newly introduced tool.

### Computational geometry

- MathematicsThe Visual Computer
- 2005

Consider the point p and the line l arranged in the plane as illustrated in Fig. 1.1. The following question immediately comes to mind. Does the point p lie on, above or below l? This question asks…

### 3. the Domain of Computational Geometry 3.1 Introduction

- Computer Science

In this section the reader is given a wider view of the present-day domain of computational geometry and the papers in this issue touch on only a fraction of the topics of interest to computational geometry.

### Transitive Closure and the Mechanization of Mathematics

- Computer Science
- 2003

It is argued that the concept of transitive closure is the key for understanding finitary inductive definitions and reasoning, and evidence is provided for the thesis that logics which are based on it are the right logical framework for the formalization and mechanization of mathematics.

### Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work)

- PhilosophyOutstanding Contributions to Logic
- 2021

## References

### Theorems on strong constructibility with a compass alone

- Mathematics
- 1987

We show that every point in the plane which can be constructed by a compass and a ruler, given a set S of points, can be constructed using a compass alone, in such a way that the centres of all the…