2019/07/10 by Ivor van der Hoog, van der Hoog, Ivor, Tillmann Miltzow +3
Computer Science · Mathematics · #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Computational Geometry (cs.CG) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.CC #cs.CG #cs.DM #cs.DS #math.CO
paper · pdf · doi:10.48550/arxiv.1907.04645
15 pages, 6 figures, long introduction and short proofs
arxiv created 2019/07/10 · arxiv updated 2019/07/11
Consider an ordered point set P = (p1,…,pn), its order type (denoted by χP) is a map which assigns to every triple of points a value in \+,-,0\ based on whether the points are collinear(0), oriented clockwise(-) or counter-clockwise(+). An abstract order type is a map χ: [\substackn 3] → \+,-,0\ (where [\substackn 3] is the collection of all triples of a set of n elements) that satisfies the following condition: for every set of five elements S⊂ [n] its induced order type χ|S is realizable by a point set. To be precise, a point set P realizes an order type χ,if χP(pi,pj,pk) = χ(i,j,k), for all i<j<k. Planar point sets are among the most basic and natural geometric objects of study in Discrete and Computational Geometry. Properties of point sets are relevant in theory and practice alike. It is known, that deciding if an abstract order type is realizable is complete for the existential theory of the reals. Our results show that order type realizability is much easier for realistic instances than in the worst case. In particular, we can recognize instances in "expected \NP-time". This is one of the first ∃ℝ-complete problems analyzed under the lens of Smoothed Analysis.