36th european workshop on computational geometry disjoint
play

36th European Workshop on Computational Geometry Disjoint - PowerPoint PPT Presentation

May 15, 2023 •613 likes •1.29k views

36th European Workshop on Computational Geometry Disjoint tree-compatible plane perfect matchings Oswin Aichholzer 1 , Julia Obmann 1 , Pavel Pat ak 2 , Daniel Perz 1 , and Josef Tkadlec 2 1 Graz University of Technology, Austria 2 IST Austria,

  1. 36th European Workshop on Computational Geometry Disjoint tree-compatible plane perfect matchings Oswin Aichholzer 1 , Julia Obmann 1 , Pavel Pat´ ak 2 , Daniel Perz 1 , and Josef Tkadlec 2 1 Graz University of Technology, Austria 2 IST Austria, Klosterneuburg, Austria 1 Julia Obmann Disjoint tree-compatible plane perfect matchings

  2. Compatibility of graphs Setting: set S of 2 n points in the plane in general position 2 i Julia Obmann Disjoint tree-compatible plane perfect matchings

  3. Compatibility of graphs Setting: set S of 2 n points in the plane in general position 2 ii Julia Obmann Disjoint tree-compatible plane perfect matchings

  4. Compatibility of graphs Setting: set S of 2 n points in the plane in general position 2 iii Julia Obmann Disjoint tree-compatible plane perfect matchings

  5. Compatibility of graphs Setting: set S of 2 n points in the plane in general position 2 iv Julia Obmann Disjoint tree-compatible plane perfect matchings

  6. Compatibility of graphs Setting: set S of 2 n points in the plane in general position compatible 2 v Julia Obmann Disjoint tree-compatible plane perfect matchings

  7. Compatibility of graphs Setting: set S of 2 n points in the plane in general position 2 vi Julia Obmann Disjoint tree-compatible plane perfect matchings

  8. Compatibility of graphs Setting: set S of 2 n points in the plane in general position 2 vii Julia Obmann Disjoint tree-compatible plane perfect matchings

  9. Compatibility of graphs Setting: set S of 2 n points in the plane in general position disjoint compatible 2 viii Julia Obmann Disjoint tree-compatible plane perfect matchings

  10. Compatibility of matchings 3 i Julia Obmann Disjoint tree-compatible plane perfect matchings

  11. Compatibility of matchings • compatibility graph: ◦ vertices: all plane perfect matchings on S ◦ edge ( M i , M j ) ⇐ ⇒ M i and M j are compatible 3 ii Julia Obmann Disjoint tree-compatible plane perfect matchings

  12. Compatibility of matchings • compatibility graph: ◦ vertices: all plane perfect matchings on S ◦ edge ( M i , M j ) ⇐ ⇒ M i and M j are compatible • compatibility graph for matchings is connected convex point set: [C. Hernando, F. Hurtado and M. Noy; 2002.] general point set: [M.E. Houle, F. Hurtado, M. Noy and E. Rivera-Campo; 2005.] 3 iii Julia Obmann Disjoint tree-compatible plane perfect matchings

  13. Compatibility of matchings • compatibility graph: ◦ vertices: all plane perfect matchings on S ◦ edge ( M i , M j ) ⇐ ⇒ M i and M j are compatible • compatibility graph for matchings is connected convex point set: [C. Hernando, F. Hurtado and M. Noy; 2002.] general point set: [M.E. Houle, F. Hurtado, M. Noy and E. Rivera-Campo; 2005.] • diameter is O (log n ) [ABDGHHKMRSSUW; 2009.] and Ω(log n/ log log n ) [A.Razen; 2008.] 3 iv Julia Obmann Disjoint tree-compatible plane perfect matchings

  14. Disjoint compatibility of matchings 4 i Julia Obmann Disjoint tree-compatible plane perfect matchings

  15. Disjoint compatibility of matchings • disjoint compatibility graph: ◦ vertices: all plane perfect matchings on S ◦ edge ( M i , M j ) ⇐ ⇒ M i , M j are disjoint compatible 4 ii Julia Obmann Disjoint tree-compatible plane perfect matchings

  16. Disjoint compatibility of matchings • disjoint compatibility graph: ◦ vertices: all plane perfect matchings on S ◦ edge ( M i , M j ) ⇐ ⇒ M i , M j are disjoint compatible • disjoint compatibility graph for matchings on point sets of 2 n ≥ 6 points in convex position is disconnected [O. Aichholzer, A. Asinowski and T. Miltzow; 2015.] 4 iii Julia Obmann Disjoint tree-compatible plane perfect matchings

  17. Disjoint compatibility of matchings • disjoint compatibility graph: ◦ vertices: all plane perfect matchings on S ◦ edge ( M i , M j ) ⇐ ⇒ M i , M j are disjoint compatible • disjoint compatibility graph for matchings on point sets of 2 n ≥ 6 points in convex position is disconnected [O. Aichholzer, A. Asinowski and T. Miltzow; 2015.] Alternative way of defining compatibility? 4 iv Julia Obmann Disjoint tree-compatible plane perfect matchings

  18. Disjoint tree-compatibility of matchings 5 i Julia Obmann Disjoint tree-compatible plane perfect matchings

  19. Disjoint tree-compatibility of matchings • consider ’compatibility’ via disjoint compatible plane spanning trees 5 ii Julia Obmann Disjoint tree-compatible plane perfect matchings

  20. Disjoint tree-compatibility of matchings • consider ’compatibility’ via disjoint compatible plane spanning trees 5 iii Julia Obmann Disjoint tree-compatible plane perfect matchings

  21. Disjoint tree-compatibility of matchings • consider ’compatibility’ via disjoint compatible plane spanning trees 5 iv Julia Obmann Disjoint tree-compatible plane perfect matchings

  22. Disjoint tree-compatibility of matchings • consider ’compatibility’ via disjoint compatible plane spanning trees not compatible! 5 v Julia Obmann Disjoint tree-compatible plane perfect matchings

  23. Disjoint tree-compatibility of matchings • consider ’compatibility’ via disjoint compatible plane spanning trees 5 vi Julia Obmann Disjoint tree-compatible plane perfect matchings

  24. Disjoint tree-compatibility of matchings • consider ’compatibility’ via disjoint compatible plane spanning trees 5 vii Julia Obmann Disjoint tree-compatible plane perfect matchings

  25. Disjoint tree-compatibility of matchings • consider ’compatibility’ via disjoint compatible plane spanning trees matchings are disjoint tree-compatible (for short: tree-compatible) 5 viii Julia Obmann Disjoint tree-compatible plane perfect matchings

  26. Disjoint tree-compatibility of matchings • consider ’compatibility’ via disjoint compatible plane spanning trees • disjoint tree-compatibility graph G 2 n : ◦ vertices: all plane perfect matchings on S ◦ edge ( M i , M j ) ⇐ ⇒ M i , M j disjoint tree-compatible 5 ix Julia Obmann Disjoint tree-compatible plane perfect matchings

  27. Disjoint tree-compatibility of matchings • consider ’compatibility’ via disjoint compatible plane spanning trees ATTENTION: different from (disjoint) compatibility! • disjoint tree-compatibility graph G 2 n : disjoint tree-compatible � compatible ◦ vertices: all plane perfect matchings on S disjoint compatible � disjoint tree-compatible ◦ edge ( M i , M j ) ⇐ ⇒ M i , M j disjoint tree-compatible 5 x Julia Obmann Disjoint tree-compatible plane perfect matchings

  28. Disjoint tree-compatibility of matchings • consider ’compatibility’ via disjoint compatible plane spanning trees disjoint compatible NOT disjoint tree-compatible ATTENTION: different from (disjoint) compatibility! disjoint tree-compatible � compatible disjoint compatible � disjoint tree-compatible 5 xi Julia Obmann Disjoint tree-compatible plane perfect matchings

  29. G 8 6 i Julia Obmann Disjoint tree-compatible plane perfect matchings

  30. G 8 6 ii Julia Obmann Disjoint tree-compatible plane perfect matchings

  31. G 8 6 iii Julia Obmann Disjoint tree-compatible plane perfect matchings

  32. G 8 6 iv Julia Obmann Disjoint tree-compatible plane perfect matchings

  33. G 8 6 v Julia Obmann Disjoint tree-compatible plane perfect matchings

  34. G 8 6 vi Julia Obmann Disjoint tree-compatible plane perfect matchings

  35. G 8 6 vii Julia Obmann Disjoint tree-compatible plane perfect matchings

  36. G 8 6 viii Julia Obmann Disjoint tree-compatible plane perfect matchings

  37. G 8 6 ix Julia Obmann Disjoint tree-compatible plane perfect matchings

  38. Upper bound 7 i Julia Obmann Disjoint tree-compatible plane perfect matchings

  39. Upper bound Theorem 1. For 2 n ≥ 10 , the graph G 2 n is connected and diam( G 2 n ) ≤ 5 . 7 ii Julia Obmann Disjoint tree-compatible plane perfect matchings

  40. Upper bound Theorem 1. For 2 n ≥ 10 , the graph G 2 n is connected and diam( G 2 n ) ≤ 5 . Proof Idea. 7 iii Julia Obmann Disjoint tree-compatible plane perfect matchings

  41. Upper bound Theorem 1. For 2 n ≥ 10 , the graph G 2 n is connected and diam( G 2 n ) ≤ 5 . Proof Idea. • ”inside semicycles” can be (simultaneously) rotated in one step 7 iv Julia Obmann Disjoint tree-compatible plane perfect matchings

  42. Upper bound Theorem 1. For 2 n ≥ 10 , the graph G 2 n is connected and diam( G 2 n ) ≤ 5 . Proof Idea. • ”inside semicycles” can be (simultaneously) rotated in one step X 1 X 2 7 v Julia Obmann Disjoint tree-compatible plane perfect matchings

  43. Upper bound Theorem 1. For 2 n ≥ 10 , the graph G 2 n is connected and diam( G 2 n ) ≤ 5 . Proof Idea. • ”inside semicycles” can be (simultaneously) rotated in one step X 1 X 2 7 vi Julia Obmann Disjoint tree-compatible plane perfect matchings

  44. Upper bound Theorem 1. For 2 n ≥ 10 , the graph G 2 n is connected and diam( G 2 n ) ≤ 5 . Proof Idea. • ”inside semicycles” can be (simultaneously) rotated in one step 7 vii Julia Obmann Disjoint tree-compatible plane perfect matchings

  45. Upper bound Theorem 1. For 2 n ≥ 10 , the graph G 2 n is connected and diam( G 2 n ) ≤ 5 . Proof Idea. • ”inside semicycles” can be (simultaneously) rotated in one step • large ”semiears” ( ≥ 12 vertices) can be rotated in at most 3 steps 7 viii Julia Obmann Disjoint tree-compatible plane perfect matchings

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Computational Geometry Algorithm Library Efi Fogel Tel Aviv University Computational Geometry

