Abstract Order Type Extension and New Results on the Rectilinear Crossing Number Oswin Aichholzer Institute for Softwaretechnology Graz University of Technology.

Slides:



Advertisements
Similar presentations
Order Types of Point Sets in the Plane Hannes Krasser Institute for Theoretical Computer Science Graz University of Technology Graz, Austria supported.
Advertisements

Approximation algorithms for geometric intersection graphs.
Rahnuma Islam Nishat Debajyoti Mondal Md. Saidur Rahman Graph Drawing and Information Visualization Laboratory Department of Computer Science and Engineering.
Abstract Order Type Extension and New Results on the Rectilinear Crossing Number Oswin Aichholzer Institute for Softwaretechnology Graz University of Technology.
Spatial Embedding of Pseudo-Triangulations Peter Braß Institut für Informatik Freie Universität Berlin Berlin, Germany Franz Aurenhammer Hannes Krasser.
22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
2/9/06CS 3343 Analysis of Algorithms1 Convex Hull  Given a set of pins on a pinboard  And a rubber band around them  How does the rubber band look when.
Lecture 3: Parallel Algorithm Design
2/14/13CMPS 3120 Computational Geometry1 CMPS 3120: Computational Geometry Spring 2013 Planar Subdivisions and Point Location Carola Wenk Based on: Computational.
Computational Geometry II Brian Chen Rice University Computer Science.
One of the most important problems is Computational Geometry is to find an efficient way to decide, given a subdivision of E n and a point P, in which.
The Divide-and-Conquer Strategy
Ruslana Mys Delaunay Triangulation Delaunay Triangulation (DT)  Introduction  Delaunay-Voronoi based method  Algorithms to compute the convex hull 
Computational Geometry
8/29/06CS 6463: AT Computational Geometry1 CS 6463: AT Computational Geometry Spring 2006 Convex Hulls Carola Wenk.
Algorithms and Data Structures Lecture 13. Agenda: Plane Geometry: algorithms on polygons - Verification if point belongs to a polygon - Convex hull.
Convexity of Point Set Sandip Das Indian Statistical Institute.
Train DEPOT PROBLEM USING PERMUTATION GRAPHS
The number of edge-disjoint transitive triples in a tournament.
2. Voronoi Diagram 2.1 Definiton Given a finite set S of points in the plane , each point X of  defines a subset S X of S consisting of the points of.
Convex Hulls Computational Geometry, WS 2006/07 Lecture 2 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät für.
3. Delaunay triangulation
Chapter 7 Relations : the second time around
Stephane Durocher 1 Debajyoti Mondal 1 Rahnuma Islam Nishat 2 Sue Whitesides 2 1 Department of Computer Science, University of Manitoba 2 Department of.
Tirgul 10 Rehearsal about Universal Hashing Solving two problems from theoretical exercises: –T2 q. 1 –T3 q. 2.
1.4 Exercises (cont.) Definiton: A set S of points is said to be affinely (convex) independent if no point of S is an affine combination of the others.
Algorithm 1. (Convex Hull) - Pseudo code - Input. A set of points in the plane. Output. A list containing the vertices of Conv ( P). 1. Sort the points.
Point Location Computational Geometry, WS 2007/08 Lecture 5 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät für.
Data Flow Analysis Compiler Design Nov. 8, 2005.
Sequence A list of objects arranged in a particular order.
Chapter 4: Straight Line Drawing Ronald Kieft. Contents Introduction Algorithm 1: Shift Method Algorithm 2: Realizer Method Other parts of chapter 4 Questions?
Data Flow Analysis Compiler Design Nov. 8, 2005.
Lection 1: Introduction Computational Geometry Prof.Dr.Th.Ottmann 1 History: Proof-based, algorithmic, axiomatic geometry, computational geometry today.
Partially Ordered Sets (POSets)
Delaunay Triangulations Presented by Glenn Eguchi Computational Geometry October 11, 2001.
Abstract Interpretation (Cousot, Cousot 1977) also known as Data-Flow Analysis.
 Optimal Packing of High- Precision Rectangles By Eric Huang & Richard E. Korf 25 th AAAI Conference, 2011 Florida Institute of Technology CSE 5694 Robotics.
