Abstract Order Type Extension and New Results on the Rectilinear Crossing

Number

Oswin Aichholzer

Institute for SoftwaretechnologyGraz University of Technology

Graz, Austria

Hannes KrasserInstitute for Theoretical Computer

ScienceGraz University of Technology

Graz, Austria

European Workshop on Computational Geometry, Eindhoven, The Netherlands, 2005.

Point Sets

- finite point sets in the real plane R2

- in general position- with different crossing properties

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/positive right/negative

a

bc

a

bc

Order Type

Point sets of same order type there exists a bijection s.t. eitherall (or none) corresponding triples are of equal orientation

Point sets of same order type

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 for n≤10 pointsAichholzer, Aurenhammer, Krasser, Enumerating order types for small point sets with applications. 2001Our work: extension to n=11 points,

same approach with improved methods

Order Type Data Base

number of points 3 4 5 6 7 8 9 10 11

projective abstract o.t.

1 1 1 4 11 135 4 382 312356 41 848 591

- thereof non-realizable

1 242 155 214

= project. order types

1 1 1 4 11 135 4 381 312 114 41 693 377

abstract order types 1 2 3 16

135 3 315 158 830

14 320 182

2 343 203 071

- thereof non-realizable

13 10 635 8 690 164

= order types 1 2 3 16

135 3 315 158 817

14 309 547

2 334 512 907

Extended order type data base

16-bit integer coordinates, >100 GB

Order Type Extension

Extension to n=12, 13, … ?- approx. 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 Sn and there exists Sn-1 s.t. similar property holds for Sn-1

Sn .. order type of n pointsSn-1 .. subset of Sn 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

Order Type Extension

Order type extension algorithm:- extending point set realizations of order types with one additional point is not applicable

extension of abstract order types

Order Type Extension

Abstract order type extension:- duality: point sets line arrangements order type intersection sequences- abstract order type pseudoline arrangement

Order Type Extension

line arrangement

Order Type Extension

pseudoline arrangement

Order Type Extension

Abstract order type extension:- duality: point sets line arrangements order type intersection sequences- abstract order type pseudoline arrangement- extend pseudoline arrangement with an additional pseudoline in all combinatorial different ways- decide realizability of extended abstract order type (optional)

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

Rectilinear Crossing Number

Application: Rectilinear crossing number of complete graph Kn

minimum number of crossings attained by a straight-line drawing of the complete graph Kn in the plane

Rectilinear Crossing Number

n 3 4 5 6 7 8 9 10 11 12

cr(Kn

)0 0 1 3 9 19 36 62 10

215

3

dn1 1 1 1 3 2 10 2 374

cr(Kn) .. rectilinear crossing number of Kn

dn .. number of combinatorially different drawings

Aichholzer, Aurenhammer, Krasser, On the crossing number of complete graphs. 2002

What numbers are known so far?

Subset property of rectilinear crossing number of Kn: Drawing of Kn on Sn has c crossings at least one drawing of Kn-1 on Sn-1

has at most c·n/(n-4) crossings

Parity property: n odd c ( ) (mod 2)

Extension graph: point causing most crossings

Rectilinear Crossing Number

n

4

Rectilinear Crossing Number

Not known: cr(K13)=229 ?K13 .. 227 crossings K12 .. 157 crossings K12 .. 157 crossings K11 .. 104 crossings

Not known: d13= ?K13 .. 229 crossings K12 .. 158 crossings K12 .. 158 crossings K11 .. 104 crossings

Rectilinear Crossing Number

n 11 12 13 14 15 16 17

12 a ≤100 ≤152

12 b ≤102 ≤153

13 a ≤104 ≤157 ≤227

13 b ≤158 ≤229

14 a ≤323

14 b ≤106 ≤159 ≤231 ≤324

15 a ≤326 ≤445

15 b ≤161 ≤233 ≤327 ≤447

16 a ≤108 ≤162 ≤235 ≤330 ≤451 ≤602

16 b ≤603

17 a ≤164 ≤237 ≤333 ≤455 ≤608 ≤796

17 b ≤110 ≤165 ≤239 ≤335 ≤457 ≤610 ≤798

Rectilinear Crossing Number

crossings 102 104 106 108 110

order types 374 3 984 17 896 47 471 102 925

Extension of the complete data base: 2 334 512 907 order types for n=11

Extension for rectilinear crossing number:

Rectilinear Crossing Number

n 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

cr(Kn

)0 0 1 3 9 19 36 62 10

215

322

932

4447 60

3798

dn1 1 1 1 3 2 10 2 374 1 453

420 1600

136 3726

9

cr(Kn) .. rectilinear crossing number of Kn

dn .. number of combinatorially different drawings

New results on the rectilinear crossing number:

Rectilinear Crossing Constant

Problem: rectilinear crossing constant,asymptotics of rectilinear crossing number

)(lim

4/)()(

* n

nKcrn

n

n

best known lower bound: Balogh, Salazar, On k-sets, convex quadrilaterals, and the rectilinear crossing number of Kn.

37533.0*

- best known upper bound: large point set with few crossings, lens substitution

- improved upper bound: set of 54 points with 115 999 crossings, lens substitution

38058.0*

Rectilinear Crossing Constant

38074.0* Aichholzer, Aurenhammer, Krasser, On the crossing number of complete graphs. 2002

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 tight bounds are known for k6.- Conjecture:

Erdös, Szekeres, A combinatorial problem in geometry. 1935

12g(k) 2k

17g(6)

Further Applications

Subset property:Sn contains a convex k-gon each subset Sn-1 contains a convex k-gon

Future goal: Solve the case of 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. 2004

- subset property: adding an interior point increases the number of triangulations by a constant factor 1.806- calculations: to be done…

Abstract Order Type…

Thank you!