Minimal Representations of Order Types by Geometric Graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10403070" target="_blank" >RIV/00216208:11320/19:10403070 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1007/978-3-030-35802-0_8" target="_blank" >https://doi.org/10.1007/978-3-030-35802-0_8</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-35802-0_8" target="_blank" >10.1007/978-3-030-35802-0_8</a>

Result language

angličtina

Original language name

Minimal Representations of Order Types by Geometric Graphs

Original language description

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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10101 - Pure mathematics

Project

<a href="/en/project/GA18-19158S" target="_blank" >GA18-19158S: Algorithmic, structural and complexity aspects of geometric and other configurations</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2019

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Graph Drawing and Network Visualization

ISBN

978-3-030-35801-3

ISSN

0302-9743

e-ISSN

—

Number of pages

13

Pages from-to

101-113

Publisher name

Springer, Cham

Place of publication

Neuveden

Event location

Prague

Event date

Sep 17, 2019

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—