Discrete & Computational Geometry

, Volume 48, Issue 1, pp 142–191

# Multitriangulations, Pseudotriangulations and Primitive Sorting Networks

• Vincent Pilaud
• Michel Pocchiola
Article

## Abstract

We study the set of all pseudoline arrangements with contact points which cover a given support. We define a natural notion of flip between these arrangements and study the graph of these flips. In particular, we provide an enumeration algorithm for arrangements with a given support, based on the properties of certain greedy pseudoline arrangements and on their connection with sorting networks. Both the running time per arrangement and the working space of our algorithm are polynomial.

As the motivation for this work, we provide in this paper a new interpretation of both pseudotriangulations and multitriangulations in terms of pseudoline arrangements on specific supports. This interpretation explains their common properties and leads to a natural definition of multipseudotriangulations, which generalizes both. We study elementary properties of multipseudotriangulations and compare them to iterations of pseudotriangulations.

## Keywords

Pseudoline arrangement Pseudotriangulation Multitriangulation Flip Sorting network Enumeration algorithm

## 1 Introduction

The original motivation for this paper is the interpretation of certain families of planar geometric graphs in terms of pseudoline arrangements. As an introductory illustration, we present this interpretation on the family of triangulations of a convex polygon.

Let P be a finite point set in convex position in the Euclidean plane ℝ2. A triangulation T of P is a maximal crossing-free set of edges on P, or equivalently, a decomposition of the convex hull of P into triangles with vertices in P. See Fig. 1(a). A (strict) bisector of a triangle Δ of T is a line which passes through a vertex of Δ and (strictly) separates its other two vertices. Observe that any triangle has a unique bisector parallel to any direction. Moreover any two triangles of T have a unique common strict bisector, and possibly an additional non-strict bisector if they share an edge.

We now switch to the line space $$\mathcal {M}$$ of the Euclidean plane ℝ2. Remember that $$\mathcal {M}$$ is a Möbius strip homeomorphic to the quotient space ℝ2/(θ,d)∼(θ+π,−d) via the parametrization of an oriented line by its angle θ with the horizontal axis and its algebraic distance d to the origin (see Sect. 3 for details). For pictures, we represent $$\mathcal {M}$$ as a vertical band whose boundaries are identified in opposite directions. The dual of a point pP is the set of all lines of ℝ2 passing through p. It is a pseudoline of $$\mathcal {M}$$, i.e. a non-separating simple closed curve. The dual of P is the set P :={p pP}. It is a pseudoline arrangement of $$\mathcal {M}$$, since any two pseudolines p ,q of P cross precisely once at the line (pq). Call first level of P the boundary of the external face of the complement of P . It corresponds to the supporting lines of the convex hull of P. See Fig. 1(b).

As illustrated on Fig. 1(c), we observe after [32, 33] that:
1. (i)

the set Δ of all bisectors of a triangle Δ of T is a pseudoline of $$\mathcal {M}$$;

2. (ii)

the dual pseudolines $$\Delta_{1}^{*},\Delta_{2}^{*}$$ of any two triangles Δ12 of T have a unique crossing point (the unique common strict bisector of Δ1 and Δ2) and possibly a contact point (when Δ1 and Δ2 share a common edge);

3. (iii)

the set T :={Δ∣Δ triangle of T} is a pseudoline arrangement with contact points; and

4. (iv)

T covers P minus its first level.

We furthermore prove in this paper that this interpretation is bijective: any pseudoline arrangement with contact points supported by P minus its first level is the dual pseudoline arrangement T of a triangulation T of P.

Motivated by this interpretation, we study the set of all pseudoline arrangements with contact points which cover a given support in the Möbius strip. We define a natural notion of flip between them, and study the graph of these flips. In particular, we provide an enumeration algorithm for arrangements with a given support (similar to the enumeration algorithm of [7] for pseudotriangulations), based on certain greedy pseudoline arrangements and their connection with primitive sorting networks [23, Sect. 5.3.4, 10, 24]. The running time per arrangement and the working space of our algorithm are both polynomial.

We are especially interested in the following particular situation. Let L be a pseudoline arrangement and k be a positive integer. We call k-pseudotriangulation of L any pseudoline arrangement with contact points that covers L minus its first k levels. These objects provide dual interpretations for two, until now unrelated, classical generalizations of triangulations of a convex polygon (see Sect. 3 for the definitions and basic properties of these geometric graphs):
Pseudotriangulations (k=1).

Introduced for the study of the visibility complex of a set of disjoint convex obstacles in the plane [34, 35], pseudotriangulations were used in different contexts such as motion planning and rigidity theory [15, 42]. Their combinatorial and geometric structure has been extensively studied in the last decade (number of pseudotriangulations [1, 2], polytope of pseudotriangulations [36], algorithmic issues [5, 7, 16], etc.). See [37] for a detailed survey on the subject. As far as pseudotriangulations are concerned, this paper has two main applications: it proves the dual characterization of pseudotriangulations in terms of pseudoline arrangements and provides an interpretation of greedy pseudotriangulations in terms of sorting networks, leading to a new proof of the greedy flip property for points [3, 7, 34]. The objects studied in this paper have a further (algorithmic) motivation: as a first step to compute the dual arrangement of a set of disjoint convex bodies described only by its chirotope, Habert and Pocchiola raise in [16] the question to compute efficiently a pseudotriangulation of a pseudotriangulation of the set, i.e. a 2-pseudotriangulation.

Multitriangulations (convex position).

Introduced in the context of extremal theory for geometric graphs [9], multitriangulations were then studied for their combinatorial structure [11, 12, 20, 25]. The study of stars in multitriangulations [28], generalizing triangles for triangulations, naturally leads to interpret multitriangulations as multipseudotriangulations of points in convex position. As far as we know, this paper provides the first interpretation of multitriangulations in terms of pseudoline arrangements on the Möbius strip.

The paper is organized as follows. Section 2 is devoted to the study of all pseudoline arrangements with contact points covering a given support. We define the flip and the greedy pseudoline arrangements (2.2) whose properties yield the enumeration algorithm for pseudoline arrangements with a given support (2.3).

In Sect. 3, we prove that the pseudotriangulations of a finite planar point set P in general position correspond to the pseudoline arrangements with contact points supported by the dual pseudoline arrangement of P minus its first level (3.2). Similarly, we observe that multitriangulations of a planar point set P in convex position correspond to pseudoline arrangements with contact points supported by the dual pseudoline arrangement of P minus its first k levels (3.3).

This naturally yields to the definition of multipseudotriangulations in Sect. 4. We study the primal of a multipseudotriangulation. We discuss some of its structural properties (4.2) which generalize the cases of pseudotriangulations and multitriangulations: number of edges, pointedness, crossing-freeness. We study in particular the faces of multipseudotriangulations (4.3) which naturally extend triangles in triangulations, pseudotriangles in pseudotriangulations, and stars in multitriangulations.

In Sect. 5, we compare multipseudotriangulations to iterated pseudotriangulations. We give an example of a 2-triangulation which is not a pseudotriangulation of a triangulation (5.1). We prove, however, that greedy multipseudotriangulations are iterated greedy pseudotriangulations (5.2), and we study flips in iterated pseudotriangulations (5.3).

Section 6 presents two further topics. The first one (6.1) is a pattern avoiding characterization of greedy multipseudotriangulations related to horizon trees. The second one (6.2) is a discussion on multipseudotriangulations of double pseudoline arrangements, which extend pseudotriangulations of convex bodies in the plane.

Finally, we discuss in Sect. 7 some related problems and open questions concerning in particular the primal of a multipseudotriangulation, the diameter and the polytopality of the graph of flips, and the number of multipseudotriangulations. Since the submission of this paper, some of these questions were partially answered in [29, 40, 43] based on a framework similar to the material presented in this paper.

## 2 Pseudoline Arrangements with the Same Support

### 2.1 Pseudoline Arrangements in the Möbius Strip

Let $$\mathcal {M}$$ denote the Möbius strip (without boundary), defined as the quotient set of the plane ℝ2 under the map $$\tau: \mathbb {R}^{2}\to \mathbb {R}^{2},\; (x,y)\mapsto(x+\pi,-y)$$. The induced canonical projection will be denoted by $$\pi:\mathbb {R}^{2}\to \mathcal {M}$$.

A pseudoline is the image λ under the canonical projection π of the graph {(x,f(x))∣x∈ℝ} of a continuous and π-antiperiodic function f:ℝ→ℝ (that is, which satisfies f(x+π)=−f(x) for all x∈ℝ). We say that f represents the pseudoline λ.

When we consider two pseudolines, we always assume that they have a finite number of intersection points. Thus, these intersection points can only be either crossing points or contact points. See Fig. 3(a). Any two pseudolines always have an odd number of crossing points (in particular, at least one). When λ and μ have exactly one crossing point, we denote it by λμ.

A pseudoline arrangement with contact points is a finite set Λ of pseudolines such that any two of them have exactly one crossing point and possibly some contact points. See Fig. 2. In this paper, we are only interested in simple arrangements, that is, where no three pseudolines meet in a common point. The support of Λ is the union of its pseudolines. Observe that Λ is completely determined by its support together with its set of contact points. The first level of Λ is the external hull of the support of Λ, i.e. the boundary of the external face of the complement of the support of Λ. We define inductively the kth level of Λ as the external hull of the support of Λ minus its first k−1 levels.

### Remark 1

The usual definition of pseudoline arrangements does not allow contact points. In this paper, they play a crucial role since we are interested in all pseudoline arrangements which share a common support, and which only differ by their sets of contact points. To simplify the exposition, we omit throughout the paper to specify that we work with pseudoline arrangements with contact points.

Pseudoline arrangements are also classically defined on the projective plane rather than the Möbius strip. The projective plane is obtained from the Möbius strip by adding a point at infinity.

For more details on pseudoline arrangements, we refer to the broad literature on the topic [6, 13, 14, 24].

### 2.2 Flip Graph and Greedy Pseudoline Arrangements

#### 2.2.1 Flips

We use the symbol △ for the symmetric difference: XY:=(XY)∪(YX). We refer to Fig. 3 for an illustration of the following lemma.

### Lemma 2

Let Λ be a pseudoline arrangement$$\mathcal {S}$$ be its support, and V be the set of its contact points. Let vV be a contact point of two pseudolines of Λ, and w denote their unique crossing point. Then V△{v,w} is also the set of contact points of a pseudoline arrangement Λsupported by  $$\mathcal {S}$$.

### Proof

Let f and g represent the two pseudolines λ and μ of Λ in contact at v. Let x and y be such that v=π(x,f(x)), w=π(y,f(y)) and x<y<x+π. We define two functions f′ and g′ by
$$f' :=\begin{cases}f & \text{on } [x,y]+\mathbb {Z}\pi, \\g & \text{otherwise,}\end{cases}\quad\text{and} \quad g' :=\begin{cases}g & \text{on } [x,y]+\mathbb {Z}\pi, \\f & \text{otherwise.}\end{cases}$$
These two functions are continuous and π-antiperiodic, and thus define two pseudolines λ′ and μ′. These two pseudolines have a contact point at w and a unique crossing point at v, and they cross any pseudoline ν of Λ∖{λ,μ} exactly once (since ν either crosses both λ and μ between v and w, or crosses both λ and μ between w and v). Consequently, Λ′:=Λ△{λ,μ,λ′,μ′} is a pseudoline arrangement, with support $$\mathcal {S}$$, and contact points V△{v,w}. □

### Definition 3

Let Λ be a pseudoline arrangement with support $$\mathcal {S}$$ and contact points V, let vV be a contact point between two pseudolines of Λ which cross at w, and let Λ′ be the pseudoline arrangement with support $$\mathcal {S}$$ and contact points V△{v,w}. We say that we obtain Λ′ by flipping v in Λ.

Note that the starting point of a flip is always a contact point. To this contact point corresponds precisely one crossing point. In contrast, it would be incorrect to try to flip a crossing point: the two pseudolines which cross at this point might have zero or many contact points.

Observe also that the pseudoline arrangements Λ and Λ′ are the only two pseudoline arrangements supported by $$\mathcal {S}$$ whose sets of contact points contain V∖{v}.

### Definition 4

Let $$\mathcal {S}$$ be the support of a pseudoline arrangement. The flip graph of $$\mathcal {S}$$, denoted by $$G(\mathcal {S})$$, is the graph whose vertices are all the pseudoline arrangements supported by $$\mathcal {S}$$, and whose edges are flips between them.

In other words, there is an edge in the graph $$G(\mathcal {S})$$ between two pseudoline arrangements if and only if their sets of contact points differ by exactly two points.

Observe that the graph $$G(\mathcal {S})$$ is regular: there is one edge adjacent to a pseudoline arrangement Λ supported by $$\mathcal {S}$$ for each contact point of Λ, and two pseudoline arrangements with the same support have the same number of contact points.

### Example 5

The flip graph of the support of an arrangement of two pseudolines with p contact points is the complete graph on p+1 vertices.

#### 2.2.2 Acyclic Orientations

Let $$\mathcal {S}$$ be the support of a pseudoline arrangement and $$\bar{\mathcal {S}}$$ denote its preimage under the projection π. We orient the graph $$\bar{\mathcal {S}}$$ along the abscissa increasing direction, and the graph $$\mathcal {S}$$ by projecting the orientations of the edges of $$\bar{\mathcal {S}}$$. We denote by ≼ the induced partial order on the vertex set of $$\bar {\mathcal {S}}$$ (defined by zz′ if there exists an oriented path on $$\bar {\mathcal {S}}$$ from z to z′).

A filter of $$\bar{\mathcal {S}}$$ is a proper set F of vertices of $$\bar {\mathcal {S}}$$ such that zF and zz′ implies z′∈F. The corresponding antichain is the set of all edges and faces of $$\bar{\mathcal {S}}$$ with one vertex in F and one vertex not in F. This antichain has a linear structure, and thus, can be seen as the set of edges and faces that cross a vertical curve $$\bar{\chi}$$ of ℝ2. The projection $$\chi :=\pi(\bar{\chi})$$ of such a curve is called a cut of $$\mathcal {S}$$. We see the fundamental domain located between the two curves $$\bar{\chi}$$ and $$\tau(\bar{\chi})$$ as the result of cutting the Möbius strip along the cut χ. For example, we use such a cut to represent pseudoline arrangements in all figures of this paper. See for example Fig. 3.

The cut χ defines a partial order ≼ χ on the vertex set of $$\mathcal {S}$$: for all vertices v and w of $$\mathcal {S}$$, we write v χ w if there is an oriented path in $$\mathcal {S}$$ which does not cross χ. In other words, v χ w if $$\bar{v}\preccurlyeq \bar{w}$$, where $$\bar{v}$$ (resp. $$\bar{w}$$) denotes the unique preimage of v (resp. w) between $$\bar{\chi}$$ and $$\tau(\bar{\chi})$$. For example, in the arrangements of Fig. 3, we have v χ w.

