Flips in Edge-Labelled Triangulations Prosenjit Bose 1 Anna Lubiw 2 - PowerPoint PPT Presentation

Flips in Edge-Labelled Triangulations Prosenjit Bose 1 Anna Lubiw 2 Vinayak Pathak 2 Sander Verdonschot 1 1 Carleton University 2 University of Waterloo 28 May 2015 Sander Verdonschot Flips in Edge-Labelled Triangulations

Triangulations • Graphs where all faces are triangles Sander Verdonschot Flips in Edge-Labelled Triangulations

• Diagonals have unique labels Flips • Replace edge by other diagonal of quadrilateral Sander Verdonschot Flips in Edge-Labelled Triangulations

Flips • Replace edge by other diagonal of quadrilateral • Diagonals have unique labels 1 1 3 3 5 5 6 6 2 2 4 4 Sander Verdonschot Flips in Edge-Labelled Triangulations

Flip graphs • Vertex = triangulation, Edge = flip Sander Verdonschot Flips in Edge-Labelled Triangulations

• O n — Sleator et al., 1992 • 8 n O 1 — Komuro, 1997 • 6 n O 1 — Mori et al., 2001 • 5 2 n O 1 — Bose et al., 2014 • 5 n O 1 — Cardinal et al., 2015 History • Introduced by Wagner in 1936 • Flip graph of combinatorial triangulations is connected • Diameter: • O ( n 2 ) — Wagner, 1936 Sander Verdonschot Flips in Edge-Labelled Triangulations

History • Introduced by Wagner in 1936 • Flip graph of combinatorial triangulations is connected • Diameter: • O ( n 2 ) — Wagner, 1936 • O ( n ) — Sleator et al., 1992 • 8 n − O ( 1 ) — Komuro, 1997 • 6 n − O ( 1 ) — Mori et al., 2001 • 5 . 2 n − O ( 1 ) — Bose et al., 2014 • 5 n − O ( 1 ) — Cardinal et al., 2015 Sander Verdonschot Flips in Edge-Labelled Triangulations

History • Triangulation of convex polygon = binary tree • Diameter = 2 n − 10 — Sleator et al., 1988 Sander Verdonschot Flips in Edge-Labelled Triangulations

• What happens when edges are labelled? History • What happens when the vertices are labelled? • Diameter is Θ ( n log n ) - Sleator et al., 1992 7 4 5 3 6 2 1 Sander Verdonschot Flips in Edge-Labelled Triangulations

History • What happens when the vertices are labelled? • Diameter is Θ ( n log n ) - Sleator et al., 1992 • What happens when edges are labelled? 7 4 5 3 6 2 1 Sander Verdonschot Flips in Edge-Labelled Triangulations

• Via canonical form T C • We only need to show T T C Upper bound • Transform T 1 into T 2 Sander Verdonschot Flips in Edge-Labelled Triangulations

• We only need to show T T C Upper bound • Transform T 1 into T 2 • Via canonical form T C Sander Verdonschot Flips in Edge-Labelled Triangulations

Upper bound • Transform T 1 into T 2 • Via canonical form T C • We only need to show T �→ T C Sander Verdonschot Flips in Edge-Labelled Triangulations

Transform into canonical • Ignore labels • Sort Sander Verdonschot Flips in Edge-Labelled Triangulations

• We can do insertion sort • Flip graph is connected! • Diameter is O n 2 • Can we do better? Sorting • We can exchange adjacent diagonals Sander Verdonschot Flips in Edge-Labelled Triangulations

• Flip graph is connected! • Diameter is O n 2 • Can we do better? Sorting • We can exchange adjacent diagonals • We can do insertion sort Sander Verdonschot Flips in Edge-Labelled Triangulations

• Can we do better? Sorting • We can exchange adjacent diagonals • We can do insertion sort • Flip graph is connected! • Diameter is O ( n 2 ) Sander Verdonschot Flips in Edge-Labelled Triangulations

Sorting • We can exchange adjacent diagonals • We can do insertion sort • Flip graph is connected! • Diameter is O ( n 2 ) • Can we do better? Sander Verdonschot Flips in Edge-Labelled Triangulations

• Flip all neutral edges • Reverse • Recurse Quicksort • Partition on the median Sander Verdonschot Flips in Edge-Labelled Triangulations

Quicksort • Partition on the median • Flip all neutral edges • Reverse • Recurse Sander Verdonschot Flips in Edge-Labelled Triangulations

— O 1 — T n 2 — O 1 • Reversing more: O n flips total • Flip middle pair “up” • Recurse on the rest • Reverse middle pair Reverse • Reversing two edges is easy: Sander Verdonschot Flips in Edge-Labelled Triangulations

O n flips total — O 1 — T n 2 — O 1 Reverse • Reversing two edges is easy: • Reversing more: • Flip middle pair “up” • Recurse on the rest • Reverse middle pair Sander Verdonschot Flips in Edge-Labelled Triangulations

Reverse • Reversing two edges is easy: • Reversing more: = O ( n ) flips total • Flip middle pair “up” — O ( 1 ) • Recurse on the rest — T ( n − 2 ) • Reverse middle pair — O ( 1 ) Sander Verdonschot Flips in Edge-Labelled Triangulations

Quicksort • Partition on the median • Flip all neutral edges — O ( n ) = O ( n log n ) flips total • Reverse — O ( n ) • Recurse — 2 T ( n / 2 ) Sander Verdonschot Flips in Edge-Labelled Triangulations

Transform into canonical • Ignore labels — O ( n ) • Sort — O ( n log n ) Sander Verdonschot Flips in Edge-Labelled Triangulations

