Making Triangulations 4-connected using Flips Prosenjit Bose, Dana - PowerPoint PPT Presentation

Making Triangulations 4-connected using Flips Prosenjit Bose, Dana Jansens, Andr´ e van Renssen, Maria Saumell and Sander Verdonschot Carleton University December 19, 2011 Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 1 / 21

Flips Replace one diagonal of a quadrilateral with the other Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 2 / 21

Flip Graph Vertex for each triangulation Edge if two triangulations differ by one flip Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 3 / 21

Flip Graph Vertex for each triangulation Edge if two triangulations differ by one flip Flip Distance: shortest path in flip graph Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 3 / 21

Flip Graph Connected? Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 4 / 21

Flip Graph Connected? Yes - Wagner (1936) Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 4 / 21

Flip Graph Connected? Yes - Wagner (1936) Diameter? O ( n 2 ) - Wagner (1936) Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 4 / 21

Flip Graph Connected? Yes - Wagner (1936) Diameter? O ( n 2 ) - Wagner (1936) 8 n − 54 - Komuro (1997) 6 n − 30 - Mori et al. (2003) Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 4 / 21

Algorithm Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 5 / 21

Algorithm Mori et al. Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 6 / 21

Algorithm Mori et al. 4-connected ⇒ Hamiltonian Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 6 / 21

Algorithm Mori et al. n − 4 2 n − 11 4-connected ⇒ Hamiltonian Total: 6 n − 30 Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 6 / 21

Algorithm Mori et al. 3 n − 6 5 n − 4 2 n − 11 4-connected ⇒ Hamiltonian Total: 6 n − 30 5 . 2 n − 24 . 4 Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 6 / 21

Making triangulations 4-connected Separating triangle : 3-cycle whose removal disconnects the graph Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 7 / 21

Making triangulations 4-connected Separating triangle : 3-cycle whose removal disconnects the graph No separating triangles ⇐ ⇒ 4-connected Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 7 / 21

Making triangulations 4-connected Separating triangle : 3-cycle whose removal disconnects the graph No separating triangles ⇐ ⇒ 4-connected Flipping an edge of a separating triangle removes it Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 7 / 21

Making triangulations 4-connected Separating triangle : 3-cycle whose removal disconnects the graph No separating triangles ⇐ ⇒ 4-connected Flipping an edge of a separating triangle removes it Prefer shared edges Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 7 / 21

Upper Bound To prove: #flips ≤ (3 n − 6) / 5 Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 8 / 21

Upper Bound To prove: #flips ≤ (3 n − 6) / 5 Charging scheme: Coin on every edge Pay 5 coins per flip Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 8 / 21

Paying for flips Invariant: Every edge of a separating triangle has a coin Charge the flipped edge Charge all edges that aren’t shared Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 9 / 21

Paying for flips Free edge : edge that is not part of any separating triangle Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 10 / 21

Paying for flips Free edge : edge that is not part of any separating triangle Every vertex of a separating triangle is incident to a free edge inside the triangle Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 10 / 21

Paying for flips Free edge : edge that is not part of any separating triangle Invariant: Every vertex of a separating triangle is incident to a free edge inside the triangle that has a coin Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 10 / 21

Paying for flips Free edge : edge that is not part of any separating triangle Invariant: Every vertex of a separating triangle is incident to a free edge inside the triangle that has a coin Charge all free edges that aren’t needed by other separating triangles Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 10 / 21

Which edges to flip? A deepest separating triangle is contained in the maximum number of separating triangles Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 11 / 21

Which edges to flip? A deepest separating triangle is contained in the maximum number of separating triangles Flip: An arbitrary edge Shared with other separating triangles Not shared with a containing triangle Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 11 / 21

Which edges to flip? Case 1: No shared edges We can charge: The flipped edge An unshared triangle edge An unshared free edge A superfluous free edge Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 12 / 21