Solving fixpoint equations
Equality Function Computation (How to make simple things complicated) Nitin Vaidya University of Illinois at Urbana-Champaign Joint work with Guanfeng.
PRE-TRIANGULATIONS Generalized Delaunay Triangulations and Flips Franz Aurenhammer Institute for Theoretical Computer Science Graz University of Technology,
Theory of Computing Lecture 15 MAS 714 Hartmut Klauck.
Line Arrangement Chapter 6. Line Arrangement Problem: Given a set L of n lines in the plane, compute their arrangement which is a planar subdivision.
Lesley Charles November 23, 2009.
Homework Review notes Complete Worksheet #1. Homework Let A = {a,b,c,d}, B = {a,b,c,d,e}, C = {a,d}, D = {b, c} Describe any subset relationships. 1.
DISCRETE COMPUTATIONAL STRUCTURES CS Fall 2005.
Center for Graphics and Geometric Computing, Technion 1 Computational Geometry Chapter 8 Arrangements and Duality.
Vectors Addition is commutative (vi) If vector u is multiplied by a scalar k, then the product ku is a vector in the same direction as u but k times the.
Center for Graphics and Geometric Computing, Technion 1 Computational Geometry Chapter 8 Arrangements and Duality.
Beyond planarity of graphs Eyal Ackerman University of Haifa and Oranim College.
Relation. Combining Relations Because relations from A to B are subsets of A x B, two relations from A to B can be combined in any way two sets can be.
Computing Branchwidth via Efficient Triangulations and Blocks Authors: F.V. Fomin, F. Mazoit, I. Todinca Presented by: Elif Kolotoglu, ISE, Texas A&M University.
UNC Chapel Hill M. C. Lin Delaunay Triangulations Reading: Chapter 9 of the Textbook Driving Applications –Height Interpolation –Constrained Triangulation.
Graph algebras and graph limits László Lovász
Date: 1.2 Functions And Their Properties A relation is any set of ordered pairs. The set of all first components of the ordered pairs is called the domain.
Center for Graphics and Geometric Computing, Technion 1 Computational Geometry Chapter 9 Line Arrangements.
The geometric GMST problem with grid clustering Presented by 楊劭文, 游岳齊, 吳郁君, 林信仲, 萬高維 Department of Computer Science and Information Engineering, National.
An Introduction to Computational Geometry: Arrangements and Duality Joseph S. B. Mitchell Stony Brook University Some images from [O’Rourke, Computational.
Chapter 4 With Question/Answer Animations 1. Chapter Summary Divisibility and Modular Arithmetic - Sec 4.1 – Lecture 16 Integer Representations and Algorithms.
1 Schnyder’s Method. 2 Motivation Given a planar graph, we want to embed it in a grid We want the grid to be relatively small And we want an efficient.
Chapter 2 1. Chapter Summary Sets The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions and sequences.
Chapter 11 Sorting Acknowledgement: These slides are adapted from slides provided with Data Structures and Algorithms in C++, Goodrich, Tamassia and Mount.
Geometry (4102).
Lecture 3: Parallel Algorithm Design
MA/CSSE 473 Day 16 Answers to your questions Divide and Conquer
VORONOI DIAGRAMS FOR PARALLEL HALFLINES IN 3D
Rainbow cycles in flip graphs
Computational Geometry Capter:1-2.1
Computational Geometry
Switching Lemmas and Proof Complexity
Parameterized Complexity of Conflict-free Graph Coloring
Presentation transcript:

Abstract Order Type Extension and New Results on the Rectilinear Crossing Number Oswin Aichholzer Institute for Softwaretechnology Graz University of Technology Graz, Austria Hannes Krasser Institute for Theoretical Computer Science Graz University of Technology Graz, Austria ACM Symposium on Computational Geometry (SoCG), Pisa, Italy, 2005

Point Sets - finite point sets in the real plane  2 - in general position - with different crossing properties

Crossing Properties point set complete straight-line graph K n crossingno crossing

Crossing Properties no crossing 4 points: crossing

order type of point set: mapping that assigns to each ordered triple of points its orientation Goodman, Pollack, 1983 orientation: Order Type left/positiveright/negative a b c a b c

Order Type Point sets of same order type  there exists a bijection s.t. either all (or none) corresponding triples are of equal orientation Point sets of same order type  5 5

Order Type How to decide whether 2 point sets are of the same order type? - encoding order types: λ-matrix Goodman, Pollack, Multidimensional Sorting S={p 1,..,p n }.. labelled point set λ(i,j).. number of points of S on the left of the oriented line through p i and p j - Theorem: order type  λ-matrix Goodman, Pollack, Multidimensional Sorting. 1983

Order Type

- natural λ-matrix: p 1 on the convex hull, p 2,..,p n sorted clockwise around p 1

Order Type - natural λ-matrix: p 1 on the convex hull, p 2,..,p n sorted clockwise around p 1 - lexicographically minimal λ-matrix: unique „fingerprint“ for an order type - same order type  identical lexicographically minimal λ-matrices

Order Type Extension complete order type extension: - input: order type S n of n points - output: all different order types S n+1 of n+1 points that contain S n as a sub-order type

arrangement of lines  cells Order Type Extension

extending point set realizations of order types with one additional point is not a complete order type extension line arrangement not unique

Order Type Extension point-line duality: p  T(p) a b c T(a) T(b) T(c) bc ac ab

Order Type Extension point-line duality: p  T(p) a b c T(a) T(b) T(c) ab ac bc

Order Type Extension order type  local intersection sequence (point set) (line arrangement) point-line duality: p  T(p)

Order Type Extension line arrangement

Order Type Extension pseudoline arrangement

Order Type Extension order type  local intersection sequence (point set) (line arrangement) point-line duality: p  T(p) abstract  local intersection sequence order type (pseudoline arrangement)

Order Type Extension Abstract order type extension algorithm: - duality abstract order type  pseudoline arrangement - extend pseudoline arrangement with an additional pseudoline in all combinatorial different ways (local intersection sequences) - decide realizability of extended abstract order type (optional)

Enumerating Order Types Task: Enumerate all order types of point sets in the plane (for small, fixed size and in general position)

Order Type Data Base number of points projective abstract o.t thereof non-realizable = project. order types abstract order types thereof non-realizable = order types Order type data base for n≤10 points Aichholzer, Aurenhammer, Krasser, Enumerating order types for small point sets with applications Our work: extension to n=11 points 16-bit integer coordinates, >100 GB

Order Type Extension Extension to n=12, 13, … ? -  750 billion order types for n=12 - too many for complete data base - partial extension of data base - obtain results on „suitable applications“ for 12 and beyond…

Subset Property „suitable applications“: subset property Property valid for S n and there exists S n-1 s.t. similar property holds for S n-1 S n.. order type of n points S n-1.. subset of S n of n-1 points

Order Type Extension Order type extension with subset property: - order type data base  result set of order types for n=11 - enumerate all order types of 12 points that contain one of these 11-point order types as a subset - filter 12-point order types according to subset property

Rectilinear Crossing Number Application: Rectilinear crossing number of complete graph K n minimum number of crossings attained by a straight-line drawing of the complete graph K n in the plane

Rectilinear Crossing Number n cr(K n ) dndn 11 cr(K n ).. rectilinear crossing number of K n d n.. number of combinatorially different drawings Aichholzer, Aurenhammer, Krasser, On the crossing number of complete graphs What numbers are known so far?

Order type extension (rectilinear crossing number of K n) : Enumerate order types with „few“ crossings Subset property: Drawing of K n on S n with „few“ crossings contains at least one drawing of K n-1 on S n-1 with „few“ crossings Rectilinear Crossing Number

Subset property: Drawing of K n on S n has c crossings  at least one drawing of K n-1 on S n-1 has at most  c·(n-4)/n  crossings Parity property: n odd  c  ( ) (mod 2) Rectilinear Crossing Number n 4

Not known: cr(K 13 )=229 ? K crossings  K crossings K crossings  K crossings Not known: d 13 = ? K crossings  K crossings K crossings  K crossings

Rectilinear Crossing Number n a≤100≤ b≤102≤ a≤104≤157≤ b≤158≤ a≤ b≤106≤159≤231≤ a≤326≤ b≤161≤233≤327≤ a≤108≤162≤235≤330≤451≤ b≤ a≤164≤237≤333≤455≤608≤ b≤110≤165≤239≤335≤457≤610≤798

Rectilinear Crossing Number crossings order types Extension of the complete data base: order types for n=11 Extension for rectilinear crossing number:

Order Type Extension Problem: Order types of size 12 may contain multiple start order types of size 11  some order types are generated in multiple Avoiding multiple generation of order types - Order type extension graph: nodes.. order types in extension algorithm edges.. for each generated order type of size n+1 (son) define a unique sub-order type of size n (father)

Order Type Extension - Extension only along edges of order type extension graph  each order type is generated exactly once - distributed computing can be applied to abstract order type extension: independent calculation for each starting 11-point order type

Extension graph (rectilinear crossing number): - point causing most crossings - largest index in the lexicographically minimal λ-matrix representation Rectilinear Crossing Number

n cr(K n ) dndn  cr(K n ).. rectilinear crossing number of K n d n.. number of combinatorially different drawings New results on the rectilinear crossing number:

Rectilinear Crossing Constant Problem: rectilinear crossing constant, asymptotics of rectilinear crossing number

Rectilinear Crossing Constant - best known lower bound: Balogh, Salazar, On k-sets, convex quadrilaterals, and the rectilinear crossing number of K n. - lower bound: Lovász, Vesztergombi, Wagner, Welzl, Convex quadrilaterals and k-sets. 2003

- best known upper bound: large point set with few crossings, lens substitution - improved upper bound: set of 54 points with crossings, lens substitution Rectilinear Crossing Constant Aichholzer, Aurenhammer, Krasser, On the crossing number of complete graphs. 2002

- further improvement: set of 45 points with crossings, recursive substitution - possible further improvement: abstract set of 96 points with crossings Rectilinear Crossing Constant realizable ??

Further Applications „Happy End Problem“: What is the minimum number g(k) s.t. each point set with at least g(k) points contains a convex k-gon? - No exact values g(k) are known for k  6. - Conjecture: Erdös, Szekeres, A combinatorial problem in geometry. 1935

Order type extension (6-gon problem): Enumerate all order types that do not contain a convex 6-gon Subset property: S n contains no convex 6-gon  each subset S n-1 contains no convex 6-gon Further Applications

Start: n= order types n= (abstract) o.t. n=13...  order types Future goal: Solve the case of convex 6-gons by a distributed computing approach

Further Applications Counting the number of triangulations: - exact values for n≤11 - best asymptotic lower bound is based on these result Aichholzer, Hurtado, Noy, A lower bound on the number of triangulations of planar point sets subset property: adding a point increases the number of triangulations by a constant factor - calculations: to be done…

Abstract Order Type… Thank you!