Forbidding Edges between Points in the Plane to Disconnect the Triangulation Flip Graph

06/06/2022
by   Reza Bigdeli, et al.
0

The flip graph for a set P of points in the plane has a vertex for every triangulation of P, and an edge when two triangulations differ by one flip that replaces one triangulation edge by another. The flip graph is known to have some connectivity properties: (1) the flip graph is connected; (2) connectivity still holds when restricted to triangulations containing some constrained edges between the points; (3) for P in general position of size n, the flip graph is ⌈n/2 -2 ⌉-connected, a recent result of Wagner and Welzl (SODA 2020). We introduce the study of connectivity properties of the flip graph when some edges between points are forbidden. An edge e between two points is a flip cut edge if eliminating triangulations containing e results in a disconnected flip graph. More generally, a set X of edges between points of P is a flip cut set if eliminating all triangulations that contain edges of X results in a disconnected flip graph. The flip cut number of P is the minimum size of a flip cut set. We give a characterization of flip cut edges that leads to an O(n log n) time algorithm to test if an edge is a flip cut edge and, with that as preprocessing, an O(n) time algorithm to test if two triangulations are in the same connected component of the flip graph. For a set of n points in convex position (whose flip graph is the 1-skeleton of the associahedron) we prove that the flip cut number is n-3.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/04/2019

Minimum Cut in O(mlog^2 n) Time

We give a randomized algorithm that finds a minimum cut in an undirected...
research
03/30/2020

Connectivity of Triangulation Flip Graphs in the Plane

Given a finite point set P in general position in the plane, a full tria...
research
04/17/2019

A Faster Local Algorithm for Detecting Bounded-Size Cuts with Applications to Higher-Connectivity Problems

Consider the following "local" cut-detection problem in a directed graph...
research
08/19/2019

The Landscape of Minimum Label Cut (Hedge Connectivity) Problem

Minimum Label Cut (or Hedge Connectivity) problem is defined as follows:...
research
11/16/2018

A Spanner for the Day After

We show how to construct (1+ε)-spanner over a set P of n points in R^d t...
research
09/15/2023

On the Asymptotics of Graph Cut Objectives for Experimental Designs of Network A/B Testing

A/B testing is an effective way to assess the potential impacts of two t...
research
11/17/2022

Rounding via Low Dimensional Embeddings

A regular graph G = (V,E) is an (ε,γ) small-set expander if for any set ...

Please sign up or login with your details

Forgot password? Click here to reset