Minimal Representations of Order Types by Geometric Graphs

Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kynčl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationGraph Drawing and Network Visualization - 27th International Symposium, GD 2019, Proceedings
EditorsDaniel Archambault, Csaba D. Tóth
PublisherSpringer
Pages101-113
Number of pages13
ISBN (Print)9783030358013
DOIs
StatePublished - 1 Jan 2019
Externally publishedYes
Event27th International Symposium on Graph Drawing and Network Visualization, GD 2019 - Prague, Czech Republic
Duration: 17 Sep 201920 Sep 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11904 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference27th International Symposium on Graph Drawing and Network Visualization, GD 2019
Country/TerritoryCzech Republic
CityPrague
Period17/09/1920/09/19

Keywords

  • Geometric graph
  • Order type
  • Pseudoline arrangement
  • Straight-line drawing
  • Triangular cell

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Minimal Representations of Order Types by Geometric Graphs'. Together they form a unique fingerprint.

Cite this