Let Λ be a pseudoline arrangement supported by $$\mathcal {S}$$, v be a contact point between two pseudolines of Λ and w denote their crossing point. Since v and w lie on a same pseudoline on $$\mathcal {S}$$, they are comparable for ≼ χ . We say that the flip of v is χ-increasing if v χ w and χ-decreasing otherwise. For example, the flip from (a) to (b) in Fig. 3 is χ-increasing. We denote by $$G_{\chi}(\mathcal {S})$$ the directed graph of χ-increasing flips on pseudoline arrangements supported by $$\mathcal {S}$$.

### Lemma 6

The directed graph  $$G_{\chi}(\mathcal {S})$$ of χ-increasing flips is acyclic.

### Proof

If Λ and Λ′ are two pseudoline arrangements supported by $$\mathcal {S}$$, we write if there exists a bijection ϕ between their sets of contact points such that v χ ϕ(v) for any contact point v of Λ. It is easy to see that this relation is a partial order on the vertices of $$G_{\chi}(\mathcal {S})$$. Since the edges of $$G_{\chi}(\mathcal {S})$$ are oriented according to , the graph $$G_{\chi}(\mathcal {S})$$ is acyclic. □

Theorem 7 below states that this acyclic graph $$G_{\chi}(\mathcal {S})$$ has in fact a unique source, and thus is connected.

#### 2.2.3 Sorting Networks

Let n denote the number of pseudolines of the arrangements supported by $$\mathcal {S}$$ and $$m\ge{n \choose2}$$ their number of intersection points (crossing points plus contact points). We consider a chain F=F m F m−1⊃…⊃F 1F 0=τ(F) of filters of $$\bar{\mathcal {S}}$$ such that two consecutive of them F i  and F i+1 only differ by a single element: $$\{\bar{v}_{i}\}:=F_{i+1}\smallsetminus F_{i}$$. This corresponds to a (backward) sweep χ=χ 0,χ 1,…,χ m =χ of the Möbius strip, where each cut χ i+1 is obtained from the cut χ i by sweeping a maximal vertex $$v_{i} :=\pi(\bar{v}_{i})$$ of $$\mathcal {S}$$ (for the partial order ≼ χ ). For all i, let $$e_{i}^{1},e_{i}^{2},\dots,e_{i}^{n}$$ denote the sequence of edges of $$\bar{\mathcal {S}}$$ with exactly one vertex in F i , ordered from top to bottom, and let i be the index such that $$\bar{v}_{i}$$ is the common point of edges $$e_{i}^{i^{\square}}$$ and $$e_{i}^{i^{\square}+1}$$ (see Fig. 4).
Let Λ:={λ 1,…,λ n } be a pseudoline arrangement supported by $$\mathcal {S}$$. For all i, we denote by $$\sigma _{i}^{\varLambda }$$ the permutation of {1,…,n} whose jth entry $$\sigma _{i}^{\varLambda }(j)$$ is the index of the pseudoline supporting $$e_{i}^{j}$$, i.e. such that $$\pi(e_{i}^{j})\subset\lambda_{\sigma_{i}^{\varLambda }(j)}$$. Up to reindexing the pseudolines of Λ, we can assume that $$\sigma _{0}^{\varLambda }$$ is the inverted permutation $$\sigma_{0}^{\varLambda }:=[n,n-1,\dots,2,1]$$, and consequently that $$\sigma_{m}^{\varLambda }$$ is the identity permutation. Observe that for all i:
1. (i)

if v i is a contact point of Λ, then $$\sigma_{i}^{\varLambda }=\sigma_{i+1}^{\varLambda }$$;

2. (ii)

otherwise, $$\sigma_{i+1}^{\varLambda }$$ is obtained from $$\sigma _{i}^{\varLambda }$$ by inverting its i th and (i +1)th entries.

The following theorem is illustrated on Fig. 5.

### Theorem 7

The directed graph  $$G_{\chi}(\mathcal {S})$$ has a unique source Γ, characterized by the property that the permutation  $$\sigma_{i+1}^{\varGamma }$$ is obtained from  $$\sigma_{i}^{\varGamma }$$ by sorting its i th and (i +1)th entries, for all i.

### Proof

If Γ satisfies the above property, then it is obviously a source of the directed graph $$G_{\chi}(\mathcal {S})$$: any flip of Γ is χ-increasing since two of its pseudolines cannot touch before they cross.

Assume conversely that Γ is a source of $$G_{\chi}(\mathcal {S})$$. Let $$a:=\sigma_{i}^{\varGamma }(i^{\square})$$ and $$b :=\sigma_{i}^{\varGamma }(i^{\square}+1)$$. We have two possible situations:
1. (i)

If a<b, then the two pseudolines λ a  and λ b of Γ already cross before v i . Consequently, v i is necessarily a contact point of Γ, which implies that $$\sigma _{i+1}^{\varGamma }(i^{\square})=a$$ and $$\sigma_{i+1}^{\varGamma }(i^{\square}+1)=b$$.

2. (ii)

If a>b, then the two pseudolines λ a  and λ b of Γ do not cross before v i . Since Γ is a source of $$G_{\chi}(\mathcal {S})$$, v i  is necessarily a crossing point of Γ. Thus $$\sigma_{i+1}^{\varGamma }(i^{\square})=b$$ and $$\sigma_{i+1}^{\varGamma }(i^{\square}+1)=a$$.

In both cases, $$\sigma_{i+1}^{\varGamma }$$ is obtained from $$\sigma_{i}^{\varGamma }$$ by sorting its i th and (i +1)th entries. □

### Corollary 8

The graphs of flips  $$G(\mathcal {S})$$ and  $$G_{\chi}(\mathcal {S})$$ are connected.

### Definition 9

The unique source of the directed graph $$G_{\chi}(\mathcal {S})$$ is denoted by $$\varGamma _{\chi}(\mathcal {S})$$ and called the χ-greedy pseudoline arrangement on $$\mathcal {S}$$.

Let us reformulate Theorem 7 in terms of sorting networks (see [23, Sect. 5.3.4] for a detailed presentation; see also [10]). Let i<j be two integers. A comparator [i:j] transforms a sequence of numbers (a 1,…,a n ) by sorting (a i ,a j ), i.e. replacing a i by min(a i ,a j ) and a j by max(a i ,a j ). A comparator [i:j] is primitive if j=i+1. A sorting network is a sequence of comparators that sorts any sequence (a 1,…,a n ).

The support $$\mathcal {S}$$ of an arrangement of n pseudolines together with an arbitrary sweep F m ⊃⋯⊃F 0 corresponds to the primitive sorting network [1:1+1],…,[m :m +1] (see [24, Sect. 8]). Theorem 7 affirms that sorting the permutation [n,n−1,…,2,1] according to this sorting network provides a pseudoline arrangement supported by $$\mathcal {S}$$, which depends only upon the support $$\mathcal {S}$$ and the filter F 0 (not on the total order given by the sweep).

#### 2.2.4 Greedy Set of Contact Points

The following proposition provides an alternative construction of the greedy pseudoline arrangement $$\varGamma _{\chi}(\mathcal {S})$$ of the support $$\mathcal {S}$$.

### Proposition 10

Let v 1,…,v q be a sequence of vertices of  $$\mathcal {S}$$ constructed recursively by choosing, as long as possible, a remaining vertex v i of  $$\mathcal {S}$$ minimal (for the partial order  χ ) such that {v 1,…,v i } is a subset of the set of contact points of a pseudoline arrangement supported by  $$\mathcal {S}$$. Then the resulting set {v 1,…,v q } is exactly the set of contact points of  $$\varGamma _{\chi}(\mathcal {S})$$.

### Proof

First of all, {v 1,…,v q } is by construction the set of contact points of a pseudoline arrangement Λ supported by $$\mathcal {S}$$. If Λ is not the (unique) source $$\varGamma _{\chi}(\mathcal {S})$$ of the oriented graph $$G_{\chi}(\mathcal {S})$$, then there is a contact point v i of Λ whose flip is χ-decreasing. Let w denote the corresponding crossing point, and Λ′ the pseudoline arrangement obtained from Λ by flipping v i . This implies that {v 1,…,v i−1,w} is a subset of the set of contact points of Λ′ and that w χ v i , which contradicts the minimality of v i . □

Essentially, this proposition affirms that we obtain the same pseudoline arrangement when:
1. (i)

sweeping $$\mathcal {S}$$ decreasingly and place crossing points as long as possible; or

2. (ii)

sweeping $$\mathcal {S}$$ increasingly and place contact points as long as possible.

#### 2.2.5 Constrained Flip Graph

We now need to extend the previous results to constrained pseudoline arrangements on $$\mathcal {S}$$, in which we force a set V of vertices of $$\mathcal {S}$$ to be contact points.

### Theorem 11

Let V be a subset of vertices of the support  $$\mathcal {S}$$, and let $$G_{\chi}(\mathcal {S}\,|\,V)$$ be the subgraph of  $$G_{\chi}(\mathcal {S})$$ induced by the pseudoline arrangements with support  $$\mathcal {S}$$, whose set of contact points contains V. Then this directed graph  $$G_{\chi}(\mathcal {S}\,|\,V)$$ is either empty or an acyclic connected graph with a unique source Γ characterized by the property that for all i:
1. (i)

if v i V, then  $$\sigma_{i+1}^{\varGamma }=\sigma_{i}^{\varGamma }$$;

2. (ii)

if v i V, then  $$\sigma_{i+1}^{\varGamma }$$ is obtained from  $$\sigma_{i}^{\varGamma }$$ by sorting its i th and (i +1)th entries.

### Proof

We transform our support $$\mathcal {S}$$ into another one $$\mathcal {S}'$$ by opening all intersection points of V (the local picture of this transformation is ). If $$\mathcal {S}'$$ supports at least one pseudoline arrangement, we apply the result of Theorem 7: a pseudoline arrangement supported by $$\mathcal {S}'$$ corresponds to a pseudoline arrangement with support $$\mathcal {S}$$ whose set of contact points contains V. □

We denote by $$\varGamma _{\chi}(\mathcal {S}\,|\,V)$$ the unique source of the constrained flip graph $$G_{\chi}(\mathcal {S}\,|\,V)$$.

In terms of sorting networks, $$\varGamma _{\chi}(\mathcal {S}\,|\,V)$$ is the result of the sorting of the inverted permutation [n,n−1,…,2,1] by the restricted primitive network ([i :i +1]) iI , where I:={iv i V}.

Observe also that we can obtain, like in the previous subsection, the contact points of $$\varGamma _{\chi}(\mathcal {S}\,|\, V)$$ by an iterative procedure: we start from the set V and add recursively a minimal (for the partial order ≼ χ ) remaining vertex v i of $$\mathcal {S}$$ such that V∪{v 1,…,v i } is a subset of the set of contact points of a pseudoline arrangement supported by $$\mathcal {S}$$. The vertex set produced by this procedure is the set of contact points of the χ-greedy constrained pseudoline arrangement $$\varGamma _{\chi}(\mathcal {S}\,|\, V)$$.

### 2.3 Greedy Flip Property and Enumeration

#### 2.3.1 Greedy Flip Property

We are now ready to state the greedy flip property (see Fig. 6) that says how to update the greedy pseudoline arrangement $$\varGamma _{\chi}(\mathcal {S}\,|\,V)$$ when either χ or V are slightly perturbed.

### Theorem 12

(Greedy flip property)

Let  $$\mathcal {S}$$ be the support of a pseudoline arrangement. Let χ be a cut of  $$\mathcal {S}$$, v be a minimal (for the order  χ ) vertex of  $$\mathcal {S}$$, and ψ denote the cut obtained from χ by sweeping v. Let V be a set of vertices of  $$\mathcal {S}$$ (such that  $$G(\mathcal {S}\,|\,V)$$ is not empty), and W:=V∪{v}. Then:
1. (1)

If v is a contact point of  $$\varGamma _{\chi}(\mathcal {S}\,|\,V)$$ which is not in V, then $$\varGamma _{\psi}(\mathcal {S}\,|\,V)$$ is obtained from $$\varGamma _{\chi}(\mathcal {S}\,|\,V)$$ by flipping v. Otherwise, $$\varGamma _{\psi}(\mathcal {S}\,|\,V)=\varGamma _{\chi}(\mathcal {S}\,|\,V)$$.

2. (2)

If v is a contact point of  $$\varGamma _{\chi}(\mathcal {S}\,|\,V)$$, then  $$\varGamma _{\psi}(\mathcal {S}\,|\,W)=\varGamma _{\chi}(\mathcal {S}\,|\,V)$$. Otherwise$$G(\mathcal {S}\,|\,W)$$ is empty.

### Proof

We consider a sweep
$$F_{m+1}=F\supset F_m=F'\supset F_{m-1}\supset\cdots\supset F_2\supset F_1=\tau(F)\supset F_0=\tau(F')$$
such that F (resp. F′) is a filter corresponding to the cut χ (resp. ψ). Define the points $${\bar{v}_{i} :=F_{i+1}\smallsetminus F_{i}}$$ and $${v_{i} :=\pi(\bar{v}_{i})}$$, and the index i as previously. Let σ 1,…,σ m+1 denote the sequence of permutations corresponding to $$\varGamma _{\chi}(\mathcal {S}\,|\, V)$$ on the sweep F 1⊂…⊂F m+1. In other words:
1. (i)

σ 1 is the inverted permutation [n,n−1,…,2,1];

2. (ii)

if v i V, then σ i+1=σ i ;

3. (iii)

otherwise, σ i+1 is obtained from σ i by sorting its i th and (i +1)th entries.

Similarly, let ρ 0,…,ρ m and ω 0,…,ω m denote the sequences of permutations corresponding to $$\varGamma _{\psi}(\mathcal {S}\,|\ V)$$ and $$\varGamma _{\psi}(\mathcal {S}\,|\ W)$$, respectively, on the sweep F 0⊂⋯⊂F m .
Assume first that v is a contact point of $$\varGamma _{\chi}(\mathcal {S}\,|\, V)$$, but is not in V. Let j denote the integer such that v j is the crossing point of the two pseudolines of $$\varGamma _{\chi}(\mathcal {S}\,|\, V)$$ that are in contact at v. We claim that in this case $$\varGamma _{\psi}(\mathcal {S}\,|\, V)$$ is obtained from $$\varGamma _{\chi}(\mathcal {S}\,|\, V)$$ by flipping v, i.e. that:
1. (i)

for all 1≤ij, ρ i is obtained from σ i by exchanging m and m +1;

2. (ii)

for all j<imρ i =σ i .

Indeed, ρ 1 is obtained by exchanging m and m +1 in the sequence ρ 0=[n,n−1,…,2,1]=σ 1 (since m and m +1 are, respectively, the (0+1)th and 0th entries of ρ 0). Then any comparison between two consecutive entries give the same result in ρ i and in σ i , until m and m +1 are compared again, i.e. until i=j. At this stage, m  and m +1 are already sorted in ρ j but not in σ j . Consequently, we have to exchange m  and m +1 in σ j and not in ρ j , and we obtain σ j+1=ρ j+1. After this, all the comparisons give the same result in ρ i  and σ i , and ρ i =σ i for all j<im.
We prove similarly that:
• When v is not a crossing point of $$\varGamma _{\chi}(\mathcal {S}\,|\, V)$$, or is in V, ρ i =σ i  for all i∈[m], and $$\varGamma _{\psi}(\mathcal {S}\,|\, V)=\varGamma _{\chi}(\mathcal {S}\,|\, V)$$.

