Constructing Order Type Graphs using an Axiomatic Approach
Computational Geometry
2020-12-01 v1
Abstract
A given order type in the plane can be represented by a point set. However, it might be difficult to recognize the orientations of some point triples. Recently, Aichholzer \etal \cite{abh19} introduced exit graphs for visualizing order types in the plane. We present a new class of geometric graphs, called {\em OT-graphs}, using abstract order types and their axioms described in the well-known book by Knuth \cite{k92}. Each OT-graph corresponds to a unique order type. We develop efficient algorithms for recognizing OT-graphs and computing a minimal OT-graph for a given order type in the plane. We provide experimental results on all order types of up to nine points in the plane including a comparative analysis of exit graphs and OT-graphs.
Cite
@article{arxiv.2011.14282,
title = {Constructing Order Type Graphs using an Axiomatic Approach},
author = {Sergey Bereg and Mohammadreza Haghpanah},
journal= {arXiv preprint arXiv:2011.14282},
year = {2020}
}