— O n log n Upper bound • Transform T 1 into T 2 • Via canonical form T C • We only need to show T �→ T C — O ( n log n ) Sander Verdonschot Flips in Edge-Labelled Triangulations

Upper bound • Transform T 1 into T 2 — O ( n log n ) • Via canonical form T C • We only need to show T �→ T C — O ( n log n ) Sander Verdonschot Flips in Edge-Labelled Triangulations

• There are over n edge-labelled triangulations: 2 O n d n O n d log n d n log n Theorem The diameter of the flip graph is n log n . Lower bound Theorem (Sleator, Tarjan, and Thurston, 1992) Given a triangulation T of a convex polygon, the number of triangulations reachable from T by a sequence of m flips is at most 2 O ( n + m ) , regardless of labellings. Sander Verdonschot Flips in Edge-Labelled Triangulations

Theorem The diameter of the flip graph is n log n . Lower bound Theorem (Sleator, Tarjan, and Thurston, 1992) Given a triangulation T of a convex polygon, the number of triangulations reachable from T by a sequence of m flips is at most 2 O ( n + m ) , regardless of labellings. • There are over n ! edge-labelled triangulations: 2 O ( n + d ) � n ! O ( n + d ) � log n ! d � Ω ( n log n ) Sander Verdonschot Flips in Edge-Labelled Triangulations

Lower bound Theorem (Sleator, Tarjan, and Thurston, 1992) Given a triangulation T of a convex polygon, the number of triangulations reachable from T by a sequence of m flips is at most 2 O ( n + m ) , regardless of labellings. • There are over n ! edge-labelled triangulations: 2 O ( n + d ) � n ! O ( n + d ) � log n ! d � Ω ( n log n ) Theorem The diameter of the flip graph is Θ ( n log n ) . Sander Verdonschot Flips in Edge-Labelled Triangulations

Combinatorial triangulations • Not all flips are valid Sander Verdonschot Flips in Edge-Labelled Triangulations

Combinatorial triangulations • Transform to a canonical form — O ( n ) • Sort the labels — ? Sander Verdonschot Flips in Edge-Labelled Triangulations

• Flip graph is connected! Combinatorial triangulations • Exchange spine edge with incident non-spine edge Sander Verdonschot Flips in Edge-Labelled Triangulations

Combinatorial triangulations • Exchange spine edge with incident non-spine edge • Flip graph is connected! Sander Verdonschot Flips in Edge-Labelled Triangulations

— O 1 — O n log n — O n • Flip external edge • Use convex polygon result • Swap boundary edges in Combinatorial triangulations • Faster: reorder all labels around inner vertex at the same time Sander Verdonschot Flips in Edge-Labelled Triangulations

— O n log n — O n — O 1 • Use convex polygon result • Swap boundary edges in Combinatorial triangulations • Faster: reorder all labels around inner vertex at the same time • Flip external edge Sander Verdonschot Flips in Edge-Labelled Triangulations

— O n — O 1 — O n log n • Swap boundary edges in Combinatorial triangulations • Faster: reorder all labels around inner vertex at the same time • Flip external edge • Use convex polygon result Sander Verdonschot Flips in Edge-Labelled Triangulations

— O 1 — O n log n — O n Combinatorial triangulations • Faster: reorder all labels around inner vertex at the same time • Flip external edge • Use convex polygon result • Swap boundary edges in Sander Verdonschot Flips in Edge-Labelled Triangulations

Combinatorial triangulations • Faster: reorder all labels around inner vertex at the same time • Flip external edge — O ( 1 ) • Use convex polygon result — O ( n log n ) • Swap boundary edges in — O ( n ) Sander Verdonschot Flips in Edge-Labelled Triangulations

Combinatorial triangulations • Transform to a canonical form — O ( n ) • Sort the labels — O ( n log n ) Sander Verdonschot Flips in Edge-Labelled Triangulations

Flips in Edge-Labelled Triangulations Prosenjit Bose 1 Anna Lubiw 2 - PowerPoint PPT Presentation

Flips in Edge-Labelled Triangulations Prosenjit Bose 1 Anna Lubiw 2 Vinayak Pathak 2 Sander Verdonschot 1 1 Carleton University 2 University of Waterloo 28 May 2015 Sander Verdonschot Flips in Edge-Labelled Triangulations Triangulations

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

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

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

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

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

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

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.

Expanders via Local Edge Flips Zeyuan Allen-Zhu Vahab Mirrokni Lorenzo Orecchia Aditya

Edge state integrals on shaped triangulations Rinat Kashaev University of Geneva joint work with

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

On Hypersequents and Labelled Sequents Translating Labelled Sequent Proofs to Hypersequent Proofs

Rectangle-of-influence triangulations Therese Biedl 1 Anna Lubiw 1 Saeed Mehrabi 1 Sander

Probability and Delaunay triangulations 1 Randomized algorithms for Delaunay triangulations

Incremental Construction of Constrained Delaunay Triangulations Jonathan Richard Shewchuk

Protein NMR What do you need for the assignment? To prepare isotopically labelled protein ( 13

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

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,

Skolem labelled graphs, old and new results Nabil Shalaby Department of Mathematics and

Cloud Cloud Cloud Cloud network Edge Edge Edge Edge as a Edge Edge Edge Edge Edge

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

Edge-based Discovery of Training Data for Machine Learning CMU authors Deep Learning Recipe

Edge-based Segmentation Transform Hough Edge Tracking Linking Edge Detection Canny Edge