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 contribution

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 publication Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD 2019)
PublisherSpringer, Cham
Pages101-113
DOIs
Publication statusPublished - 2019

Publication series

NameLNCS
Volume11904

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

  • Cite this

    Aichholzer, O., Balko, M., Hoffmann, M., Kynčl, J., Mulzer, W., Parada, I., ... Welzl, E. (2019). Minimal Representations of Order Types by Geometric Graphs. In Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD 2019) (pp. 101-113). (LNCS; Vol. 11904). Springer, Cham. https://doi.org/10.1007/978-3-030-35802-0_8