$k$-Equivalence Relations and Associated Algorithms

TL;DR

This paper introduces $k$-equivalence relations to unify and efficiently compute geometric relations like lines and circles, addressing scalability issues in synthetic geometry.

Contribution

It proposes a new mathematical framework of $k$-equivalence relations and an algorithm to compute their closure efficiently.

Findings

Unified framework for lines and circles in synthetic geometry

Efficient algorithm for closure computation of $k$-equivalence relations

Addresses scalability challenges in geometric computations

Abstract

Lines and circles pose significant scalability challenges in synthetic geometry. A line with $n$ points implies ${n \choose 3}$ collinearity atoms, or alternatively, when lines are represented as functions, equality among ${n \choose 2}$ different lines. Similarly, a circle with $n$ points implies ${n \choose 4}$ cocyclicity atoms or equality among ${n \choose 3}$ circumcircles. We introduce a new mathematical concept of $k$-equivalence relations, which generalizes equality ($k=1$) and includes both lines ($k=2$) and circles ($k=3$), and present an efficient proof-producing procedure to compute the closure of a $k$-equivalence relation.