• When v is a contact point of $$\varGamma _{\chi}(\mathcal {S}\,|\, V)$$, ω i =σ i  for all i∈[m], and $$\varGamma _{\psi}(\mathcal {S}\,|\, W)= \varGamma _{\chi}(\mathcal {S}\,|\, V)$$.

Finally, we prove that $$G(\mathcal {S}\,|\, W)$$ is empty when v is not a contact point of $$\varGamma _{\chi}(\mathcal {S}\,|\, V)$$. For this, assume that $$G(\mathcal {S}\,|\, W)$$ is not empty, and consider the greedy arrangement $${\varGamma =\varGamma _{\chi}(\mathcal {S}\,|\, W)}$$. The flip of any contact point of Γ not in W is χ-increasing. Furthermore, since v is a minimal element for ≼ χ , the flip of v is also χ-increasing. Consequently, Γ is a source in the graph $$G_{\chi}(\mathcal {S}\,|\, V)$$, which implies that $$\varGamma _{\chi}(\mathcal {S}\,|\, V)=\varGamma$$, and thus, v is a contact point of $$\varGamma _{\chi}(\mathcal {S}\,|\, V)$$. □

#### 2.3.2 Enumeration

From the greedy flip property, we derive a binary tree structure on colored pseudoline arrangements supported by $$\mathcal {S}$$, whose left-pending leaves are precisely the pseudoline arrangements supported by $$\mathcal {S}$$. A pseudoline arrangement is colored if its contact points are colored in blue, green or red. Green and red contact points are considered to be fixed, while blue ones can be flipped.

### Theorem 13

Let  $$\mathcal {T}$$ be the binary tree on colored pseudoline arrangements supported by  $$\mathcal {S}$$ defined as follows:
1. (i)

The root of the tree is the χ-greedy pseudoline arrangement on  $$\mathcal {S}$$, entirely colored in blue.

2. (ii)

Any node Λ of  $$\mathcal {T}$$ is a leaf of  $$\mathcal {T}$$ if either it contains a green contact point or it only contains red contact points.

3. (iii)

Otherwise, choose a minimal blue point v of Λ. The right child of Λ is obtained by flipping v and coloring it in blue if the flip is χ-increasing and in green if the flip is χ-decreasing. The left child of Λ is obtained by changing the color of v into red.

Then the set of pseudoline arrangements supported by  $$\mathcal {S}$$ is exactly the set of red-colored leafs of  $$\mathcal {T}$$.

### Proof

The proof is similar to that of Theorem 9 in [7].

We define inductively a cut χ(Λ) for each node Λ of $$\mathcal {T}$$: the cut of the root is χ, and for each node Λ the cut of its children is obtained from χ by sweeping the contact point v. We also denote V(Λ) the set of red contact points of Λ. With these notations, the greedy flip property (Theorem 12) ensures that $$\varLambda =\varGamma _{\chi(\varLambda )}(\mathcal {S}\,|\,V(\varLambda ))$$, for each node Λ of $$\mathcal {T}$$.

The fact that any red-colored leaf of $$\mathcal {T}$$ is a pseudoline arrangement supported by $$\mathcal {S}$$ is obvious. Reciprocally, let us prove that any pseudoline arrangement supported by $$\mathcal {S}$$ is a red leaf of $$\mathcal {T}$$. Let Λ be a pseudoline arrangement supported by $$\mathcal {S}$$. We define inductively a path Λ 0,…,Λ p in the tree $$\mathcal {T}$$ as follows: Λ 0 is the root of $$\mathcal {T}$$ and for all i≥0, Λ i+1 is the left child of Λ i if the minimal blue contact point of Λ i is a contact point of Λ, and its right child otherwise (we stop when we reach a leaf). We claim that for all 0≤ip:
• the set V(Λ i ) is a subset of contact points of Λ;

• the contact points of Λ not in V(Λ i ) are not located between χ(Λ) and χ;

from which we derive that Λ=Λ p is a red-colored leaf. □

Visiting the tree $$\mathcal {T}$$ provides an algorithm to enumerate all pseudoline arrangements with a given support. In the next section, we will see the connection between this algorithm and the enumeration algorithm of [7] for pseudotriangulations of a point set.

Let us briefly discuss the complexity of this algorithm. We assume that the input of the algorithm is a pseudoline arrangement and we consider a flip as an elementary operation. Then this algorithm requires a polynomial running time per pseudoline arrangement supported by $$\mathcal {S}$$. As for many enumeration algorithms, the crucial point of this algorithm is that its working space is also polynomial (while the number of pseudoline arrangements supported by $$\mathcal {S}$$ is exponential).

## 3 Dual Pseudoline Arrangements

In this section, we prove that both the graph of flips on “(pointed) pseudotriangulations of a point set” and the graph of flips on “multitriangulations of a convex polygon” can be interpreted as graphs of flips on “pseudoline arrangements with a given support”. This interpretation is based on the classical duality that we briefly recall in the first subsection, and leads to a natural definition of “multipseudotriangulations of a pseudoline arrangement” that we present in Sect. 4.

### 3.1 Dual Pseudoline Arrangement of a Point Set

To a given oriented line in the Euclidean plane, we associate its angle θ∈ℝ/2πℤ with the horizontal axis and its algebraic distance d∈ℝ to the origin (i.e. the value of 〈(−v,u)∣.〉 on the line, where (u,v) is its unitary direction vector). Since the same line oriented in the other direction gives an angle θ+π and a distance −d, this parametrization naturally associates a point of the Möbius strip $${\mathcal {M}:=\mathbb {R}^{2}/(\theta,d) \sim(\theta+\pi ,-d)}$$ to each line of the Euclidean plane. In other words, the line space of the Euclidean plane is (isomorphic to) the Möbius strip.

Via this parametrization, the set of lines passing through a point p forms a pseudoline p . The pseudolines p  and q dual to two distinct points p and q have a unique crossing point, namely the line (pq). Thus, for a finite point set P in the Euclidean plane, the set P :={p pP} is a pseudoline arrangement without contact points (see Fig. 7). Again, we always assume that the point set P is in general position (no three points lie in a same line), so that the arrangement P is simple (no three pseudolines pass through the same point).

This elementary duality also holds for any topological plane (or ℝ2-plane, see [39] for a definition), not only for the Euclidean plane ℝ2. That is to say, the line space of a topological plane is (isomorphic to) the Möbius strip and the dual of a finite set of points in a topological plane is a pseudoline arrangement without contact points. Let us also recall that any pseudoline arrangement of the Möbius strip without contact points is the dual arrangement of a finite set of points in a certain topological plane [17]. Thus, in the rest of this paper, we deal with sets of points and their duals without restriction to the Euclidean plane.

### 3.2 Dual Pseudoline Arrangement of a Pseudotriangulation

We refer to [37] for a detailed survey on pseudotriangulations, and just recall here some basic definitions.

### Definition 14

A pseudotriangle is a polygon Δ with only three convex vertices (the corners of Δ), joined by three concave polygonal chains (Fig. 8). A line is said to be tangent to Δ if:
1. (i)

either it passes through a corner of Δ and separates the two edges incident to it;

2. (ii)

or it passes through a concave vertex of Δ and does not separate the two edges incident to it.

A pseudotriangulation of a point set P in general position is a set of edges of P which decomposes the convex hull of P into pseudotriangles. We moreover always assume that pseudotriangulations are pointed, meaning that there exists a line passing through any point pP and defining a half-plane containing all the edges incident to p.

The results of this paper only concern pointed pseudotriangulations. Therefore we omit to always specify that pseudotriangulations are pointed. Historically, pseudotriangulations were introduced for families of smooth convex bodies [35] and were therefore automatically pointed. Pseudotriangulations of points, pointed or not, can be regarded as limits of pseudotriangulations of infinitesimally small convex bodies. Note that pointed pseudotriangulations are edge-minimal pseudotriangulations.

Under the pointedness assumption, any two pseudotriangles of a pseudotriangulation have a unique common tangent. This leads to the following observation (see Fig. 9):

### Observation 15

[32, 33]

Let T be a pseudotriangulation of a point set P in general position. Then:
1. (i)

the set Δ of all tangents to a pseudotriangle Δ of T is a pseudoline;

2. (ii)

the dual pseudolines $$\Delta_{1}^{*}, \Delta_{2}^{*}$$ of any two pseudotriangles Δ12 of T have a unique crossing point (the unique common tangent to Δ1 and Δ2) and possibly a contact point (when Δ1 and Δ2 share a common edge);

3. (iii)

the set T :={Δ∣Δ pseudotriangle of T} is a pseudoline arrangement (with contact points); and

4. (iv)

T is supported by P minus its first level (see Fig. 9(b)).

In fact, this covering property characterizes pseudotriangulations:

### Theorem 16

Let P be a finite point set in general position in the plane, and P ∗1 denote the support of its dual pseudoline arrangement minus its first level. Then:
1. (i)

The dual arrangement T :={Δ∣Δ pseudotriangle of T} of a pseudotriangulation T of P is supported by P ∗1.

2. (ii)
The primal set of edges
$$E :=\bigl \{[p,q] \,\big |\,p,q\in P,\; p^*\wedge q^* \text{ contact\ point\ of\ } \varLambda \bigr \}$$
of a pseudoline arrangement Λ supported by P ∗1 is a pseudotriangulation of P.

In this section, we provide three proofs of part (ii) of this result. The first proof is based on flips. First, remember that there is also a simple flip operation on pseudotriangulations of P: replacing any internal edge e in a pseudotriangulation of P by the common tangent of the two pseudotriangles containing e produces a new pseudotriangulation of P. For example, Fig. 10 shows two pseudotriangulations of the point set of Fig. 7(a), related by a flip, together with their dual pseudoline arrangements. We denote by G(P) the graph of flips on pseudotriangulations of P, whose vertices are pseudotriangulations of P and whose edges are flips between them. In other words, there is an edge in G(P) between two pseudotriangulations of P if and only if their symmetric difference is reduced to a pair.

### Proof 1 of Theorem 16(ii)

The two notions of flips (the primal notion on pseudotriangulations of P and the dual notion on pseudoline arrangements supported by P ∗1) coincide via duality: an internal edge e of a pseudotriangulation T of P corresponds to a contact point e of the dual pseudoline arrangement T ; the two pseudotriangles Δ1 and Δ2 of T containing e correspond to the two pseudolines $$\Delta_{1}^{*}$$ and $$\Delta_{2}^{*}$$ of T in contact at e ; and the common tangent f of Δ1 and Δ2 corresponds to the crossing point f of $$\Delta_{1}^{*}$$ and $$\Delta_{2}^{*}$$.

Thus, the graph G(P) is a subgraph of $$G(\mathcal {S})$$. Since both are connected and regular of degree |P|−3, they coincide. In particular, any pseudoline arrangement supported by P ∗1 is the dual of a pseudotriangulation of P. □

### Remark 17

Observe that this duality matches our greedy pseudoline arrangement supported by P ∗1 with the greedy pseudotriangulation of [7]. In particular, the greedy flip property and the enumeration algorithm of Sect. 2.3 are generalizations of results in [7].

Our second proof of Theorem 16 is slightly longer but more direct, and it introduces a “witness method” that we will repeatedly use throughout this paper. It is based on the following characterization of pseudotriangulations:

### Lemma 18

[42]

A graph T on P is a pointed pseudotriangulation of P if and only if it is crossing-free, pointed and has 2|P|−3 edges.

### Proof 2 of Theorem 16(ii)

We check that E is crossing-free, pointed and has 2|P|−3 edges:

Cardinality. First, the number of edges of E equals the difference between the number of crossing points of P and of Λ:
$$|E|={|P^*| \choose2}-{| \varLambda | \choose2}={|P| \choose 2}-{|P|-2 \choose2}=2|P|-3.$$
Crossing-free. Let p,q,r,s be four points of P in convex position. Let t be the intersection of [p,r] and [q,s] (see Fig. 11(a)). We use the pseudoline t as a witness to prove that [p,r] and [q,s] cannot both be in E. For this, we count crossings of t with P and Λ, respectively:
1. (i)

Since P is in general position, the point t is not in P. Therefore P ∪{t }=(P∪{t}) is a (non-simple) pseudoline arrangement, and t crosses P exactly |P| times.

2. (ii)

Since t is a pseudoline, it crosses each pseudoline of Λ at least once. Thus, it crosses Λ at least |Λ|=|P|−2 times.

3. (iii)

For each of the points p r  and q s , replacing the crossing point by a contact point removes two crossings with t .

Thus, [p,r] and [q,s] cannot both be in E, and E is crossing-free.
Pointed. Let p,q,r,s be four points of P such that s lies inside the convex hull of {p,q,r}. We first construct a witness pseudoline (see Fig. 11(b)) that we use to prove that [p,s], [q,s] and [r,s] cannot all be in E. Let f p ,f q ,f r  and f s represent p ,q ,r  and s , respectively. Let x,y,z∈ℝ be such that f p (x)=f s (x), f q (y)=f s (y) and f r (z)=f s (z). Let g be a continuous and π-antiperiodic function vanishing exactly on {x,y,z}+ℤπ and changing sign each time it vanishes; say for example g(t):=sin(tx)sin(ty)sin(tz). For all ε>0, we define the function h ε :ℝ→ℝ by h ε (t)=f s (t)+εg(t). The function h ε is continuous and π-antiperiodic. The corresponding pseudoline  ε crosses s three times. It is also easy to see that if ε is sufficiently small, then  ε crosses the pseudolines of (P∖{s}) exactly as s does (see Fig. 11(b)). For such a small ε, we count the crossings of  ε with P  and Λ, respectively:
1. (i)

ε  crosses P exactly |P|+2 times (it crosses s three times and any other pseudoline of P exactly once).

2. (ii)

Since  ε is a pseudoline, it crosses Λ at least |Λ|=|P|−2 times.

3. (iii)

For each of the points p s , q s  and r s , replacing the crossing point by a contact point removes two crossings with  ε .

Thus, [p,r], [q,s] and [r,s] cannot all be in E, and E is pointed. □

Observe that once we know that E is crossing-free, we could also argue its pointedness observing that the pseudolines of Λ would cover the dual pseudoline of a non-pointed vertex twice.

Our third proof of Theorem 16 focusses on pseudotriangles. For every pseudoline λ of the pseudoline arrangement Λ, we denote by
$${S(\lambda) :=\bigl \{[p,q] \,\big |\,p,q\in P, p^*\wedge q^*\text{ contact\ point\ of\ }\lambda\bigr \}}$$
the polygonal cycle formed by the edges primal to the contact points of λ. For any point q in the plane, we denote by σ λ (q) the winding number of S(λ) around q, i.e. the number of rounds made by S(λ) around the point q.

### Proof 3 of Theorem 16(ii)

Consider a point q inside the convex hull of our point set P, and such that P∪{q} be in general position. Hence, its dual pseudoline q has exactly |P| crossings with P , none of which are on the first level of P . For any pseudoline λΛ, let τ λ (q) denote the number of intersection points between q and λ (that is, the number of tangents to S(λ) passing through q). Then we have σ λ (q)=(τ λ (q)−1)/2 and
Consequently, ∑ λΛ σ λ (q)=1. Hence σ λ (q)=0 for all λΛ, except for precisely one pseudoline μΛ which satisfies σ μ (q)=1.

