Line Transversals to Disjoint Balls (Joint with C. Borcea, O. Cheong, X. Goaoc, A. Holmsen) Sylvain Petitjean LORIA, Vegas team O. Schwarzkopf.

Slides:



Advertisements
Similar presentations
VC Dimension – definition and impossibility result
Advertisements

Part 2: Digital convexity and digital segments p q Goddess of fortune smiles again.
Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers Kiran Kedlaya Sergey Yekhanin MIT Microsoft Research.
Convex Partitions with 2-Edge Connected Dual Graphs Marwan Al-JubehMichael Hoffmann Diane L. SouvaineCsaba D. Toth 15th International Computing and Combinatorics.
Uniqueness of Optimal Mod 3 Circuits for Parity Frederic Green Amitabha Roy Frederic Green Amitabha Roy Clark University Akamai Clark University Akamai.
Metric Embeddings with Relaxed Guarantees Hubert Chan Joint work with Kedar Dhamdhere, Anupam Gupta, Jon Kleinberg, Aleksandrs Slivkins.
Largest and Smallest Convex Hulls for Imprecise Points Maarten Löffler Marc van Kreveld Center for Geometry, Imaging and Virtual Environments Utrecht University.
On the Power of Discrete and of Lexicographic Helly Theorems Nir Halman, Technion, Israel This work is part of my Ph.D. thesis, held in Tel Aviv University,
N. Bansal 1, M. Charikar 2, R. Krishnaswamy 2, S. Li 3 1 TU Eindhoven 2 Princeton University 3 TTIC Midwest Theory Day, Purdue, May 3, 2014.
Osculating curves Étienne Ghys CNRS- ENS Lyon « Geometry and the Imagination » Bill Thurston’s 60 th birthday Princeton, June 2007.
Shakhar Smorodinsky Courant Institute, New-York University (NYU) On the Chromatic Number of Some Geometric Hypergraphs.
2007/3/6 1 Online Chasing Problems for Regular n-gons Hiroshi Fujiwara* Kazuo Iwama Kouki Yonezawa.
Convexity of Point Set Sandip Das Indian Statistical Institute.
A New Understanding of Prediction Markets via No-Regret Learning.
Partitioning Sets to Decrease the Diameter N. Harvey U. Waterloo TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A.
1 List Coloring and Euclidean Ramsey Theory TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A Noga Alon, Tel Aviv.
Computational Geometry The art of finding algorithms for solving geometrical problems Literature: –M. De Berg et al: Computational Geometry, Springer,
AHLFORS-REGULAR CURVES Ahlfors Centennial Celebration,Helsinki, August 2007 Zinsmeister Michel, MAPMO, Université d’Orléans.
The Rate of Convergence of AdaBoost Indraneel Mukherjee Cynthia Rudin Rob Schapire.
Chapter 9 Morphological Image Processing. Preview Morphology: denotes a branch of biology that deals with the form and structure of animals and planets.
Computational Geometry The art of finding algorithms for solving geometrical problems Literature: –M. De Berg et al: Computational Geometry, Springer,
Limitations of VCG-Based Mechanisms Shahar Dobzinski Joint work with Noam Nisan.
Efficient Merging and Construction of Evolutionary Trees Andrzej Lingas,Hans Olsson, and Anna Ostlin Journal of Algorithms 2001 Reporter: Jian-Fu Dong.
Sharp Bounds on Geometric Permutations for Pairwise Disjoint Balls in R d Shakhar Smorodinsky Joe Mitchell Micha Sharir.
Voronoi Diagrams and Delaunay Triangulations Generalized spaces and distances.
SPIE Vision Geometry - July '99 Even faster point set pattern matching in 3-d Niagara University and SUNY - Buffalo Laurence Boxer Research.
1 Sampling Lower Bounds via Information Theory Ziv Bar-Yossef IBM Almaden.
Almost Tight Bound for a Single Cell in an Arrangement of Convex Polyhedra in R 3 Esther Ezra Tel-Aviv University.
Vapnik-Chervonenkis Dimension Part II: Lower and Upper bounds.
Theta Function Lecture 24: Apr 18. Error Detection Code Given a noisy channel, and a finite alphabet V, and certain pairs that can be confounded, the.
Randomized Competitive Analysis for Two Server Problems Wolfgang Bein Kazuo Iwama Jun Kawahara.
Preference Analysis Joachim Giesen and Eva Schuberth May 24, 2006.
Almost tight bound for the union of fat tetrahedra in R 3 Esther Ezra Micha Sharir Duke University Tel-Aviv University.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2004 Chapter 4: 3D Convex Hulls Monday, 2/23/04.
Quantum Algorithms II Andrew C. Yao Tsinghua University & Chinese U. of Hong Kong.
On Neighbors in Geometric Permutations Shakhar Smorodinsky Tel-Aviv University Joint work with Micha Sharir.
Caracterização e Vigilância de algumas Subclasses de Polígonos Ortogonais Ana Mafalda Martins Universidade Católica Portuguesa CEOC Encontro Anual CEOC.
T he Separability Problem and its Variants in Quantum Entanglement Theory Nathaniel Johnston Institute for Quantum Computing University of Waterloo.
An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università.
 Jim has six children.  Chris fights with Bob,Faye, and Eve all the time; Eve fights (besides with Chris) with Al and Di all the time; and Al and Bob.
