Multitriangulations, pseudotriangulations and primitive sorting networks
From MaRDI portal
Publication:443914
DOI10.1007/s00454-012-9408-6zbMath1247.52012arXiv1009.5344OpenAlexW1784352241MaRDI QIDQ443914
Michel Pocchiola, Vincent Pilaud
Publication date: 13 August 2012
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.5344
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)
Related Items (25)
Brick manifolds and toric varieties of brick polytopes ⋮ Pipe Dream Complexes and Triangulations of Root Polytopes Belong Together ⋮ Subword complexes via triangulations of root polytopes ⋮ A Hopf algebra of subword complexes ⋮ Brick polytopes, lattice quotients, and Hopf algebras ⋮ \(\nu\)-Tamari lattices via subword complexes ⋮ The brick polytope of a sorting network ⋮ Celebrating Loday's associahedron ⋮ Hopf dreams and diagonal harmonics ⋮ Cluster algebras of type \(D\): pseudotriangulations approach ⋮ Subword complexes, cluster complexes, and generalized multi-associahedra ⋮ The diameter of type \(D\) associahedra and the non-leaving-face property ⋮ Fan Realizations for Some 2-Associahedra ⋮ Cambrian acyclic domains: counting \(c\)-singletons ⋮ Computing pseudotriangulations via branched coverings ⋮ Associahedra via spines ⋮ The \(\nu \)-Tamari lattice via \(\nu \)-trees, \( \nu \)-bracket vectors, and subword complexes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hopf dreams ⋮ Toric matrix Schubert varieties and their polytopes ⋮ Denominator vectors and compatibility degrees in cluster algebras of finite type ⋮ Vertex barycenter of generalized associahedra ⋮ Brick polytopes of spherical subword complexes and generalized associahedra ⋮ Fan realizations of type \(A\) subword complexes and multi-associahedra of rank 3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The brick polytope of a sorting network
- Maximal fillings of Moon polyominoes, simplicial complexes, and Schubert polynomials
- A new perspective on \(k\)-triangulations
- Convexity minimizes pseudo-triangulations
- Computing pseudotriangulations via branched coverings
- Multitriangulations as complexes of star polygons
- Axioms and hulls
- A Turán-type theorem on chords of a convex polygon
- Planar minimally rigid graphs and pseudo-triangulations
- Enumerating pseudo-triangulations in the plane
- Topologically sweeping visibility complexes via pseudotriangulations
- Subword complexes in Coxeter groups.
- Sorting by means of swappings
- On line arrangements in the hyperbolic plane
- Tight degree bounds for pseudo-triangulations of points
- A generalization of diagonal flips in a convex polygon
- Brick polytopes of spherical subword complexes and generalized associahedra
- Realizations of the associahedron and cyclohedron
- Transforming pseudo-triangulations
- On the number of pseudo-triangulations of certain point sets
- Generalized triangulations and diagonal-free subsets of stack polyominoes
- Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Oriented Matroids
- Arrangements of double pseudolines
- THE VISIBILITY COMPLEX
- Acute triangulations of polygons
- Entering and leaving \(j\)-facets
- \(2kn-\binom{2k+1}{2}\). A note on extremal combinatorics of cyclic split systems
This page was built for publication: Multitriangulations, pseudotriangulations and primitive sorting networks