As a consequence, all polygons S(λ) for λΛ are pseudotriangles (otherwise, we would have points such that σ λ (q)>1 for some λ) and they cover the convex hull of P. Consequently, these |P|−2 pseudotriangles form a pointed pseudotriangulation of P. □

### 3.3 Dual Pseudoline Arrangement of a Multitriangulation

Let C n denote the set of vertices of the convex regular n-gon. We are interested in the following generalization of triangulations, introduced by Capoyleas and Pach [9] in the context of extremal theory for geometric graphs (see Fig. 12).

### Definition 19

For ∈ℕ, an ℓ-crossing is a set of mutually crossing edges of C n . A k-triangulation of the n-gon is a maximal set of edges of C n with no (k+1)-crossing.

Observe that an edge of C n can be involved in a (k+1)-crossing only if there remain at least k vertices on each side. Such an edge is called k-relevant. An edge with exactly (resp. strictly less than) k−1 vertices on one side is a k-boundary edge (resp. a k-irrelevant edge). By maximality, every k-triangulation consists of all the nk k-irrelevant plus k-boundary edges and some k-relevant edges.

In [28], the triangles and their bisectors are generalized for k-triangulations as follows (see Fig. 13):

### Definition 20

[28]

A k-star is a star polygon of type {2k+1/k}, that is, a set of edges of the form {s j s j+k j∈ℤ2k+1}, where s 0,s 1,…,s 2k are cyclically ordered around the unit circle. A (strict) bisector of a k-star is a (strict) bisector of one of its angles s jk s j s j+k .

As for k=1, where triangles provide a powerful tool to study triangulations, k-stars are useful to understand k-triangulations. In the following theorem, we point out five properties of stars proved in [28]. Figures 13 and 14 illustrate these results on the 2-triangulation of Fig. 12.

### Theorem 21

[28]

Let T be a k-triangulation of the n-gon. Then
1. (i)

T contains exactly n−2k k-stars and k(n−2k−1) k-relevant edges.

2. (ii)

Each edge of T belongs to zero, one, or two k-stars, depending on whether it is k-irrelevant, k-boundary, or k-relevant.

3. (iii)

Every pair of k-stars of T has a unique common strict bisector.

4. (iv)

Flipping any k-relevant edge e of T into the common strict bisector f of the two k-stars containing e produces a new k-triangulation T△{e,f} of the n-gon. T and T△{e,f} are the only two k-triangulations of the n-gon containing T∖{e}.

5. (v)

The flip graph G n,k on k-triangulations of the n-gon is connected and regular of degree k(n−2k−1).

Similarly to Observation 15, we can interpret these properties of the stars of the multitriangulations in the dual space (see Fig. 15):

### Observation 22

Let T be a k-triangulation of a convex n-gon. Then:
1. (i)

the set S of all bisectors of a k-star S of T is a pseudoline of the Möbius strip;

2. (ii)

the dual pseudolines $$S_{1}^{*}, S_{2}^{*}$$ of any two k-stars S 12 of T have a unique crossing point (the unique common strict bisector of S 1 and S 2) and possibly some contact points (when S 1 and S 2 share common edges);

3. (iii)

the set $$T^{*} :=\{S^{*} \mid S\;k\text{-star of } T\}$$ of dual pseudolines of k-stars of T is a pseudoline arrangement (with contact points); and

4. (iv)

T is supported by the dual pseudoline arrangement $$C_{n}^{*}$$ of C n minus its first k levels (see Fig. 15(b)).

Again, it turns out that this observation provides a characterization of multitriangulations of a convex polygon:

### Theorem 23

Let C n denote the set of vertices of a convex n-gon, and  $$C_{n}^{*k}$$ denote the support of its dual pseudoline arrangement minus its first k levels. Then:
1. (i)

The dual pseudoline arrangement  $$T^{*} :=\{S^{*} \mid S\;k\text {-star of }T\}$$ of a k-triangulation T of the n-gon is supported by  $$C_{n}^{*k}$$.

2. (ii)
The primal set of edges
$$E :=\bigl \{[p,q] \,\big |\,p,q\in C_n,\; p^*\wedge q^*\text{ contact point of } \varLambda \bigr \}$$
of a pseudoline arrangement Λ supported by  $$C_{n}^{*k}$$ is a k-triangulation of the n-gon.

We provide two proofs of this theorem.

### Proof 1 of Theorem 23(ii)

The two notions of flips (the primal notion on k-triangulations of the n-gon and the dual notion on pseudoline arrangements supported by $$C_{n}^{*k}$$) coincide. Thus, the flip graph G n,k on k-triangulations of the n-gon is a subgraph of $$G(C_{n}^{*k})$$. Since they are both connected and regular of degree k(n−2k−1), these two graphs coincide. In particular, any pseudoline arrangement supported by $$C_{n}^{*k}$$ is the dual of a k-triangulation of the n-gon. □

### Proof 2 of Theorem 23(ii)

We follow the method of our second proof of Theorem 16(ii). Since E has the right number of edges (namely k(2n−2k−1)), we only have to prove that it is (k+1)-crossing-free. We consider 2k+2 points p 0,…,p k ,q 0,…,q k cyclically ordered around the unit circle. Since the definition of crossing (and thus, of -crossing) is purely combinatorial, i.e. depends only on the cyclic order of the points and not on their exact positions, we can move all the vertices of our n-gon on the unit circle while preserving their cyclic order. In particular, we can assume that the lines (p i q i ) i∈{0,…,k} all contain a common point t. Its dual pseudoline t crosses $$C_{n}^{*}$$ exactly n times and Λ at least |Λ|=n−2k times. Furthermore, for any point $${p_{i}^{*}\wedge q_{i}^{*}}$$, replacing the crossing point by a contact point removes two crossings with t . Thus, the pseudoline t provides a witness which proves that the edges [p i ,q i ], i∈{0,…,k}, cannot be all in E, and thus ensures that E is (k+1)-crossing-free. □

## 4 Multipseudotriangulations

Motivated by Theorems 16 and 23, we define in terms of pseudoline arrangements a natural generalization of both pseudotriangulations and multitriangulations. We then study elementary properties of the corresponding set of edges in the primal space.

### 4.1 Definition

We consider the following generalizations of both pseudotriangulations and multitriangulations:

### Definition 24

Let L be a pseudoline arrangement supported by $$\mathcal {S}$$. Define its k-kernel $$\mathcal {S}^{k}$$ to be its support minus its first k levels (which are the iterated external hulls of $$\mathcal {S}$$). Denote by V k the set of contact points of L in $$\mathcal {S}^{k}$$. A k-pseudotriangulation of L is a pseudoline arrangement whose support is $$\mathcal {S}^{k}$$ and whose set of contact points contains V k .

Pseudotriangulations of a point set P correspond via duality to 1-pseudotriangulations of the dual pseudoline arrangement P . Similarly, k-triangulations of the n-gon correspond to k-pseudotriangulations of the pseudoline arrangement $$C_{n}^{*}$$ in convex position. If L is a pseudoline arrangement with no contact point, then any pseudoline arrangement supported by $$\mathcal {S}^{k}$$ is a k-pseudotriangulation of L. In general, the condition that the contact points of L in its k-kernel should be contact points of any k-pseudotriangulation of L is a natural assumption for iterating multipseudotriangulations (see Sect. 5).

Let Λ be a k-pseudotriangulation of L. We denote by V(Λ) the union of the set of contact points of Λ with the set of intersection points of the first k levels of L. In other words, V(Λ) is the set of intersection points of L which are not crossing points of Λ. As for pseudoline arrangements, the set V(Λ) completely determines Λ.

Flips for multipseudotriangulations are defined as in Lemma 2, with the restriction that the contact points in V k cannot be flipped. In other words, the flip graph on k-pseudotriangulations of L is exactly the graph $$G(\mathcal {S}^{k}\,|\, V^{k})$$. Section 2 asserts that the graph of flips is regular and connected, and provides an enumeration algorithm for multipseudotriangulations of L.

Let χ be a cut of (the support of) L. It is also a cut of the k-kernel $$\mathcal {S}^{k}$$ of L. A particularly interesting example of k-pseudotriangulation of L is the source of the graph of χ-increasing flips on k-pseudotriangulations of L (see Fig. 16 for an illustration):

### Definition 25

The χ-greedy k-pseudotriangulation of L, denoted $$\varGamma _{\chi}^{k}(L)$$, is the greedy pseudoline arrangement $$\varGamma _{\chi}(\mathcal {S}^{k}\,|\, V^{k})$$.

### 4.2 Pointedness and Crossings

Let P be a point set in general position. Let Λ be a k-pseudotriangulation of P and V(Λ) be the set of crossing points of P which are not crossing points of Λ. We call primal of Λ the set
$$E :=\bigl \{[p,q] \,\big |\,p,q\in P,\; p^*\wedge q^*\in V(\varLambda )\bigr \}$$
of edges of P primal to V(Λ) (see Fig. 17). Here, we discuss general properties of primals of multipseudotriangulations. We start with elementary properties that we already observed for the special cases of pseudotriangulations and multitriangulations in the proofs of Theorems 16 and 23:

### Lemma 26

The primal E of Λ has k(2|P|−2k−1) edges.

### Proof

The number of edges of E is the difference between the number of crossing points in the pseudoline arrangements P and Λ:
$$|E|={|P^*| \choose2}-{|\varLambda | \choose2}={|P| \choose 2}-{|P|-2k \choose2}=k(2|P|-2k-1).$$
□
We now discuss pointedness of E. We call k-alternation any set {f i i∈ℤ2k+1} of 2k+1 edges all incident to a common vertex and whose cyclic order around it is given by
$$f_0\prec \bar{f}_{1+k} \prec f_1 \prec \bar{f}_{2+k} \prec \cdots \prec f_{2k} \prec \bar{f}_k \prec f_0,$$
where $$\bar{f}_{i}$$ denotes the opposite direction of the edge f i .

### Lemma 27

The primal E of Λ cannot contain a k-alternation.

### Proof

We simply mimic the proof of pointedness in Theorem 16. Let p 0,…,p 2k and q be 2k+2 points of P such that F:={[p i ,q]∣i∈ℤ2k+1} is a k-alternation. We prove that F cannot be a subset of E by constructing a witness pseudoline  that separates all the crossing points $${p_{i}^{*}\wedge q^{*}}$$ corresponding to F, while crossing q exactly 2k+1 times and the other pseudolines of P exactly as q does. (We skip the precise construction, since it is exactly the same as in the proof of Theorem 16.) Counting the crossings of  with P and Λ, we obtain:
1. (i)

crosses P exactly |P|+2k times;

2. (ii)

crosses Λ at least |Λ|=|P|−2k times;

3. (iii)

for each of the points $$p_{i}^{*}\wedge q^{*}$$, replacing the crossing point by a contact point removes two crossings with .

Thus the edges [p i ,q] cannot all be contained in E. □

### Remark 28

Observe that a set of edges is pointed if and only if it is 1-alternation-free. In contrast, we want to observe the difference between k-alternation-freeness and the following natural notion of k-pointedness: we say that a set F of edges with vertices in P is k-pointed if for all p in P, there exists a line which passes through p and defines a half-plane that contains at most k−1 segments of F adjacent to p. Observe that a k-pointed set is automatically k-alternation-free but that the converse statement does not hold (see Fig. 18(a)).

Finally, contrarily to pseudotriangulations (k=1) and multitriangulations (convex position), the condition of avoiding (k+1)-crossings does not hold for k-pseudotriangulations in general:

### Remark 29

There exist k-pseudotriangulations with (k+1)-crossings (see Fig. 18(b)) as well as (k+1)-crossing-free k-alternation-free sets of edges that are not subsets of k-pseudotriangulations (see Fig. 18(c)).

### 4.3 Stars in Multipseudotriangulations

To complete our understanding of the primal of multipseudotriangulations, we need to generalize pseudotriangles of pseudotriangulations and k-stars of k-triangulations: both pseudotriangles and k-stars correspond to pseudolines of the covering pseudoline arrangement.

We keep the notations of the previous section: P is a point set in general position, Λ is a k-pseudotriangulation of P and E is the primal set of edges of Λ.

### Definition 30

We call star of a pseudoline λΛ the set of edges
$${S(\lambda) :=\bigl \{[p,q] \,\big |\,p,q\in P,\ p^*\wedge q^*\text{ contact\ point\ of\ }\lambda\bigr \}}$$
primal to the contact points of λ.

### Lemma 31

For any λΛ, the star S(λ) is non-empty.

### Proof

We have to prove that any pseudoline λ of Λ supports at least one contact point. If it is not the case, then λ is also a pseudoline of P , and all the |P|−1 crossing points of λ with P ∖{λ} should be crossing points of λ with the arrangement Λ∖{λ}. This is impossible since |Λ∖{λ}|=|P|−2k−1. □

Similarly to the case of k-triangulations of the n-gon, we say that an edge [p,q] of E is a k-relevant (resp. k-boundary, resp. k-irrelevant) edge if there remain strictly more than (resp. exactly, resp. strictly less than) k−1 points of P on each side (resp. one side) of the line (pq). In other words, p q is located in the k-kernel (resp. in the intersection of the kth level and the k-kernel, resp. in the first k levels) of the pseudoline arrangement P . Thus, the edge [p,q] is contained in 2 (resp. 1, resp. 0) stars of Λ.

The edges of a star S(λ) are cyclically ordered by the order of their dual contact points on λ, and thus S(λ) forms a (not-necessarily simple) polygonal cycle. For any point q in the plane, let σ λ (q) denote the winding number of S(λ) around q, that is, the number of rounds made by S(λ) around the point q (see Fig. 19(a)). For example, the winding number of a point in the external face is 0.

We call k-depth of a point q the number δ k (q) of k-boundary edges of P crossed by any (generic continuous) path from q to the external face, counted positively when passing from the “big” side (the one containing at least k vertices of P) to the “small side” (the one containing k−1 vertices of P), and negatively otherwise (see Fig. 19(b)). That this number is independent from the path can be seen by mutation. For example, δ 1(q) is 1 if q is in the convex hull of P and 0 otherwise.

### Proposition 32

Any point q of the plane is covered δ k (q) times by the stars S(λ), λΛ, of the k-pseudotriangulation Λ of P :
$$\delta^k(q)=\sum_{\lambda\in \varLambda } \sigma_\ell(q).$$
The proposition is intuitively clear: let us walk on a continuous path from the external face to the point q. Initially, the winding numbers of all stars of Λ are zero (we start outside all stars of Λ). Then each time we cross an edge e:
1. (i)

If e is k-irrelevant, it is not contained in any star of Λ, and we do not change the winding numbers of the stars of Λ.

2. (ii)

If e is a k-boundary edge, and if we cross it positively, we increase the winding number of the star S of Λ containing e; if we cross e negatively, we decrease the winding number of S.

3. (iii)

If e is k-relevant, then we decrease the winding number of one star of Λ containing e and increase the winding number of the other star of Λ containing e.

Let us give a formal proof in the dual:

### Proof of Proposition 32