Computational Geometry Algorithm Library Efi Fogel Tel Aviv University Computational Geometry

Computational Geometry Algorithm Library Efi Fogel Tel Aviv University Computational Geometry Apr. 7 th , 2014 Cgal : Mission Make the large body of geometric algorithms developed in the field of computational geometry available for

542 views • 21 slides
Challenges in Computational Algebraic David A. Cox Geometry Challenge 1: Other Computational

Challenges in Computational Algebraic David A. Cox Geometry Challenge 1: Other Computational

Challenges in Computational Algebraic Geometry Challenges in Computational Algebraic David A. Cox Geometry Challenge 1: Other Computational Algebraic Geometry Workshop Disciplines Article in Nature The Mathematics Methods Challenge 2:

343 views • 33 slides
Exact and efficient computations on circles in C GAL - Experiments Pedro M. M. de Castro, Sylvain

Exact and efficient computations on circles in C GAL - Experiments Pedro M. M. de Castro, Sylvain

Exact and efficient computations on circles in C GAL - Experiments Pedro M. M. de Castro, Sylvain Pion, Monique Teillaud European Workshop on Computational Geometry Graz - 2007 The Computational Geometry Algorithms Library Open Source project

887 views • 21 slides
Computational Geometry (Master Course) Computational Geometry Course Outline Mohammad Farshi