On Balanced + -Contact Representations Stephane Durocher & Debajyoti Mondal University of Manitoba.
Combinatorial Geometry 邓俊辉 清华大学计算机系 2015年10月12日星期一 2015年10月12日星期一 2015年10月12日星期一 2015年10月12日星期一.
On the union of cylinders in 3-space Esther Ezra Duke University.
Wolfgang Mulzer Institut f ür Informatik Data Structures on Event Graphs Bernard ChazelleWolfgang Mulzer FU Berlin Princeton University.
The Graph Minor Theorem CS594 GRAPH THEORY PRESENTATION SPRING 2014 RON HAGAN.
Packing Rectangles into Bins Nikhil Bansal (CMU) Joint with Maxim Sviridenko (IBM)
USING LOTTERIES TO APPROXIMATE THE OPTIMAL REVENUE Paul W. GoldbergUniversity of Liverpool Carmine VentreTeesside University.
On a Network Creation Game PoA Seminar Presenting: Oren Gilon Based on an article by Fabrikant et al 1.
TEL-AVIV UNIVERSITY RAYMOND AND BEVERLY SACKLER FACULTY OF EXACT SCIENCES SCHOOL OF MATHEMATICAL SCIENCES An Algorithm for the Computation of the Metric.
Chapter 9: Geometric Selection Theorems 11/01/2013
Testing the independence number of hypergraphs
Surya Bhupatiraju MIT PRIMES May 20 th, 2012 On the Complexity of the Marginal Consistency Problem.
Approximate Inference: Decomposition Methods with Applications to Computer Vision Kyomin Jung ( KAIST ) Joint work with Pushmeet Kohli (Microsoft Research)
CSP: Algorithms and Dichotomy Conjecture Andrei A. Bulatov Simon Fraser University.
1 The Encoding Complexity of Network Coding Michael Langberg California Institute of Technology Joint work with Jehoshua Bruck and Alex Sprintson.
Fixed parameter algorithms for protein similarity search under mRNA structure constrains A joint work by: G. Blin, G. Fertin, D. Hermelin, and S. Vialette.
2-6 Proving Angles Congruent. Theorem: a conjecture or statement that you prove true.
2/17/ : Verifying Angle Relationships 1 Expectation: You will write proofs in “If, then…” form.
Some Favorite Problems Dan Kleitman, M.I.T.. The Hirsch Conjecture 1. How large can the diameter of a bounded polytope defined by n linear constraints.
Multi-way spectral partitioning and higher-order Cheeger inequalities University of Washington James R. Lee Stanford University Luca Trevisan Shayan Oveis.
Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball Gil Cohen Joint work with Itai Benjamini and Igor Shinkar.
Computational Geometry
Expanders and Ramanujan Graphs Mike Krebs, Cal State LA For slideshow: click “Research and Talks” from
Georgina Hall Princeton, ORFE Joint work with Amir Ali Ahmadi
Discrete Tomography Péter Balázs Department of Image Processing and
Compute convex lower bounding function and optimize it instead!
The Lower Bounds of Problems
Unit 5: Geometric and Algebraic Connections
Quantum Foundations Lecture 2
(Convex) Cones Def: closed under nonnegative linear combinations, i.e.
Presentation transcript:

Line Transversals to Disjoint Balls (Joint with C. Borcea, O. Cheong, X. Goaoc, A. Holmsen) Sylvain Petitjean LORIA, Vegas team O. Schwarzkopf

A long time ago…  E. Helly (1923): n convex sets in R d have a point in common iff every d+1 have a point in common.  Basic combinatorial result on convex sets  E. Helly (1923): n convex sets in R d have a point in common iff every d+1 have a point in common.  Basic combinatorial result on convex sets

Transversals  Reformulate: points hitting convex sets  Raises the obvious question: can one generalize to lines hitting convex sets? (line transversals)  No! Bummer.  Raises the obvious question: can one generalize to lines hitting convex sets? (line transversals)  No! Bummer.

Milestones  Danzer (1957): n disjoint unit discs in R 2 have a line transversal if and only if every 5 discs have a line transversal.  shape is important, convexity not enough  Danzer (1957): n disjoint unit discs in R 2 have a line transversal if and only if every 5 discs have a line transversal.  shape is important, convexity not enough  Hadwiger (1957): n disjoint convex sets in R 2 have a line transversal if and only if every triple has a transversal consistent with some fixed order  order is important  Hadwiger (1957): n disjoint convex sets in R 2 have a line transversal if and only if every triple has a transversal consistent with some fixed order  order is important

In 3D: bummer again!  Holmsen-Matousek (2004): No Helly-type theorem for translates of convex sets, not even with a restriction on the ordering (à la Hadwiger) geometric permutations ≠ isotopy equiv. induced by ordering ≠ equiv. induced by connected components

What about balls?  Danzer’s conjecture: Helly for disjoint balls in nD typeHadwiger numberHelly number Hadwiger (1957) & Grünbaum (1960) thinly distributed in R d d 2  2d-1 Holmsen et al. (2003) & Cheong et al. (2005) disjoint unit in R 3 12  646  11 Cheong et al. (2006)pairwise-inflatable in R d 2d4d-1 Borcea et al. (2007)disjoint in R d 2d 

Convexity of cone of directions  Borcea, Goaoc, P. (2007): Directions of oriented lines stabbing a finite family of disjoint balls in R d in a given order form a strictly convex subset of S d-1  Instrumental in most proofs in transversal theory  Previously known for thinly distributed balls (Hadwiger), pairwise-inflatable balls

3D case: 3 disjoint balls

New proof technique  Write down equations  conics and sextic  Write down equations  conics and sextic  Identify the border arcs  Prove Hessian does not meet them  local convexity  Prove Hessian does not meet them  local convexity  Argue that cone is contractible

Disjointness is a natural boundary

Extension to higher dimensions

Implications: disjoint balls  Isotopy = geometric permutations  Smorodinsky et al. (2000): n disjoint balls in R d have  (n d-1 ) geometric permutations in the worst case  same bound for connected components, previous was O(n 2d-4 ); also better bound in R 3  Isotopy = geometric permutations  Smorodinsky et al. (2000): n disjoint balls in R d have  (n d-1 ) geometric permutations in the worst case  same bound for connected components, previous was O(n 2d-4 ); also better bound in R 3  Hadwiger-type theorem with constant ≤ 2d  But no Helly-type! (need constant bound on geometric permutations)  Hadwiger-type theorem with constant ≤ 2d  But no Helly-type! (need constant bound on geometric permutations)

Conclusions and perspectives  Disjoint balls are nice wrt line transversals!  … but undoubtedly exceptions  Disjoint balls are nice wrt line transversals!  … but undoubtedly exceptions  Optimality (gap between lower and upper bounds)  congruent balls in 3D: Hadwiger between 5 and 6, Helly between 5 and 11  Number of geometric permutations of disjoint unit balls in R 3 : 2 or 3?  Algorithmic perspectives: GLP  Optimality (gap between lower and upper bounds)  congruent balls in 3D: Hadwiger between 5 and 6, Helly between 5 and 11  Number of geometric permutations of disjoint unit balls in R 3 : 2 or 3?  Algorithmic perspectives: GLP Thanks for your attention!