Both σ λ (q) and δ k (q) can be read on the pseudoline q :
1. (i)

If τ λ (q) denotes the number of intersection points between q and λ (that is, the number of tangents to S(λ) passing through q), then σ λ (q)=(τ λ (q)−1)/2.

2. (ii)

If γ k (q) denotes the number of intersection points between q and the first k levels of P , then δ k (q)=kγ k (q)/2.

The pseudoline q has exactly |P| crossings with P (since P ∪{q } is an arrangement), which are crossings either with the pseudolines of Λ or with the first k levels of P . Hence,
$$|P|=\gamma^k(q)+\sum_{\lambda\in \varLambda } \tau_\lambda(q)=2k-2\delta ^k(q)+|\varLambda |+2\sum_{\lambda\in \varLambda }\sigma_\lambda(q),$$
and we get the aforementioned result since |Λ|=|P|−2k. □

### Remark 33

As a consequence of Proposition 32, we see that the k-depth of any point q in any point set P is always non-negative (as a sum of non-negative numbers). It is interesting to notice that Welzl proved in [44] that this non-negativity property is actually equivalent to the Lower Bound Theorem for d-dimensional polytopes with d+3 vertices.

A corner of the star S(λ) is an internal convex angle of it (see Fig. 21(a)). In the following proposition, we are interested in the number of corners of S(λ). For points in convex position (Sect. 3.3), the number of corners of a star is always 2k+1. This is not true anymore in general position as illustrated in Fig. 20. The following proposition gives our best bounds on the number of corners of the star of a multipseudotriangulation.

### Proposition 34

The number of corners of a star S(λ) of a k-pseudotriangulation of P is odd and between 2k+1 and 2(k−1)|P|+2k+1.

### Proof

We read convexity of internal angles of S(λ) on the preimage $$\bar{\lambda}$$ of the pseudoline λ under the projection π. Let pqr be an internal angle, let v=p q  and w=q r denote the contact points corresponding to the two edges [p,q] and [q,r] of this angle, and let $$\bar{v}$$ and $$\bar{w}$$ denote two consecutive preimages of v and w on $$\bar{\lambda}$$ (meaning that $$\bar{w}$$ is located between $$\bar{v}$$ and $$\tau (\bar{v})$$). The angle pqr is a corner if and only if $$\bar{v}$$ and $$\bar{w}$$ lie on opposite sides of $$\bar{\lambda}$$, meaning that the other curves touching $$\bar{\lambda}$$ at $$\bar{v}$$ and $$\bar{w}$$ lie on opposite sides, one above and one below $$\bar{\lambda}$$ (see Fig. 21(b)).
In particular, the number c(λ)=c of corners of S(λ) is the number of opposite consecutive contact points on $$\bar{\lambda}$$ between two versions $$\bar{v}$$ and $$\tau(\bar{v})$$ of a contact point v of λ. To see that c is odd, imagine that we are discovering the contact points of λ one by one. The first contact point v that we see corresponds to two opposite contact points $$\bar{v}$$ and $$\tau(\bar{v})$$ on $$\bar{\lambda}$$. Then, at each stage, we insert a new contact point $$\bar{w}$$ between two old contact points that can be:
1. (i)

either on opposite sides and then we are not changing c;

2. (ii)

or on the same side and we are adding to c either 0 (if $$\bar{w}$$ is also on the same side) or 2 (if $$\bar{w}$$ is on the opposite side).

Thus, c remains odd in any case.

To prove the lower bound, we use our witness method. We perturb λ a little bit to obtain a pseudoline μ that passes on the opposite side of each contact point (this is possible since c is odd). This pseudoline μ crosses λ between each pair of opposite contact points and crosses the other pseudolines of Λ exactly as λ does. Thus, μ crosses Λ exactly |Λ|−1+c times. But since μ is a pseudoline, it has to cross all the pseudolines of P at least once. Thus, |P|≤|Λ|−1+c=|P|−2k−1+c and c≥2k+1.

From this lower bound, we derive automatically the upper bound. Indeed, we know that the number of corners around one point p is at most deg(p)−1. Consequently,
$$\sum_{p\in P} \bigl(\deg(p)-1\bigr) \ge\sum_{\nu\in \varLambda } c(\nu) = c(\lambda)+\sum_{\substack{\nu\in \varLambda \\ \nu\ne\lambda}} c(\nu).$$
The left sum equals 2k(2|P|−2k−1)−|P| while, according to the previous lower bound, the right one is at least c+(|P|−2k−1)(2k+1). Thus we get c≤2(k−1)|P|+2k+1. □

## 5 Iterated Multipseudotriangulations

By definition, a k-pseudotriangulation of an m-pseudotriangulation of a pseudoline arrangement L is a (k+m)-pseudotriangulation of L. In this section, we study these iterated sequences of multipseudotriangulations. In particular, we compare multipseudotriangulations with iterated sequences of 1-pseudotriangulations.

### 5.1 Definition and Examples

Let L be a pseudoline arrangement. An iterated multipseudotriangulation of L is a sequence Λ 1,…,Λ r of pseudoline arrangements such that Λ i is a multipseudotriangulation of Λ i−1 for all i (by convention, Λ 0=L). We call signature of Λ 1,…,Λ r the sequence k 1<⋯<k r of integers such that Λ i is a k i -pseudotriangulation of L for all i. Observe that the assumption that contact points of a pseudoline arrangement L should be contact points of any multipseudotriangulation of L is natural in this setting: iterated multipseudotriangulations correspond to decreasing sequences of sets of crossing points.

A decomposition of a multipseudotriangulation Λ of a pseudoline arrangement L is an iterated multipseudotriangulation Λ 1,…,Λ r of L such that Λ r =Λ and r>1. We say that Λ is decomposable if such a decomposition exists, and irreducible otherwise. The decomposition is complete if its signature is 1,2,…,r.

It is tempting to believe that all multipseudotriangulations are completely decomposable. This would allow to focus only on pseudotriangulations. However, we start by showing that not even all multitriangulations are decomposable. The following example is due to Francisco Santos.

### Example 35

(An irreducible 2-triangulation of the 15-gon)

We consider the geometric graph T of Fig. 22. The edges are:
1. (i)

all the 2-irrelevant and 2-boundary edges of the 15-gon, and

2. (ii)

the five zigzags Z a ={[3a,3a+6],[3a+6,3a+1],[3a+1,3a+5], [3a+5,3a+2]}, for a∈{0,1,2,3,4}.

Thus, T has 50 edges and is 3-crossing-free (since the only 2-relevant edges of T that cross a zigzag Z a are edges of Z a−1 and Z a+1). Consequently, T is a 2-triangulation of the 15-gon.

Let us now prove that T is irreducible, that is, that T contains no triangulation. Observe first that the edge [0,6] cannot be an edge of a triangulation contained in T since none of the triangles 06ii∈{7,…,14}, is contained in T. Thus, we are looking for a triangulation contained in T∖{[0,6]}. Repeating the argument successively for the edges [1,6], [1,5] and [2,5], we prove that the zigzag Z 0 is disjoint from any triangulation contained in T. By symmetry, this proves the irreducibility of T .

### 5.2 Iterated Greedy Pseudotriangulations

Greedy multipseudotriangulations provide interesting examples of iteration of pseudotriangulations. Let L be a pseudoline arrangement, and χ be a cut of L.

### Theorem 36

For any positive integers a and b, $$\varGamma _{\chi}^{a+b}(L)=\varGamma _{\chi}^{b}(\varGamma _{\chi}^{a}(L))$$. Consequently, for any integer k, $$\varGamma _{\chi}^{k}(L)=\varGamma _{\chi}^{1}\circ \varGamma _{\chi}^{1}\circ\cdots\circ \varGamma _{\chi}^{1}(L)$$, where  $$\varGamma _{\chi}^{1}(.)$$ is iterated k times.

### Proof

Since χ is a cut of L, it is also a cut of $$\varGamma ^{a}_{\chi}(L)$$ and thus $$\varGamma ^{b}_{\chi}(\varGamma ^{a}_{\chi}(L))$$ is well defined. Observe also that we can assume that L has no contact point (otherwise, we can open them). Let n:=|L| and $$m :={n \choose2}$$.

Let χ=χ 0,…,χ m =χ be a backward sweep of L. For all i, let v i denote the vertex of L swept when passing from χ i to χ i+1, and i denote the integer such that the pseudolines that cross at v i are the i th and (i +1)th pseudolines of L on χ i .

Let σ 0,…,σ m denote the sequence of permutations corresponding to $$\varGamma ^{a}_{\chi}(L)$$ on the sweep χ 0,…,χ m . In other words, σ 0 is the permutation
$$[1,\dots,a,n-a,n-a-1,\dots,a+2,a+1,n-a+1,\dots,n],$$
whose first a and last a entries are preserved, while its n−2a intermediate entries are inverted. Then, for all i, the permutation σ i+1 is obtained from σ i by sorting its i th and (i +1)th entries.
Similarly, let ρ 0,…,ρ m and ω 0,…,ω m denote the sequences of permutations corresponding to $$\varGamma _{\chi}^{a+b}(L)$$ and $$\varGamma ^{b}_{\chi}(\varGamma ^{a}_{\chi}(L))$$, respectively: both ρ 0 and ω 0 equal the permutation whose first and last a+b entries are preserved and whose n−2a−2b intermediate entries are inverted, and:
• ρ i+1 is obtained from ρ i by sorting its i th and (i +1)th entries;

• if $$v_{i}\notin \varGamma ^{a}_{\chi}(L)$$, then ω i+1 is obtained from ω i by sorting its i th and (i +1)th entries; otherwise, ω i+1=ω i .

We claim that for all i,
1. (A)

all the inversions of ρ i are also inversions of σ i : ρ i (p)>ρ i (q) implies σ i (p)>σ i (q) for all 1≤p<qn; and

2. (B)

ρ i =ω i .

We prove this claim by induction on i. It is clear for i=0. Assume it holds for i and let us prove it for i+1. We have two possible situations:
1. (1)

First caseσ i (i )<σ i (i +1). Then σ i+1=σ i and $${v_{i}\in \varGamma ^{a}_{\chi}(L)}$$. Thus, ω i+1=ω i . Furthermore, using property (A) at rank i, we know that ρ i (i )<ρ i (i +1), and thus ρ i+1=ρ i . To summarize, σ i+1=σ i , ω i+1=ω i , and ρ i+1=ρ i , which trivially implies that properties (A) and (B) remain true.

2. (2)
Second caseσ i (i )>σ i (i +1). Then σ i+1 is obtained from σ i by exchanging the i th and (i +1)th entries, and $$v_{i}\notin \varGamma ^{a}_{\chi}(L)$$. Consequently, ρ i+1 and ω i+1 are both obtained from ρ i  and ω i , respectively, by sorting their i th and (i +1)th entries. Thus, property (B) obviously remains true. As far as property (A) is concerned, the result is obvious if p and q are different from i  and i +1. By symmetry, it suffices to prove that for any p<i , ρ i+1(p)>ρ i+1(i ) implies σ i+1(p)>σ i+1(i ). We have to consider two subcases:
1. (a)

First subcaseρ i (i )<ρ i (i +1). Then ρ i+1=ρ i . Thus, if p<i is such that ρ i+1(p)>ρ i+1(i ), then we have ρ i (p)>ρ i (i ). Consequently, we obtain σ i+1(p)=σ i (p)>σ i (i )>σ i (i +1)=σ i+1(i ).

2. (b)

Second subcaseρ i (i )>ρ i (i +1). Then ρ i+1 is obtained from ρ i by exchanging its i th and (i +1)th entries. If p<i is such that ρ i+1(p)>ρ i+1(i ), then we have ρ i (p)>ρ i (i +1). Consequently, we obtain σ i+1(p)=σ i (p)>σ i (i +1)=σ i+1(i ).

Obviously, property (B) of our claim proves the theorem. □

### 5.3 Flips in Iterated Multipseudotriangulations

Let Λ 1,…,Λ r be an iterated multipseudotriangulation of a pseudoline arrangement L, with signature k 1<⋯<k r . Let v be a contact point of Λ r (which is not a contact point of L), and let i denote the first integer for which v is a contact point of Λ i (thus, v is a contact point of Λ j if and only if ijr). For all ijr, let $$\varLambda '_{j}$$ denote the pseudoline arrangement obtained from Λ j by flipping v, and let w j denote the new contact point of $$\varLambda '_{j}$$. Let j denote the biggest integer such that w j =w i . There are three possibilities:
1. (i)

If j=r, then $$\varLambda _{1},\dots,\varLambda _{i-1},\varLambda '_{i},\dots ,\varLambda '_{r}$$ is an iterated multipseudotriangulation of L. We say that it is obtained from Λ 1,…,Λ r by a complete flip of v.

2. (ii)
If j<r, and w i =w j is a contact point of Λ j+1, then
$$\varLambda _1,\dots,\varLambda _{i-1},\varLambda '_i,\dots,\varLambda '_j,\varLambda _{j+1},\dots,\varLambda _r$$
is an iterated multipseudotriangulation of L. We say that it is obtained from Λ 1,…,Λ r by a partial flip of v.

3. (iii)

If j<r, and w i =w j is a crossing point in Λ j+1, then we cannot flip v in Λ i maintaining an iterated multipseudotriangulation of L.

To illustrate these three possible cases, we have labeled on Fig. 23 some intersection points of an iterated pseudotriangulation. We have chosen three contact points u,v,w in (b). For z∈{u,v,w}, we label z′ (resp. z″) the crossing point corresponding to z in (b) (resp. in (c)). Observe that:
1. (i)

points u′ and u″ coincide. Thus we can flip simultaneously point u in (b) and (c) (complete flip);

2. (ii)

points v′ is different from v″ but is a contact point in (c). Thus, we can just flip v in (b), without changing (c) and we preserve an iterated pseudotriangulation (partial flip);

3. (iii)

point w′ is a crossing point in (c), different from w″. Thus, we cannot flip w in (b) maintaining an iterated pseudotriangulation.

Let $$G^{k_{1},\dots,k_{r}}(L)$$ be the graph whose vertices are the iterated multipseudotriangulations of L with signature k 1<…<k r , and whose edges are the pairs of iterated multipseudotriangulations linked by a (complete or partial) flip.

### Theorem 37

The graph of flips  $$G^{k_{1},\dots,k_{r}}(L)$$ is connected.

To prove this proposition, we need the following lemma:

### Lemma 38

Any intersection point v in the k-kernel of a pseudoline arrangement is a contact point in a k-pseudotriangulation of it.

### Proof

The result holds when k=1. We obtain the general case by iteration. □

### Proof of Theorem 37

We prove the result by induction on r (L is fixed). When r=1, we already know that the flip graph is connected. Now, let A  and A + be two iterated multipseudotriangulations of L with signature k 1<…<k r that we want to join by flips. Let B  and B + be iterated multipseudotriangulations of L with signature k 1<…<k r−1, and Λ  and Λ + be k r -pseudotriangulations of L such that A =B ,Λ and A +=B +,Λ +.

