Constructing Order Type Graphs using an Axiomatic Approach

11/29/2020
by   Sergey Bereg, et al.
0

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 <cit.> introduced exit graphs for visualizing order types in the plane. We present a new class of geometric graphs, called OT-graphs, using abstract order types and their axioms described in the well-known book by Knuth <cit.>. 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/14/2019

Minimal Representations of Order Types by Geometric Graphs

In order to have a compact visualization of the order type of a given po...
research
08/21/2017

Geodesic Order Types

The geodesic between two points a and b in the interior of a simple poly...
research
02/27/2018

Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane

It is shown that shift graphs can be realized as disjointness graphs of ...
research
09/22/2021

Graph type expressivity and transformations

Graph representations have gained importance in almost every scientific ...
research
07/10/2019

Smoothed Analysis of Order Types

Consider an ordered point set P = (p_1,...,p_n), its order type (denoted...
research
01/17/2023

A Note on the Simplex-Tree Construction of the Vietoris-Rips Complex

We give an alternative presentation of the Simplex Tree construction of ...
research
04/12/2023

Recognizing and generating unswitchable graphs

In this paper, we show that unswitchable graphs are a proper subclass of...

Please sign up or login with your details

Forgot password? Click here to reset