Computational Geometry (Master Course) Computational Geometry Course Outline Mohammad Farshi

Yazd Univ. Computational Geometry (Master Course) Computational Geometry Course Outline Mohammad Farshi Textbook Grading Prerequisties Department of Computer Science, Introduction What is CG? Yazd University Research on CG Journals

367 views • 20 slides
Maximizing the Sum of Radii of Disjoint Balls or Disks David Eppstein 28th Canadian Conference

Maximizing the Sum of Radii of Disjoint Balls or Disks David Eppstein 28th Canadian Conference

Maximizing the Sum of Radii of Disjoint Balls or Disks David Eppstein 28th Canadian Conference on Computational Geometry (CCCG 2016) Vancouver, Canada, August 2016 Tradeoff in label size for map labeling Too small: hard to find Too big:

399 views • 13 slides
Computational Geometry Exercise session #1 Yaron Ostrovsky-Berman, Computational Geometry, Spring

Computational Geometry Exercise session #1 Yaron Ostrovsky-Berman, Computational Geometry, Spring

Computational Geometry Exercise session #1 Yaron Ostrovsky-Berman, Computational Geometry, Spring 2005 1 Administrivia Exercise sessions (Shprinzak 202): Wednesday, 11:00 11:45. Course web page: www.cs.huji.ac.il/~compgeom