By induction, $$G^{k_{1},\dots,k_{r-1}}(L)$$ is connected: let
$$B_-=B_1,B_2,\dots,B_{p-1},B_p=B_+$$
be a path from B to B + in $$G^{k_{1},\dots,k_{r-1}}(L)$$. For all j, let v j be such that B j+1 is obtained from B j by flipping v j and let w j be such that B j is obtained from B j+1 by flipping w j . Let Λ j be a k r -pseudotriangulation of L containing the contact points of B j plus w j (it exists by Lemma 38), and let C j =B j ,Λ j . Let D j be the iterated multipseudotriangulation of L obtained from the iterated pseudotriangulation C j by a partial flip of v j . Finally, since $$G^{k_{r}}(B_{j})$$ is connected, there is a path of complete flips from D j−1 to C j .

Merging all these paths, we obtain a global path from A to A +: we transform A into C 1 via a path of complete flips; then C 1 into D 1 by the partial flip of v 1; then D 1 into C 2 via a path of complete flips; then C 2 into D 2 by the partial flip of v 2; and so on. □

## 6 Further Topics

We discuss here the extensions in the context of multipseudotriangulations of two known results on pseudotriangulations:
1. (1)

The first one concerns the connection between the greedy pseudotriangulation of a point set and its horizon trees.

2. (2)

The second one extends to arrangements of double pseudolines the definition and properties of multipseudotriangulations.

### 6.1 Greedy Multipseudotriangulations and Horizon Graphs

We have seen in previous sections that the greedy k-pseudotriangulation of a pseudoline arrangement L can be seen as:
1. (1)

the unique source of the graph of increasing flips;

2. (2)

a greedy choice of crossing points given by a sorting network;

3. (3)

a greedy choice of contact points;

4. (4)

an iteration of greedy 1-pseudotriangulations.

In this section, we provide a “pattern avoiding” characterization of the crossing points of the greedy k-pseudotriangulation of L.

Let L be a pseudoline arrangement, and χ be a cut of L. We index by  1,…, n the pseudolines of L in the order in which they cross χ (it is well defined, up to a complete inversion).

We define the k-upper χ-horizon set of L to be the set $$\mathbb {U}^{k}_{\chi}(L)$$ of crossing points  α β , with 1≤α<βn, such that there is no γ 1,…,γ k satisfying α<γ 1<⋯<γ k and $$\ell_{\alpha}\wedge\ell_{\gamma_{i}}\preccurlyeq _{\chi}\ell_{\alpha}\wedge\ell_{\beta}$$ for all i∈[k]. In other words, on each pseudoline  α of L, the set $$\mathbb {U}^{k}_{\chi}(L)$$ consists of the smallest k crossing points of the form  α β , with α<β.

Similarly, define the k-lower χ-horizon set of L to be the set $$\mathbb {L}^{k}_{\chi}(L)$$ of crossing points  α β , with 1≤α<βn, such that there is no δ 1,…,δ k satisfying δ 1<⋯<δ k <β and $${\ell _{\beta}\wedge\ell_{\delta_{i}}\preccurlyeq _{\chi}\ell_{\alpha}\wedge\ell_{\beta}}$$ for all i∈[k]. On each pseudoline  β of L, the set $$\mathbb {L}^{k}_{\chi}(L)$$ consists of the smallest k crossing points of the form  α β , with α<β.

Finally, we define the set $$\mathbb {G}^{k}_{\chi}(L)$$ to be the set of crossing points  α  ∧  β , with 1≤α<βn, such that there is no γ 1,…,γ k and δ 1,…,δ k satisfying:
1. (i)

α<γ 1<…<γ k , δ 1<…<δ k <β, and δ k <γ 1; and

2. (ii)

$$\ell_{\alpha}\wedge\ell_{\gamma_{i}}\preccurlyeq _{\chi}\ell_{\alpha}\wedge\ell _{\beta}$$ and $$\ell_{\beta}\wedge\ell_{\delta_{i}}\preccurlyeq _{\chi}\ell_{\alpha}\wedge \ell_{\beta}$$ for all i∈[k].

Obviously, the sets $$\mathbb {U}^{k}_{\chi}(L)$$ and $$\mathbb {L}^{k}_{\chi}(L)$$ are both contained in $$\mathbb {G}^{k}_{\chi}(L)$$.

### Example 39

In Fig. 24, we have labeled the vertices of the pseudoline arrangement L of Fig. 7(b) with different geometric tags according to their status:
(△)

crossing points of the k-upper χ-horizon set $$\mathbb {U}_{\chi}^{k}(L)$$ are represented by up triangles △;

()

crossing points of the k-lower χ-horizon set $$\mathbb {L}_{\chi}^{k}(L)$$ are represented by down triangles ;

()

crossing points in both $$\mathbb {U}_{\chi}^{k}(L)$$ and $$\mathbb {L}_{\chi}^{k}(L)$$ are represented by up and down triangles ;

(□)

crossing points of $$\mathbb {G}_{\chi}^{k}(L)$$ but neither in $$\mathbb {U}_{\chi}^{k}(L)$$, nor in $$\mathbb {L}_{\chi}^{k}(L)$$ are represented by squares □.

Observe that the remaining vertices are exactly the crossing points of the χ-greedy k-pseudotriangulation of L.

### Example 40

We consider the arrangement $$C_{n}^{*}$$ of n pseudolines in convex position. Let z be a vertex on the upper hull of its support, F:={z′∣zz′} denote the filter generated by z, and χ denote the corresponding cut (see Fig. 25). It is easy to check that:
1. (i)

$$\mathbb {U}^{k}_{\chi}(C_{n}^{*})=\{\ell_{\alpha}\wedge\ell_{\beta}\mid 1\le\alpha \le n\text{ and }\alpha<\beta\le\alpha+k\}$$;

2. (ii)

$$\mathbb {L}^{k}_{\chi}(C_{n}^{*})=\{\ell_{\alpha}\wedge\ell_{\beta}\mid 1\le\alpha \le k\text{ and }\alpha< j\le n\}$$; and

3. (iii)

$$\mathbb {G}^{k}_{\chi}(C_{n}^{*})=\mathbb {U}^{k}_{\chi}(\mathcal {C}_{n})\cup \mathbb {L}^{k}_{\chi}(\mathcal {C}_{n})$$.

Observe again that the remaining vertices are exactly the crossing points of the χ-greedy k-pseudotriangulation of $$C_{n}^{*}$$.

Theorem 41 extends this observation to all pseudoline arrangements, using convex position as a starting point for a proof by mutation.

### Theorem 41

For any pseudoline arrangement L with no contact point, and any cut χ of L, the sets  $$V(\varGamma _{\chi}^{k}(L))$$ and  $$\mathbb {G}^{k}_{\chi}(L)$$ coincide.

The proof of this theorem works by mutation. A mutation is a local transformation of an arrangement L that only inverts one triangular face of L. More precisely, it is a homotopy of arrangements during which only one curve L moves, sweeping a single vertex of the remaining arrangement L∖{} (see Fig. 26).

If P is a point set of a topological plane, mutating an empty triangle p q r of P by sweeping the vertex q r with the pseudoline p corresponds in the primal to moving p a little bit such that only the orientation of the triangle pqr changes.

The graph of mutations on pseudoline arrangements is known to be connected: any two pseudoline arrangements (with no contact points and the same number of pseudolines) are homotopic via a finite sequence of mutations (followed by a homeomorphism). In fact, one can even avoid mutations of triangles that cross a given cut of L:

### Proposition 42

Let L and Lbe two pseudoline arrangements of  $$\mathcal {M}$$ (with no contact points and the same number of pseudolines) and χ be a cut of both of L and L′. There is a finite sequence of mutations of triangles disjoint from χ that transforms L into L′.

### Proof

We prove that any arrangement L of n pseudolines can be transformed into the arrangement $$C_{n}^{*}$$ of n pseudolines in convex position (see Fig. 25).

Let  1,…, n denote the pseudolines of L (ordered by their crossings with χ). Let Δ denote the triangle formed by χ, 1 and  2. If there is a vertex of the arrangement L∖{ 1, 2} inside Δ, then there is a triangle of the arrangement L inside Δ and adjacent to  1 or  2. Mutating this triangle reduces the number of vertices of L∖{ 1, 2} inside Δ such that after some mutations, there is no more vertex inside Δ. If Δ is intersected by pseudolines of L∖{ 1, 2}, then there is a triangle inside Δ formed by  1 2 and one of these intersecting pseudolines (the one closest to  1 2). Mutating this triangle reduces the number of pseudolines intersecting Δ. Thus, after some mutations, Δ is a triangle of the arrangement L.

Repeating these arguments, we prove that for all i∈{2,…,n−1} and after some mutations, i , 1, i+1 and χ delimit a face of the arrangement L. Thus, one of the two topological disk delimited by χ and  1 contains no more vertex of L, and the proof is then straightforward by induction. □

Let ∇ be a triangle of L not intersecting χ. Let L′ denote the pseudoline arrangement obtained from L by mutating the triangle ∇ into the inverted triangle Δ. Let a<b<c denote the indices of the pseudolines  a , b and  c that form ∇ and Δ. In ∇, we denote A= b c , B= a c and C= a b ; similarly, in Δ, we denote D= b c , E= a c and F= a b (see Fig. 27).

### Lemma 43

With these notations, the following properties hold:

### Proof

By symmetry, it is enough to prove the first line of each of the four points of the lemma.

Properties of point (i) directly come from the definitions. For example, all the assertions of the first line are false if and only if there exist γ 1,…,γ k−1 with a<γ 1<⋯<γ k−1 and, for all i∈[k−1], $$\ell_{a}\wedge\ell_{\gamma_{i}}\preccurlyeq _{\chi}C$$ (or equivalently $$\ell_{a}\wedge\ell_{\gamma_{i}}\preccurlyeq _{\chi}E$$).

We derive point (ii) from the following observation: if γ>b and if  b γ χ C, then γ>a and  a γ χ B.

For point (iii), assume that $$A\notin \mathbb {U}_{\chi}^{k}(L)$$ and $$C\notin \mathbb {L}_{\chi}^{k}(L)$$. Then there exist γ 1,…,γ k and δ 1,…,δ k such that δ 1<⋯<δ k <b<γ 1<⋯<γ k and, for all i∈[k], $$\ell_{b}\wedge\ell_{\gamma_{i}}\preccurlyeq _{\chi}A$$ (and therefore $$\ell_{a}\wedge \ell_{\gamma_{i}}\preccurlyeq _{\chi}C$$) and $$\ell_{b}\wedge\ell_{\delta_{i}}\preccurlyeq _{\chi}C$$. Thus $$C\notin \mathbb {G}_{\chi}^{k}(L)$$.