Which edges to flip? Case 2: Shares edges with non-containing triangles We can charge: The flipped edge An unshared triangle edge An unshared free edge A superfluous free edge Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 13 / 21

Which edges to flip? Case 3: Shares one edge with containing triangle We can charge: The flipped edge An unshared triangle edge An unshared free edge A superfluous free edge Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 14 / 21

Summary � 3 n − 7 � Any triangulation can be made 4-connected by flips 5 Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 15 / 21

Lower Bound Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 16 / 21

Lower Bound (3 n − 10) / 5 edge-disjoint separating triangles Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 16 / 21

Summary � 3 n − 7 � Any triangulation can be made 4-connected by flips 5 � 3 n − 10 � There are triangulations where this requires flips 5 Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 17 / 21

Summary n − 4 2 n − 11 4-connected Total: 6 n − 30 Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 18 / 21

Summary � 3 n − 7 � 5 n − 4 2 n − 11 4-connected 5 . 2 n − 24 . 8 Total: 6 n − 30 Sander Verdonschot (Carleton University) Making Triangulations 4-connected December 19, 2011 18 / 21

Making Triangulations 4-connected using Flips Prosenjit Bose, Dana - PowerPoint PPT Presentation

Making Triangulations 4-connected using Flips Prosenjit Bose, Dana Jansens, Andr e van Renssen, Maria Saumell and Sander Verdonschot Carleton University December 19, 2011 Sander Verdonschot (Carleton University) Making Triangulations

Making Triangulations 4-connected using Flips Prosenjit Bose, Dana Jansens, Andr e van Renssen,

Flips in Edge-Labelled Triangulations Prosenjit Bose 1 Anna Lubiw 2 Vinayak Pathak 2 Sander

Flips in higher order Delaunay triangulations Elena Arseneva, Prosenjit Bose, Pilar Cano, and

Flips in Edge-Labelled Pseudo-Triangulations Prosenjit Bose Sander Verdonschot Carleton

On the mixing time of the flip walk on triangulations of the sphere Thomas Budzinski ENS Paris

Flips, Arrangements and Tableaux Ron Adin and Yuval Roichman Bar-Ilan University radin, yuvalr

On the mixing time of the flip walk on triangulations of the sphere Thomas Budzinski ENS Paris

Flips, double flips and advanced flips: next steps in flipping the classroom Dr Fiona J. L.

Connections between decomposition trees of 3-connected plane triangulations and hamiltonian

4-Connected Triangulations on Few Lines GD 2019 September 20., 2019 Pr uhonice/Prague Stefan

Building Good Triangulations 1. Nets and thick triangulations 2. Triangulation of manifolds

National Vision for a Connected Future Getting There 1 Making Progress Vehicles Miles Driven |

Probability and Delaunay triangulations 1 Randomized algorithms for Delaunay triangulations

Hamiltonian Triangulations and Triangle Strips: an overview Peter Palfrader University of

4-Connected Polyhedra have a Linear Number of Hamiltonian Cycles Gunnar Brinkmann, Nico Van

Connectivity and Biconnectivity 462 cec CS 16: Connectivity Connected Components Connected

Triangulation of 2-loop MHV Amplituhedron from sign flips Ryota Kojima Sokendai, KEK theory

Triangulations Of Polytopes and Algebraic Geometry Francisco Santos Universidad de Cantabria,

Counting Polygon Triangulations is Hard David Eppstein University of California, Irvine

Invariants de Tutte et triangulations avec mod` ele dIsing Marie Albenque (CNRS and LIX) joint

Small Groups: Slides, Flips and Turns with MELDS.M.G.PS.8 MELDS.MD.PS.5 Geometric Shapes Week 3

Convergence of simple Triangulations Marie Albenque (CNRS, LIX, Ecole Polytechnique) Louigi

Small Triangulations of Projective Spaces Sonia Balagopalan Maynooth University

Societal Decision Making in a Web-Connected World. Simon French simon.french@warwick.ac.uk