An optimal algorithm for reconstructing point set order types from radial orderings

Oswin Aichholzer, Vincent Kusters, Wolfgang Mulzer, Alexander Pilz, Manuel Wettstein

Research output: Contribution to journalArticleResearchpeer-review

Abstract

Let P be a set of n labeled points in the plane. The radial system of P describes, for each p P, the order in which a ray that rotates around p encounters the points in P{p}. This notion is related to the order type of P, which describes the orientation (clockwise or counterclockwise) of every ordered triple in P. Given only the order type, the radial system is uniquely determined and can easily be obtained. The converse, however, is not true. Indeed, let R be the radial system of P, and let T(R) be the set of all order types with radial system R (we define T(R) = θ for the case that R is not a valid radial system). Aichholzer et al. (Reconstructing Point Set Order Types from Radial Orderings, in Proc. ISAAC 2014) show that T(R) may contain up to n - 1 order types. They also provide polynomial-time algorithms to compute T(R) when only R is given. We describe a new algorithm for finding T(R). The algorithm constructs the convex hulls of all possible point sets with the radial system R. After that, orientation queries on point triples can be answered in constant time. A representation of this set of convex hulls can be found in O(n) queries to the radial system, using O(n) additional processing time. This is optimal. Our results also generalize to abstract order types.

Original languageEnglish
Pages (from-to)57-83
Number of pages27
JournalInternational Journal of Computational Geometry and Applications
Volume27
Issue number1-2
DOIs
Publication statusPublished - 1 Jun 2017
Externally publishedYes

Fingerprint

Order Type
Optimal Algorithm
Point Sets
Convex Hull
Polynomials
Query
Anticlockwise
Clockwise
Triple Point
Processing
Time Constant
Converse
Polynomial-time Algorithm
Half line
Valid
Generalise

Keywords

  • Abstract order type
  • Good drawing
  • Point set
  • Radial system

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Theory and Mathematics
  • Computational Mathematics
  • Applied Mathematics

Cite this

An optimal algorithm for reconstructing point set order types from radial orderings. / Aichholzer, Oswin; Kusters, Vincent; Mulzer, Wolfgang; Pilz, Alexander; Wettstein, Manuel.

In: International Journal of Computational Geometry and Applications, Vol. 27, No. 1-2, 01.06.2017, p. 57-83.

Research output: Contribution to journalArticleResearchpeer-review

Aichholzer, Oswin ; Kusters, Vincent ; Mulzer, Wolfgang ; Pilz, Alexander ; Wettstein, Manuel. / An optimal algorithm for reconstructing point set order types from radial orderings. In: International Journal of Computational Geometry and Applications. 2017 ; Vol. 27, No. 1-2. pp. 57-83.
@article{1b0b4032becb4686b940c3d421a8b0cd,
title = "An optimal algorithm for reconstructing point set order types from radial orderings",
abstract = "Let P be a set of n labeled points in the plane. The radial system of P describes, for each p P, the order in which a ray that rotates around p encounters the points in P{p}. This notion is related to the order type of P, which describes the orientation (clockwise or counterclockwise) of every ordered triple in P. Given only the order type, the radial system is uniquely determined and can easily be obtained. The converse, however, is not true. Indeed, let R be the radial system of P, and let T(R) be the set of all order types with radial system R (we define T(R) = θ for the case that R is not a valid radial system). Aichholzer et al. (Reconstructing Point Set Order Types from Radial Orderings, in Proc. ISAAC 2014) show that T(R) may contain up to n - 1 order types. They also provide polynomial-time algorithms to compute T(R) when only R is given. We describe a new algorithm for finding T(R). The algorithm constructs the convex hulls of all possible point sets with the radial system R. After that, orientation queries on point triples can be answered in constant time. A representation of this set of convex hulls can be found in O(n) queries to the radial system, using O(n) additional processing time. This is optimal. Our results also generalize to abstract order types.",
keywords = "Abstract order type, Good drawing, Point set, Radial system",
author = "Oswin Aichholzer and Vincent Kusters and Wolfgang Mulzer and Alexander Pilz and Manuel Wettstein",
year = "2017",
month = "6",
day = "1",
doi = "10.1142/S0218195917600044",
language = "English",
volume = "27",
pages = "57--83",
journal = "International Journal of Computational Geometry and Applications",
issn = "0218-1959",
publisher = "World Scientific Publishing Co Pte Ltd",
number = "1-2",

}

TY - JOUR

T1 - An optimal algorithm for reconstructing point set order types from radial orderings

AU - Aichholzer, Oswin

AU - Kusters, Vincent

AU - Mulzer, Wolfgang

AU - Pilz, Alexander

AU - Wettstein, Manuel

PY - 2017/6/1

Y1 - 2017/6/1

N2 - Let P be a set of n labeled points in the plane. The radial system of P describes, for each p P, the order in which a ray that rotates around p encounters the points in P{p}. This notion is related to the order type of P, which describes the orientation (clockwise or counterclockwise) of every ordered triple in P. Given only the order type, the radial system is uniquely determined and can easily be obtained. The converse, however, is not true. Indeed, let R be the radial system of P, and let T(R) be the set of all order types with radial system R (we define T(R) = θ for the case that R is not a valid radial system). Aichholzer et al. (Reconstructing Point Set Order Types from Radial Orderings, in Proc. ISAAC 2014) show that T(R) may contain up to n - 1 order types. They also provide polynomial-time algorithms to compute T(R) when only R is given. We describe a new algorithm for finding T(R). The algorithm constructs the convex hulls of all possible point sets with the radial system R. After that, orientation queries on point triples can be answered in constant time. A representation of this set of convex hulls can be found in O(n) queries to the radial system, using O(n) additional processing time. This is optimal. Our results also generalize to abstract order types.

AB - Let P be a set of n labeled points in the plane. The radial system of P describes, for each p P, the order in which a ray that rotates around p encounters the points in P{p}. This notion is related to the order type of P, which describes the orientation (clockwise or counterclockwise) of every ordered triple in P. Given only the order type, the radial system is uniquely determined and can easily be obtained. The converse, however, is not true. Indeed, let R be the radial system of P, and let T(R) be the set of all order types with radial system R (we define T(R) = θ for the case that R is not a valid radial system). Aichholzer et al. (Reconstructing Point Set Order Types from Radial Orderings, in Proc. ISAAC 2014) show that T(R) may contain up to n - 1 order types. They also provide polynomial-time algorithms to compute T(R) when only R is given. We describe a new algorithm for finding T(R). The algorithm constructs the convex hulls of all possible point sets with the radial system R. After that, orientation queries on point triples can be answered in constant time. A representation of this set of convex hulls can be found in O(n) queries to the radial system, using O(n) additional processing time. This is optimal. Our results also generalize to abstract order types.

KW - Abstract order type

KW - Good drawing

KW - Point set

KW - Radial system

UR - http://www.scopus.com/inward/record.url?scp=85029349312&partnerID=8YFLogxK

U2 - 10.1142/S0218195917600044

DO - 10.1142/S0218195917600044

M3 - Article

VL - 27

SP - 57

EP - 83

JO - International Journal of Computational Geometry and Applications

JF - International Journal of Computational Geometry and Applications

SN - 0218-1959

IS - 1-2

ER -