Finally, assume that $$C\in \mathbb {G}_{\chi}^{k}(L)$$ and $$E\notin \mathbb {G}_{\chi}^{k}(L')$$. Then there exist γ 1,…,γ k and δ 1,…,δ k such that a<γ 1<⋯<γ k , δ 1<⋯<δ k <c, δ k <γ 1, and for all i∈[k], $$\ell_{a}\wedge\ell_{\gamma _{i}}\preccurlyeq _{\chi}E$$ and $$\ell_{c}\wedge\ell_{\delta_{i}}\preccurlyeq _{\chi}E$$. Since $$C\in \mathbb {G}_{\chi}^{k}(L)$$, we have δ k >b. Thus b<γ 1<⋯<γ k and for all i∈[k], $$\ell_{b}\wedge\ell_{\gamma_{i}}\preccurlyeq _{\chi}A$$ and $$\ell_{c}\wedge\ell_{\delta_{i}}\preccurlyeq _{\chi}A$$. This implies that $$A\notin \mathbb {G}_{C}^{k}(L)$$. □

We are now ready to establish the proof of Theorem 41:

### Proof of Theorem 41

The proof works by mutation. We already observed the result when the pseudoline arrangement is in convex position (see Example 40 and Fig. 25). Proposition 42 ensures that any pseudoline arrangement can be reached from this convex configuration by mutations of triangles not intersecting χ. Thus, it is sufficient to prove that such a mutation preserves the property.

Assume that L is a pseudoline arrangement and χ is a cut of L, for which the result holds. Let ∇ be a triangle of L not intersecting χ. Let L′ denote the pseudoline arrangement obtained from L by mutating the triangle ∇ into the inverted triangle Δ. Let A,B,C and D,E,F denote the vertices of ∇ and Δ as indicated in Fig. 27.

If v is a vertex of the arrangement L′ different from D,E,F, then:
$$v\in V \bigl(\varGamma ^k_\chi(L')\bigr)\quad {\Longleftrightarrow} \quad v\in V \bigl(\varGamma ^k_\chi (L)\bigr)\quad {\Longleftrightarrow} \quad v\in \mathbb {G}^k_\chi(L)\quad {\Longleftrightarrow} \quad v\in \mathbb {G}^k_\chi(L').$$
Thus, we only have to prove the equivalence when v∈{D,E,F}. The proof is a (computational) case analysis: using the properties of Lemma 43 as boolean equalities relating the boolean variables defined by “$$X\in\mathbb{Y}_{\chi}^{p}(L)$$” (where X∈{A,B,C,D,E,F}, $$\mathbb{Y}\in\{\mathbb {U},\mathbb {L},\mathbb {G}\}$$, and p∈{k−1,k}), we have written a short boolean satisfiability program which affirms that:
1. (i)

either $$\{A,B,C\}\subset \mathbb {G}_{\chi}^{k}(L)$$ and $$\{D,E,F\}\subset \mathbb {G}_{\chi}^{k}(L')$$;

2. (ii)

or $$\{A,B,C\}\cap \mathbb {G}_{\chi}^{k}(L)=\{A,C\}$$ and $$\{D,E,F\}\cap \mathbb {G}_{\chi}^{k}(L')=\{D,E\}$$;

3. (iii)

or $$\{A,B,C\}\cap \mathbb {G}_{\chi}^{k}(L)=\{B,C\}$$ and $$\{D,E,F\}\cap \mathbb {G}_{\chi}^{k}(L')=\{D,F\}$$;

4. (iv)

or $$\{A,B,C\}\cap \mathbb {G}_{\chi}^{k}(L)=\{A\}$$ and $$\{D,E,F\}\cap \mathbb {G}_{\chi}^{k}(L')=\{D\}$$;

5. (v)

or $$\{A,B,C\}\cap \mathbb {G}_{\chi}^{k}(L)=\{C\}$$ and $$\{D,E,F\}\cap \mathbb {G}_{\chi}^{k}(L')=\{F\}$$;

6. (vi)

or $$\{A,B,C\}\cap \mathbb {G}_{\chi}^{k}(L)=\emptyset$$ and $$\{D,E,F\}\cap \mathbb {G}_{\chi}^{k}(L')=\emptyset$$.

It is easy to check that these six cases correspond to sorting the six possible permutations of {1,2,3} on ∇ and Δ (see Fig. 28). Consequently, if $$V(\varGamma _{\chi}^{k}(L))\cap\{A,B,C\}=\mathbb {G}_{\chi}^{k}(L)\cap\{A,B,C\}$$, then we have $$V(\varGamma _{\chi}^{k}(L'))\cap\{D,E,F\}=\mathbb {G}_{\chi}^{k}(L')\cap\{D,E,F\}$$, which finishes the proof.  □
Let us finish this discussion by recalling the interpretation of the horizon sets when k=1. Let P be a finite point set. For any pP, let u(p) denote the point q that minimizes the angle (Ox,pq) among all points of P with y p <y q (by convention, for the higher point p of Pu(p)=p). The upper horizon tree of P is the set $$\mathbb {U}(P)=\{pu(p) \mid p\in P\}$$. The lower horizon tree $$\mathbb {L}(P)$$ of P is defined symmetrically. See Fig. 29.

Choosing a cut χ of P corresponding to the point at infinity (−∞,0) makes coincide primal and dual definitions of horizon sets: we have $$\mathbb {U}^{1}_{\chi}(P^{*})=\mathbb {U}(P)^{*}$$ and $$\mathbb {L}^{1}_{\chi}(P^{*})=\mathbb {L}(P)^{*}$$.

In [31], Pocchiola observed that the set $$\mathbb {U}(P)\cup \mathbb {L}(P)$$ of edges can be completed into a pseudotriangulation of P just by adding the sources of the faces of P intersected by the cut χ. The obtained pseudotriangulation is our χ-greedy 1-pseudotriangulation $$\varGamma ^{1}_{\chi}(P^{*})$$.

### 6.2 Multipseudotriangulations of Double Pseudoline Arrangements

In this section, we deal with double pseudoline arrangements, i.e. duals of sets of disjoint convex bodies. Definitions and properties of multipseudotriangulations naturally extend to these objects.

#### 6.2.1 Definitions

A simple closed curve in the Möbius strip can be:
1. (i)

either contractible (homotopic to a point);

2. (ii)

or non separating, or equivalently homotopic to a generator of the fundamental group of $$\mathcal {M}$$: it is a pseudoline;

3. (iii)
or separating and non-contractible, or equivalently homotopic to the double of a generator of the fundamental group of $$\mathcal {M}$$: it is called a double pseudoline (see Fig. 30(a)).

The complement of a double pseudoline  has two connected components: the bounded one is a Möbius strip M and the unbounded one is an open cylinder C (see Fig. 30(a)).

The canonical example of a double pseudoline is the set C of tangents to a convex body C of the plane. Observe also that the pth level of a pseudoline arrangement is a double pseudoline. If C is a convex body of the plane, then the Möbius strip $$M_{C^{*}}$$ corresponds to lines that pierce C, while $$C_{C^{*}}$$ corresponds to lines disjoint from C. If C and C′ are two disjoint convex bodies, the two corresponding double pseudolines C and C cross four times (see Figs. 31 and 32). Each of these four crossings corresponds to one of the four bitangents (or common tangents) between C and C′.

### Definition 44

[17]

A double pseudoline arrangement is a finite set of double pseudolines such that any two of them have exactly four intersection points, cross transversally at these points, and induce a cell decomposition of the Möbius strip (i.e. the complement of their union is a union of topological disks, together with the external cell).

Given a set Q of disjoint convex bodies in the plane (or in any topological plane), its dual Q :={C CQ} is an arrangement of double pseudolines (see Figs. 31 and 32). Furthermore, as for pseudoline arrangements, any double pseudoline arrangement can be represented by (i.e. is the dual of) a set of disjoint convex bodies in a topological plane [17].

In this paper, we only consider simple arrangements of double pseudolines. Defining the support, the levels, and the kernels of double pseudoline arrangements as for pseudoline arrangements, we can extend multipseudotriangulations to double pseudoline arrangements (see Fig. 33):

### Definition 45

A k-pseudotriangulation of a double pseudoline arrangement L is a pseudoline arrangement supported by the k-kernel of L.

All the properties related to flips developed in Sect. 2 apply in this context. In the end of this section, we only revisit the properties of the primal of a multipseudotriangulation of a double pseudoline arrangement.

#### 6.2.2 Elementary Properties

Let Q be a set disjoint convex bodies in general position in the plane and Q be its dual arrangement. Let Λ be a k-pseudotriangulation of Q , V(Λ) denote all crossing points of Q that are not crossing points of Λ, and E denote the corresponding set of bitangents of Q. As in Sect. 4.2, we discuss the properties of the primal configuration E:

### Lemma 46

The set E has 4|Q|k−|Q|−2k 2k edges.

### Proof

The number of edges of E is the number of crossing points of Q minus the number of crossing points of Λ, i.e.
□

We now discuss pointedness. For any convex body C of Q, we arbitrarily choose a point p C in the interior of C, and we consider the set X C of all segments between p C and a sharp boundary point of C. We denote by X:=⋃ CQ X C the set of all these segments.

### Lemma 47

The set EX cannot contain a k-alternation.

### Proof

Let C be a convex body of Q, let q be a sharp point of C and let F:={[p i ,q]∣i∈[2k]} be a set of edges incident to q such that {[p C ,q]}∪F is a k-alternation. We prove that F is not contained in E. Indeed, the dual pseudolines $$\{p_{i}^{*} \mid i\in[2k]\}$$ intersect alternately the double pseudoline C between the tangents to C at q (see Fig. 34). This ensures the existence of a witness pseudoline  that separates all the contact points $$p_{i}^{*}\wedge C^{*}$$, while crossing C exactly 2k times and the other double pseudolines of Q exactly has q does. (As usual, we obtain it by a perturbation of the pseudoline q .) Counting the crossings of  with Q and Λ, respectively, we obtain:
1. (i)

crosses Q exactly 2|(Q∖{C})|+2k=2|Q|+2k−2 times;

2. (ii)

crosses Λ at least |Λ|=2|Q|−2k times;

3. (iii)

for each of the points p i q , replacing the crossing point by a contact point removes two crossings with .

□

#### 6.2.3 Stars

If λ is a pseudoline of Λ, we call star the envelope S(λ) of the primal lines of the points of λ. The star S(λ) contains:
1. (i)

all bitangents τ between two convex bodies of Q such that τ is a contact point of λ; and

2. (ii)

all convex arcs formed by the tangent points of the lines covered by λ with the convex bodies of Q.

This star is a (non-necessarily simple) closed curve. We again have bounds on the number of corners (i.e. convex internal angles) of S(λ):

### Proposition 48

The number of corners of S(λ) is odd and between 2k−1 and 4k|Q|−2k−1.

### Proof

In the case of double pseudoline arrangements, corners are even easier to characterize: a bitangent τ between two convex C and C′ of Q always defines two corners, one at each extremity. These corners are contained in one of the two stars adjacent to τ. Let λ be a pseudoline with a contact point at τ. In a neighborhood of τ, the pseudoline λ can be contained either in $$M_{C^{*}}$$ or in $$C_{C^{*}}$$. In the first case, the star S(λ) contains the corner formed by the bitangent τ and the convex C (or possibly, by the bitangent τ and another tangent to C); while in the second case, it does not. (The same observation holds for C′.)

In other words, if the double pseudoline C supports a pseudoline λ between two contact points v and w, then one of the three following situations occurs (see Fig. 35):
1. (i)

either v and w lie on opposite sides of λ; then exactly one of these contact points lies in $$M_{C^{*}}$$, and S(λ) has one corner at C,

2. (ii)

or v and w both lie on $$M_{C^{*}}$$, and S(λ) has two corners at C,

3. (iii)

or v and w both lie on $$C_{C^{*}}$$, and S(λ) has no corners at C.

In particular, the number c=c(λ) of corners of λ is the number of situations (i) plus twice the number of situations (ii). This proves that c is odd and (at least) bigger than the number of opposite consecutive contact points of the pseudoline λ.

In order to get a lower bound on this number, we construct (as in the proof of Proposition 34) a witness pseudoline μ that crosses λ between each pair of opposite contact points and passes on the opposite side of each contact point. It crosses λ at most c times and Λ∖{λ} exactly |Λ|−1 times. Moreover, if α is a pseudoline and β is a double pseudoline of $$\mathcal {M}$$, then either α is contained in M β and has no crossing with β, or α and β have an even number of crossings. Since μ is a pseudoline and can be contained in at most one Möbius strip $$M_{C}^{*}$$ (for CQ), the number of crossings of μ with Q is at least 2(|Q|−1). Thus, we obtain the lower bound 2(|Q|−1)≤2|Q|−2k−1+c, i.e. c≥2k−1.

From this lower bound, we obtain the upper bound: the total number of corners is at most twice the number of bitangents:
$$2 \bigl(4k|Q|-|Q|-2k^2-k\bigr)\ge\sum_{\mu\in \varLambda } c(\mu)\ge c(\lambda )+ \bigl(2|Q|-2k-1\bigr)(2k-1),$$
and we get c≤4|Q|k−2k−1. □

When k=1, we can even prove that all stars are pseudotriangles. Indeed, since any star has at least three corners, the upper bound calculus gives 2(3|Q|−3)≥c+3(2|Q|−3), i.e. c≤3.

For general k, observe that contrary to the case of pseudoline arrangements, a star may have 2k−1 corners (see Fig. 36).

Let us now give an analogue of Proposition 32. For any point q in the plane, we denote by η k (q) the number of crossings between q and the support of Q minus its first k levels. Let δ k (q):=η k (q)/2−|Q|+k. For any λΛ(U) and any point q in the plane, we still denote by σ λ (q) the winding number of S(λ) around q.

### Proposition 49

For any point q of the plane δ k (q)=∑ λΛ σ λ (q).

### Proof

Remember that if τ λ (q) denotes the number of intersection points between q and λ, then σ λ (q)=(τ λ (q)−1)/2. Thus, we have
$$\eta^k(q)=\sum_{\lambda\in \varLambda } \tau_\lambda(q)=|\varLambda |+2\sum _{\lambda\in \varLambda }\sigma_\lambda(q),$$
and we get the result since |Λ|=2|Q|−2k. □

When k=1, it is easy to see that δ 1(q) is 1 if q is inside the free space of the convex hull of Q (i.e. in the convex hull of Q, but not in Q), and 0 otherwise. Remember that a pseudotriangulation of Q is a pointed set of bitangents that decomposes the free space of the convex hull of Q into pseudotriangles [33]. Propositions 48 and 49 provide, when k=1, the following analogue of Theorem 16:

### Theorem 50

Let Q be a set of disjoint convex bodies (in general position) and Q denote its dual arrangement. Then:
1. (i)

The dual arrangement T :={Δ∣Δ pseudotriangle of T} of a pseudotriangulation T of Q is a 1-pseudotriangulation of Q .

2. (ii)
The primal set of edges
$$\quad E :=\bigl \{[p,q] \,\big |\,p,q\in P, p^*\wedge q^*\text{ is\ not\ a\ crossing\ point\ of\ } \varLambda \bigr \}$$
of a 1-pseudotriangulation Λ of Q is a pseudotriangulation of Q.

Observe that at least two other arguments are possible to prove (ii):
1. (1)

either comparing the degrees of the flip graphs as in our first proof of Theorem 16;

2. (2)

or checking that all forbidden configurations of the primal (two crossing bitangents, a non-pointed sharp vertex, a non-free bitangent) may not appear in the dual, as in our second proof of Theorem 16.

Let us finish this discussion about stars by interpreting the number δ k (q) for general k and for “almost every” point q. For any convex body C of Q, let ∇C denote the intersection of all closed half-planes delimited by a bitangent between two convex bodies of Q, and containing C (see Fig. 37). By definition, the bitangents between two convex bodies C and C′ of Q coincide with the bitangent of ∇C and ∇C′. Furthermore, the convex bodies ∇C (CQ) are maximal for this property. We denote ∇Q:={∇CCQ} the set of maximal convex bodies of Q.

For a point q outside ∇Q, the interpretation of δ k (q) is similar to the case of points. We call level of a bitangent τ the level of the corresponding crossing point in Q . Given a point q outside ∇Q, the number δ k (q) is the number of bitangents of level k crossed by any (generic continuous) path from q to the external face (in the complement of ∇Q), counted positively when passing from the “big” side to the “small side”, and negatively otherwise.

## 7 Open Questions

We finish by a short presentation of some open questions that have arisen out of this work. Since the submission of this paper, some of these questions were (at least partially) answered in [29, 40, 43]. We have decided to keep these questions in the discussion and to refer to the relevant articles in side remarks.

### Primal of a Multipseudotriangulation

When k=1 or in the case of convex position, primals of k-pseudotriangulations are characterized by simple non-crossing and pointedness conditions. For general k and general position, we know that the primal of a k-pseudotriangulation is k-alternation-free (Lemma 27), but there exist k-pseudotriangulations containing (k+1)-crossings as well as (k+1)-crossing-free k-alternation-free sets of edges not contained in k-pseudotriangulations (see Fig. 18). Thus, we still miss a simple condition to characterize multipseudotriangulations of points in general position:

### Question 51

Characterize primals of multipseudotriangulations.

Another question related to the primal of a multipseudotriangulation would be to determine whether for every point set there exists a multipseudotriangulation that looks as simple as possible. When k=1, we know that every point set in general position has:
1. (i)

a pointed pseudotriangulation consisting only of triangles and four-sided pseudotriangles [21];

2. (ii)

a pointed pseudotriangulation whose maximum degree is at most five [21].

### Question 52

Does every point set in general position have a k-pseudotriangulation with only “simple” stars (resp. only vertices with “little” degree)?

In the previous question, “simple” may be interpreted either as “with exactly 2k+1 corners” or as “with at most 2k+t edges” (for a minimal t). Similarly, “little” means smaller than a constant (as small as possible).

### Diameter of the Graph of Flips

The graph of flips on k-pseudotriangulations of a pseudoline arrangement L is connected, and an easy inductive argument shows that its diameter at is most quadratic in |L|. For certain particular cases, even better bounds are known:
1. (a)

The diameter of the graph of flips on pointed pseudotriangulations of a set of n points is at most O(nlnn) [4].

2. (b)

The graph of flips on the k-triangulations of the n-gon has diameter bounded by 2k(n−2k−1) [25, 28].

3. (c)

For triangulations of the n-gon, the diameter is exactly 2n−10 [41].

### Question 53

What is the (asymptotic) diameter of the flip graph?

### Polytopality

Let $$\mathcal {S}$$ be the support of a pseudoline arrangement. Let $$\Delta(\mathcal {S})$$ denote the simplicial complex of subsets of contact points of pseudoline arrangements supported by $$\mathcal {S}$$. Our results ensure that $$\Delta(\mathcal {S})$$ is an abstract polytope whose ridge graph is the graph of flips (see the discussion in [7, Sect. 2.2]). When $$\mathcal {S}$$ is the first kernel of the dual pseudoline arrangement of a point set of the Euclidean plane, it turns out that this abstract polytope can be realized effectively as a polytope of ℝ d (where d is the number of flippable edges), which is the polar of the polytope of pointed pseudotriangulations of [36]. An example of this polytope is presented in Fig. 38(a). When the points are in convex position, this polytope is the associahedron (see Fig. 38(b)). This leads to the following question:

### Question 54

Is $$\Delta(\mathcal {S})$$ the boundary complex of a polytope?

This question specializes for pseudotriangulations and multitriangulations to the following interesting questions:
1. (a)
Is the graph of flips on pseudotriangulations of a point set polytopal? Since [36] answers positively for Euclidean point sets, this question only remains open for non-stretchable arrangements. We have represented in Fig. 39 a pseudotriangulation of the smallest non-stretchable simple pseudoline arrangement (the non-Pappus pseudoline arrangement). Since this arrangement is symmetric under the dihedral group D 6, it could be worked out with methods similar to those in [8].

2. (b)

Is the graph of flips on k-triangulations of the n-gon polytopal? Jonsson proved that the simplicial complex of (k+1)-crossing-free sets of k-relevant diagonals of the n-gon is a combinatorial sphere [19]. However, except for little cases, the question of the polytopality of this complex remains open. We refer to [8, 28] and [26, Sect. 4.3] for a detailed discussion on this question.

### Remark 55

Since the submission of this paper, our knowledge on this question has progressed. In [43], Stump made the connection between the multitriangulations and the type A subword complexes defined in [22]. These simplicial complexes are precisely the simplicial complexes $$\Delta(\mathcal {S})$$ defined above. It implies in particular that
• these simplicial complexes are either topological spheres or topological balls [22], and

• Question 54 is the special type A case of Question 6.4 in [22].

We close this discussion by mentioning the related construction in [29]. It associates to each sorting network $$\mathcal {N}$$ its so-called brick polytope whose vertices correspond to certain pseudoline arrangements with contact points supported by $$\mathcal {N}$$. For certain well-chosen networks, the brick polytope specializes to Hohlweg and Lange’s realizations of the associahedron [18]. This construction answers Question 54 positively for a certain class of supports $$\mathcal {S}$$. It was moreover extended recently to spherical subword complexes of any finite type in [30].

### Number of Multipseudotriangulations

In his paper [20], Jonsson proved that the number of k-triangulations of the n-gon is equal to the determinant det(C nij )1≤i,jk (where $$C_{m}=\frac{1}{m+1}{2m\choose m}$$ denotes the mth Catalan number). This determinant also counts non-crossing k-tuples of Dyck paths of semi-length n−2k (see [28] and [26, Sect. 4.1] for a more detailed discussion). It raises the following question:

### Question 56

Find an explicit bijection between Dyck multipaths and multitriangulations.

Our interpretation of multitriangulations in terms of pseudoline arrangements naturally associates to a k-triangulation of the n-gon a set of n−2k lattice paths as follows. Let T be a k-triangulation of the n-gon. For each edge (u,v) of T (with u<v), we place a mirror at the grid point of coordinates (u,v). This mirror is a double faced mirror parallel to the diagonal x=y so that it reflects a ray coming from (−∞,v) to a ray going to (u,+∞), and a ray coming from (u,−∞) to a ray going to (+∞,v). Furthermore, for 1≤in−2k, we place a light beam at (−∞,k−1+i) pointing horizontally. We obtain n−2k beams which reflect on the mirrors of T (see Fig. 40).
The results of this paper imply the following properties:
1. (i)

All beams are x- and y-monotone lattice paths.

2. (ii)

The ith beam comes from the direction (−∞,k−1+i) and goes to the direction (k−1+i,+∞).

3. (iii)

Each beam reflects exactly 2k+1 times, and thus, has k vertical segments (plus one vertical half-line) and k horizontal segments (plus one horizontal half-line).

4. (iv)

The beams form a pseudoline arrangement: any two of them cross exactly once.

The ith beam B i “corresponds” via duality to the k-star S i of T whose (k+1)th vertex is the vertex k−1+i (in other words, the k-star bisected by the line passing through the vertex k−1+i and through the midpoint of [0,n−1]). Indeed:
1. (i)

the beam B i is (by duality) the set of all bisectors of S i ;

2. (ii)

the mirrors which reflect B i are the edges of S i ; and

3. (iii)

the intersection of two beams B i and B j is the common bisector of S i and S j .

Observe that instead of k Dyck paths of semi-length n−2k, the beam arrangement of a k-triangulation has n−2k beams which all have k horizontal steps.

### Remark 57

In their recent paper [40], Serrano and Stump also observe the correspondence between multitriangulations and beam arrangements (called “reduced pipe dream” in their paper). Starting from this correspondence, they provide an explicit bijection between multitriangulations and Dyck multipaths. We refer to [38, 40, 43] and the references therein.

Another interesting question concerning the number of multipseudotriangulations would be to determine what point sets give the maximum and minimum number of multipseudotriangulations. For example, when k=1, every point set in general position has at least as many pointed pseudotriangulations as the convex polygon with the same number of points [1].

### Question 58

What point sets have the maximum and minimum number of multipseudotriangulations?

### Decomposition of a k-Pseudotriangulation

We have seen in Sect. 5 that certain multipseudotriangulations can be decomposed into iterated multipseudotriangulations. Remember, however, that there exist irreducible multipseudotriangulations (Example 35).

### Question 59

Characterize (completely) decomposable multipseudotriangulations.

The same question can be asked in a more algorithmical flavor:

### Question 60

How can we decide algorithmically whether a k-pseudotriangulation is decomposable?

Obviously, a brute-force algorithm is not considered as a good solution. A good way to test efficiency of the answers to Questions 59 and 60 would be to prove/disprove that Example 35 is the minimal irreducible 2-triangulation (or, in other words, that any 2-triangulation of an n-gon, with n≤14, contains a triangulation).

Remember also that when a multipseudotriangulation is decomposable, the graph of partial flips is not necessarily connected. In particular, finding all decompositions of a multipseudotriangulation cannot be achieved just by searching in the graph of partial flips.

### Question 61

How can we enumerate all the decompositions of a multipseudotriangulation?

### Computing a k-Pseudotriangulation

An initial pseudotriangulation of a set of n points can be computed in O(nlnn) time, using only the predicate of the chirotope. A similar result would be interesting for k-pseudotriangulations:

### Question 62

Compute an initial k-pseudotriangulation of a given (double) pseudoline arrangement, using only its chirotope.

## Notes

### Acknowledgements

We thank Francisco Santos for fruitful discussions on the subject (especially for pointing out to us the counter-example of Fig. 22). During his visit at the École Normale Supérieure, Micha Sharir contributed a lot to the improvement of the paper. We thank Jakob Jonsson for pointed out an error in a previous formulation of Lemma 47. Finally, we are grateful to an anonymous reviewer for valuable feedback on the presentation of a preliminary version of this paper.

VP was partially supported by grant MTM2008-04699-C03-02 and MTM2011-22792 of the spanish Ministerio de Ciencia e Innovación, and by European Research Project ExploreMaps (ERC StG 208471). MP was partially supported by the TEOMATRO grant ANR-10-BLAN 0207.

## References

1. 1.
Aichholzer, O., Aurenhammer, F., Krasser, H., Speckmann, B.: Convexity minimizes pseudo-triangulations. Comput. Geom. 28(1), 3–10 (2004)
2. 2.
Aichholzer, O., Orden, D., Santos, F., Speckmann, B.: On the number of pseudo-triangulations of certain point sets. J. Comb. Theory, Ser. A 115(2), 254–278 (2008)
3. 3.
Angelier, P., Pocchiola, M.: A sum of squares theorem for visibility complexes and applications. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete and Computational Geometry, the Goodman-Pollack Festschrift. Algorithms Combin., vol. 25, pp. 79–139. Springer, Berlin (2003) Google Scholar
4. 4.
Bereg, S.: Transforming pseudo-triangulations. Inf. Process. Lett. 90(3), 141–145 (2004)
5. 5.
Bereg, S.: Enumerating pseudo-triangulations in the plane. Comput. Geom. 30(3), 207–222 (2005)
6. 6.
Björner, A., Las Vergnas, M., Sturmfels, B., White, N., Ziegler, G.M.: Oriented Matroids, 2nd edn. Encyclopedia of Mathematics and Its Applications, vol. 46. Cambridge University Press, Cambridge (1999)
7. 7.
Brönnimann, H., Kettner, L., Pocchiola, M., Snoeyink, J.: Counting and enumerating pointed pseudotriangulations with the greedy flip algorithm. SIAM J. Comput. 36(3), 721–739 (2006)
8. 8.
Bokowski, J., Pilaud, V.: On symmetric realizations of the simplicial complex of 3-crossing-free sets of diagonals of the octagon. In: Proc. 25th Canadian Conference on Computational Geometry (2009) Google Scholar
9. 9.
Capoyleas, V., Pach, J.: A Turán-type theorem on chords of a convex polygon. J. Comb. Theory, Ser. A 56(1), 9–15 (1992)
10. 10.
de Bruijn, N.G.: Sorting by means of swappings. Discrete Math. 9, 333–339 (1974)
11. 11.
Dress, A.W.M., Klucznik, M., Koolen, J.H., Moulton, V.: Open image in new window: note on extremal combinatorics of cyclic split systems. Sém. Lothar. Combin. 47, Article B47b (2001), 17 pp. (electronic) Google Scholar
12. 12.
Dress, A.W.M., Koolen, J.H., Moulton, V.: On line arrangements in the hyperbolic plane. Eur. J. Comb. 23(5), 549–557 (2002)
13. 13.
Goodman, J.E.: Pseudoline arrangements. In: Handbook of Discrete and Computational Geometry. CRC Press Ser. Discrete Math. Appl., pp. 83–109. CRC, Boca Raton (1997) Google Scholar
14. 14.
Grünbaum, B.: Arrangements and Spreads. Conference Board of the Mathematical Sciences Regional Conference Series in Mathematics, vol. 10. American Mathematical Society, Providence (1972)
15. 15.
Haas, R., Orden, D., Rote, G., Santos, F., Servatius, B., Servatius, H., Souvaine, D., Streinu, I., Whiteley, W.: Planar minimally rigid graphs and pseudo-triangulations. Comput. Geom. 31(1–2), 31–61 (2005)
16. 16.
Habert, L., Pocchiola, M.: Computing pseudotriangulations via branched coverings. Preprint, arXiv:1102.0151. Abbreviated partial version in 20th European Workshop on Comput. Geom. (Seville, 2004), pp. 111–114 (2007)
17. 17.
Habert, L., Pocchiola, M.: Arrangements of double pseudolines. Preprint, arXiv:1101.1022. Abbreviated version in 25th Annual ACM Symposium on Comput. Geom. (Aahrus, 2009), pp. 314–323 (2009)
18. 18.
Hohlweg, C., Lange, C.E.M.C.: Realizations of the associahedron and cyclohedron. Discrete Comput. Geom. 37(4), 517–543 (2007)
19. 19.
Jonsson, J.: Generalized triangulations of the n-gon. Unpublished manuscript. An abstract was included in Topological and Geometric Combinatorics, April 2003, Mathematisches Forschungsinstitut Oberwolfach, Report No. 16 (2003) Google Scholar
20. 20.
Jonsson, J.: Generalized triangulations and diagonal-free subsets of stack polyominoes. J. Comb. Theory, Ser. A 112(1), 117–142 (2005)
21. 21.
Kettner, L., Kirkpatrick, D., Mantler, A., Snoeyink, J., Speckmann, B., Takeuchi, F.: Tight degree bounds for pseudo-triangulations of points. Comput. Geom. 25, 3–12 (2003)
22. 22.
Knutson, A., Miller, E.: Subword complexes in Coxeter groups. Adv. Math. 184(1), 161–176 (2004)
23. 23.
Knuth, D.E.: The Art of Computer Programming, vol. 3. Addison-Wesley, Reading (1973). Sorting and Searching, Addison-Wesley Series in Computer Science and Information Processing Google Scholar
24. 24.
Knuth, D.E.: Axioms and Hulls. Lecture Notes in Computer Science, vol. 606. Springer, Berlin (1992)
25. 25.
Nakamigawa, T.: A generalization of diagonal flips in a convex polygon. Theor. Comput. Sci. 235(2), 271–282 (2000)
26. 26.
Pilaud, V.: Multitriangulations, pseudotriangulations and some problems of realization of polytopes. Ph.D. thesis, Université Paris 7 & Universidad de Cantabria (2010) Google Scholar
27. 27.
Pilaud, V., Pocchiola, M.: Multipseudotriangulations. In: 25th European Workshop on Comput. Geom., Bruxelles (2009). Extended abstract Google Scholar
28. 28.
Pilaud, V., Santos, F.: Multitriangulations as complexes of star polygons. Discrete Comput. Geom. 41(2), 284–317 (2009)
29. 29.
Pilaud, V., Santos, F.: The brick polytope of a sorting network. Eur. J. Comb. 33(4), 632–662 (2012)
30. 30.
Pilaud, V., Stump, C.: Brick polytopes of spherical subword complexes: A new approach to generalized associahedra. Preprint, arXiv:1111.3349 (2011)
31. 31.
Pocchiola, M.: Horizon trees versus pseudo-triangulations. In: 13th European Workshop on Comput. Geom., Würzburg (1997) Google Scholar
32. 32.
Pocchiola, M., Vegter, G.: Order types and visibility types of configurations of disjoint convex plane sets. Technical report, LIENS, Paris (1994) Google Scholar
33. 33.
Pocchiola, M., Vegter, G.: Pseudo-triangulations: theory and applications. In: 12th Annual ACM Symposium on Comput. Geom., Philadelphia, pp. 291–300 (1996) Google Scholar
34. 34.
Pocchiola, M., Vegter, G.: Topologically sweeping visibility complexes via pseudotriangulations. Discrete Comput. Geom. 16(4), 419–453 (1996)
35. 35.
Pocchiola, M., Vegter, G.: The visibility complex. Int. J. Comput. Geom. Appl. 6(3), 279–308 (1996)
36. 36.
Rote, G., Santos, F., Streinu, I.: Expansive motions and the polytope of pointed pseudo-triangulations. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete and Computational Geometry, The Goodman-Pollack Festschrift. Algorithms Combin., vol. 25, pp. 699–736. Springer, Berlin (2003)
37. 37.
Rote, G., Santos, F., Streinu, I.: Pseudo-triangulations—a survey. In: Surveys on Discrete and Computational Geometry. Contemp. Math., vol. 453, pp. 343–410. Am. Math. Soc., Providence (2008)
38. 38.
Rubey, M.: Maximal 0–1 fillings of moon polyominoes with restricted chain-lengths and RC-graphs. Preprint, arXiv:1009.3919 (2010)
39. 39.
Salzmann, H., Betten, D., Grundhöfer, T., Hähl, H., Löwen, R., Stroppel, M.: Compact Projective Planes. de Gruyter Expositions in Mathematics, vol. 21. de Gruyter, Berlin (1995)
40. 40.
Serrano, L., Stump, C.: Maximal fillings of moon polyominoes, simplicial complexes, and Schubert polynomials. Electron. J. Comb. 19 (2012) Google Scholar
41. 41.
Sleator, D.D., Tarjan, R.E., Thurston, W.P.: Rotation distance, triangulations, and hyperbolic geometry. J. Am. Math. Soc. 1(3), 647–681 (1988)
42. 42.
Streinu, I.: Pseudo-triangulations, rigidity and motion planning. Discrete Comput. Geom. 34(4), 587–635 (2005)
43. 43.
Stump, C.: A new perspective on k-triangulations. J. Comb. Theory, Ser. A 118(6), 1794–1800 (2011)
44. 44.
Welzl, E.: Entering and leaving j-facets. Discrete Comput. Geom. 25(3), 351–364 (2001)