770 views • 9 slides
Untangling and Unwinding Curves Dagstuhl Workshop on Computational Geometry April 27, 2017 Jeff

Untangling and Unwinding Curves Dagstuhl Workshop on Computational Geometry April 27, 2017 Jeff

Untangling and Unwinding Curves Dagstuhl Workshop on Computational Geometry April 27, 2017 Jeff Erickson University of Illinois at Urbana-Champaign Joint work with Hsien-Chih Chang Portions appeared at SOCG 2016 http://a.carapetis.com/csf/

502 views • 39 slides
CS133 Computational Geometry Computational Geometry Primitives 1 Point Representation A point

CS133 Computational Geometry Computational Geometry Primitives 1 Point Representation A point

CS133 Computational Geometry Computational Geometry Primitives 1 Point Representation A point in the 2D Cartesian space is represented as a vector from the origin to the point = , p p y O x 2 Line Segment Representation

727 views • 16 slides
Pseudotriangulations in Computational Geometry G unter Rote Freie Universit at Berlin,

Pseudotriangulations in Computational Geometry G unter Rote Freie Universit at Berlin,

1 Pseudotriangulations in Computational Geometry G unter Rote Freie Universit at Berlin, Institut f ur Informatik Fall School on Computational Geometry Graduate Program Combinatorics, Geometry, and Computing October 24,

1.65k views • 151 slides
Semiclassical methods In SCFTs and emergent geometry David Berenstein XV european workshop

Semiclassical methods In SCFTs and emergent geometry David Berenstein XV european workshop

Semiclassical methods In SCFTs and emergent geometry David Berenstein XV european workshop on string theory Zurich, September 11,2009 CFT/ADS The ads/Cft correspondence has revolutionized how we think about quantum gravity and strongly

656 views • 50 slides
Disjoint sequences in Banach lattices Pedro Tradacete Mathematics Department, UC3M Based on

Disjoint sequences in Banach lattices Pedro Tradacete Mathematics Department, UC3M Based on

Disjoint sequences in Banach lattices Pedro Tradacete Mathematics Department, UC3M Based on joint work with J. Flores, F. Hern andez, E. Semenov, E. Spinu, V. Troitsky First Brazilian Workshop in Geometry of Banach Spaces 25-29 August 2014,

590 views • 33 slides
Plane Sweep Algorithms II Carola Wenk 1/22/15 1 CMPS 3130/6130 Computational Geometry

Plane Sweep Algorithms II Carola Wenk 1/22/15 1 CMPS 3130/6130 Computational Geometry

CMPS 3130/6130 Computational Geometry Spring 2015 Plane Sweep Algorithms II Carola Wenk 1/22/15 1 CMPS 3130/6130 Computational Geometry Geometric Intersections Important and basic problem in Computational Geometry Solid modeling:

425 views • 14 slides
Graph & Geometry Problems in Data Streams 2009 Barbados Workshop on Computational Complexity

Graph & Geometry Problems in Data Streams 2009 Barbados Workshop on Computational Complexity

Graph & Geometry Problems in Data Streams 2009 Barbados Workshop on Computational Complexity Andrew McGregor Introduction Models: Graph Streams: Stream of edges E = { e 1 , e 2 , . . . , e m } describe a graph G on n nodes. Estimate

740 views • 69 slides
CS133 Computational Geometry Computational Geometry on Big Data 1 Big Geometric Data Geotagged

CS133 Computational Geometry Computational Geometry on Big Data 1 Big Geometric Data Geotagged

CS133 Computational Geometry Computational Geometry on Big Data 1 Big Geometric Data Geotagged Satellite Imagery Check ins Tweets Billions of check ins More than 17 PB Billions of tweets Millions more every day 2 MapReduce Map Reduce

558 views • 20 slides
Computational Geometry Lecture 13: More on Voronoi diagrams Computational Geometry Lecture 13:

Computational Geometry Lecture 13: More on Voronoi diagrams Computational Geometry Lecture 13:

Voronoi diagrams of line segments Farthest-point Voronoi diagrams More on Voronoi diagrams Computational Geometry Lecture 13: More on Voronoi diagrams Computational Geometry Lecture 13: More on Voronoi diagrams Motion planning for a disc

1.69k views • 92 slides
Disjoint Sets and Disjoint sets The UNION-FIND ADT for disjoint sets the UNION-FIND

Disjoint Sets and Disjoint sets The UNION-FIND ADT for disjoint sets the UNION-FIND

10/25/2016 Where we are Last lecture: Hashing and collision resolution CSE373: Data Structures and Algorithms Today: Disjoint Sets and Disjoint sets The UNION-FIND ADT for disjoint sets the UNION-FIND ADT Next lecture:

352 views • 5 slides
On a New Proof of the Faber-Manteuffel Theorem Petr Tich joint work with Jrg Liesen and

On a New Proof of the Faber-Manteuffel Theorem Petr Tich joint work with Jrg Liesen and

On a New Proof of the Faber-Manteuffel Theorem Petr Tich joint work with Jrg Liesen and Vance Faber Institute of Computer Science, Academy of Sciences of the Czech Republic June 2, 2008, Zeuthen, Germany Householder Symposium XVII 1

1.11k views • 63 slides
CMPSC 497: Midterm Review Trent Jaeger Systems and Internet Infrastructure Security (SIIS)

CMPSC 497: Midterm Review Trent Jaeger Systems and Internet Infrastructure Security (SIIS)

CMPSC 497: Midterm Review Trent Jaeger Systems and Internet Infrastructure Security (SIIS) Lab Computer Science and Engineering Department Pennsylvania State University Systems and Internet Infrastructure Security Laboratory (SIIS) Page 1

962 views • 51 slides
Modulo- Parallel Prefix Addition via Excess-Modulo Encoding of

Modulo- Parallel Prefix Addition via Excess-Modulo Encoding of

SBU - Tehran ENSL - Lyon Modulo- Parallel Prefix Addition via Excess-Modulo Encoding of Residues Seyed Hamed Fatemi Langroudi & Ghassem Jaberipur Computer Science & Engineering Department Shahid

1.35k views • 113 slides
A Learning Bridge from Architectural Synthesis to Physical Design for Exploring Power Efficient

A Learning Bridge from Architectural Synthesis to Physical Design for Exploring Power Efficient

A Learning Bridge from Architectural Synthesis to Physical Design for Exploring Power Efficient High-Performance Adders Subhendu Roy 1 Yuzhe Ma 2 Jin Miao 1 Bei Yu 2 1 Cadence Design Systems 2 The Chinese University of Hong Kong ISLPED17 1 /

454 views • 27 slides
Instruction scheduling However, that order is usually not the only valid one, in the sense that

Instruction scheduling However, that order is usually not the only valid one, in the sense that

Instruction ordering When a compiler emits the instructions corresponding to a program, it imposes a total order on them. Instruction scheduling However, that order is usually not the only valid one, in the sense that it can be changed without

209 views • 3 slides
Theory of Peer Data Management Sebastian Skritek Database and Artificial Intelligence Group

Theory of Peer Data Management Sebastian Skritek Database and Artificial Intelligence Group

Theory of Peer Data Management Sebastian Skritek Database and Artificial Intelligence Group Vienna University of Technology DEIS 2010 S.Skritek Theory of PDM 1/54 1.Motivation 1.1. Motivation Motivation From Data Integration to Peer

1.67k views • 123 slides
Good towers of function fields Peter Beelen RICAM Workshop on Algebraic Curves Over Finite Fields

Good towers of function fields Peter Beelen RICAM Workshop on Algebraic Curves Over Finite Fields

Good towers of function fields Peter Beelen RICAM Workshop on Algebraic Curves Over Finite Fields 12th of November 2013 joint with Alp Bassa and Nhut Nguyen Recursive towers Explicit recursive towers have given rise to good lower bounds on

807 views • 47 slides
PubPol 201 Module 3: International Trade Policy Class 2 The Gains and Losses from Trade Class

PubPol 201 Module 3: International Trade Policy Class 2 The Gains and Losses from Trade Class

PubPol 201 Module 3: International Trade Policy Class 2 The Gains and Losses from Trade Class 2 Outline The Gains and Losses from Trade Comparative advantage Other sources of gain from trade Who gains and who loses from trade

870 views • 61 slides

More recommend