Minimal Representations of Order Types by Geometric Graphs

08/14/2019
by   Oswin Aichholzer, et al.
0

In order to have a compact visualization of the order type of a given point set S, we are interested in geometric graphs on S with few edges that unequivocally display the order type of S. We introduce the concept of exit edges, which prevent the order type from changing under continuous motion of vertices. Exit edges have a natural dual characterization, which allows us to efficiently compute them and to bound their number.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/24/2019

Counting the Number of Crossings in Geometric Graphs

A geometric graph is a graph whose vertices are points in general positi...
research
11/29/2020

Constructing Order Type Graphs using an Axiomatic Approach

A given order type in the plane can be represented by a point set. Howev...
research
06/19/2020

Universal Geometric Graphs

We introduce and study the problem of constructing geometric graphs that...
research
08/19/2020

Augmenting Geometric Graphs with Matchings

We study noncrossing geometric graphs and their disjoint compatible geom...
research
10/03/2020

Planar projections of graphs

We introduce and study a new graph representation where vertices are emb...
research
08/21/2023

Different Types of Isomorphisms of Drawings of Complete Multipartite Graphs

Simple drawings are drawings of graphs in which any two edges intersect ...
research
07/01/2019

Trimming Graphs Using Clausal Proof Optimization

We present a method to gradually compute a smaller and smaller unsatisfi...

Please sign up or login with your details

Forgot password? Click here to reset