Reconstructing Point Set Order Types from Radial Orderings

Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, Pavel Valtr

Publikation: Beitrag in einer FachzeitschriftArtikelForschungBegutachtung

Abstract

We consider the problem of reconstructing the combinatorial structure of a set of $n$ points in the plane given partial information on the relative position of the points. This partial information consists of the radial ordering, for each of the $n$ points, of the $n-1$ other points around it. We show that this information is sufficient to reconstruct the chirotope, or labeled order type, of the point set, provided its convex hull has size at least four. Otherwise, we show that there can be as many as $n-1$ distinct chirotopes that are compatible with the partial information, and this bound is tight. Our proofs yield polynomial-time reconstruction algorithms. These results provide additional theoretical insights on previously studied problems related to robot navigation and visibility-based reconstruction.
Originalspracheenglisch
Seiten (von - bis)167-184
Seitenumfang18
FachzeitschriftInternational Journal of Computational Geometry and Applications
Jahrgang26
Ausgabenummer3/4
DOIs
PublikationsstatusVeröffentlicht - 2016

Fields of Expertise

  • Information, Communication & Computing

Dies zitieren

Reconstructing Point Set Order Types from Radial Orderings. / Aichholzer, Oswin; Cardinal, Jean; Kusters, Vincent; Langerman, Stefan; Valtr, Pavel.

in: International Journal of Computational Geometry and Applications, Jahrgang 26, Nr. 3/4, 2016, S. 167-184.

Publikation: Beitrag in einer FachzeitschriftArtikelForschungBegutachtung

Aichholzer, Oswin ; Cardinal, Jean ; Kusters, Vincent ; Langerman, Stefan ; Valtr, Pavel. / Reconstructing Point Set Order Types from Radial Orderings. in: International Journal of Computational Geometry and Applications. 2016 ; Jahrgang 26, Nr. 3/4. S. 167-184.
@article{8fc15a99e5334b3091443c6218d05813,
title = "Reconstructing Point Set Order Types from Radial Orderings",
abstract = "We consider the problem of reconstructing the combinatorial structure of a set of $n$ points in the plane given partial information on the relative position of the points. This partial information consists of the radial ordering, for each of the $n$ points, of the $n-1$ other points around it. We show that this information is sufficient to reconstruct the chirotope, or labeled order type, of the point set, provided its convex hull has size at least four. Otherwise, we show that there can be as many as $n-1$ distinct chirotopes that are compatible with the partial information, and this bound is tight. Our proofs yield polynomial-time reconstruction algorithms. These results provide additional theoretical insights on previously studied problems related to robot navigation and visibility-based reconstruction.",
author = "Oswin Aichholzer and Jean Cardinal and Vincent Kusters and Stefan Langerman and Pavel Valtr",
year = "2016",
doi = "10.1142/S0218195916600037",
language = "English",
volume = "26",
pages = "167--184",
journal = "International Journal of Computational Geometry and Applications",
issn = "0218-1959",
publisher = "World Scientific Publishing Co Pte Ltd",
number = "3/4",

}

TY - JOUR

T1 - Reconstructing Point Set Order Types from Radial Orderings

AU - Aichholzer, Oswin

AU - Cardinal, Jean

AU - Kusters, Vincent

AU - Langerman, Stefan

AU - Valtr, Pavel

PY - 2016

Y1 - 2016

N2 - We consider the problem of reconstructing the combinatorial structure of a set of $n$ points in the plane given partial information on the relative position of the points. This partial information consists of the radial ordering, for each of the $n$ points, of the $n-1$ other points around it. We show that this information is sufficient to reconstruct the chirotope, or labeled order type, of the point set, provided its convex hull has size at least four. Otherwise, we show that there can be as many as $n-1$ distinct chirotopes that are compatible with the partial information, and this bound is tight. Our proofs yield polynomial-time reconstruction algorithms. These results provide additional theoretical insights on previously studied problems related to robot navigation and visibility-based reconstruction.

AB - We consider the problem of reconstructing the combinatorial structure of a set of $n$ points in the plane given partial information on the relative position of the points. This partial information consists of the radial ordering, for each of the $n$ points, of the $n-1$ other points around it. We show that this information is sufficient to reconstruct the chirotope, or labeled order type, of the point set, provided its convex hull has size at least four. Otherwise, we show that there can be as many as $n-1$ distinct chirotopes that are compatible with the partial information, and this bound is tight. Our proofs yield polynomial-time reconstruction algorithms. These results provide additional theoretical insights on previously studied problems related to robot navigation and visibility-based reconstruction.

U2 - 10.1142/S0218195916600037

DO - 10.1142/S0218195916600037

M3 - Article

VL - 26

SP - 167

EP - 184

JO - International Journal of Computational Geometry and Applications

JF - International Journal of Computational Geometry and Applications

SN - 0218-1959

IS - 3/4

ER -