English
Related papers

Related papers: Geometric bistellar flips. The setting, the contex…

200 papers

A geometric triangulation of a Riemannian manifold is a triangulation where the interior of each simplex is totally geodesic. Bistellar moves are local changes to the triangulation which are higher dimensional versions of the flip operation…

Geometric Topology · Mathematics 2020-07-01 Tejas Kalelkar , Advait Phanse

We investigate the combinatorics of quivers that arise from triangulations of even-dimensional cyclic polytopes. Work of Oppermann and Thomas pinpoints such quivers as the prototypes for higher-dimensional cluster theory. We first show that…

Combinatorics · Mathematics 2021-12-23 Nicholas J. Williams

The secondary polytope of a point configuration A is a polytope whose face poset is isomorphic to the poset of all regular subdivisions of A. While the vertices of the secondary polytope - corresponding to the triangulations of A - are very…

Combinatorics · Mathematics 2014-12-23 Sven Herrmann

We study the problem of reconfiguring odd matchings, that is, matchings that cover all but a single vertex. Our reconfiguration operation is a so-called flip where the unmatched vertex of the first matching gets matched, while consequently…

Computational Geometry · Computer Science 2025-08-27 Oswin Aichholzer , Sofia Brenner , Joseph Dorfer , Hung P. Hoang , Daniel Perz , Christian Rieck , Francesco Verciani

For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…

Combinatorics · Mathematics 2007-05-23 David Orden , Francisco Santos

We construct small (50 and 26 points, respectively) point sets in dimension 5 whose graphs of triangulations are not connected. These examples improve our construction in J. Amer. Math. Soc., 13:3 (2000), 611--637 not only in size, but also…

Combinatorics · Mathematics 2007-05-23 Francisco Santos

We consider whether any two triangulations of a polygon or a point set on a non-planar surface with a given metric can be transformed into each other by a sequence of edge flips. The answer is negative in general with some remarkable…

Metric Geometry · Mathematics 2010-08-02 C. Cortes , C. I. Grima , F. Hurtado , A. Marquez , F. Santos , J. Valenzuela

A key result in computational 3-manifold topology is that any two triangulations of the same 3-manifold are connected by a finite sequence of bistellar flips, also known as Pachner moves. One limitation of this result is that little is…

Geometric Topology · Mathematics 2025-10-10 Benjamin A. Burton , Alexander He

Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…

A mostly expository account of old questions about the relationship between polyhedra and topological manifolds. Topics are old topological results, new gauge theory results (with speculations about next directions), and history of the…

Geometric Topology · Mathematics 2013-11-13 Frank Quinn

This work regards the order polytopes arising from the class of generalized snake posets and their posets of meet-irreducible elements. Among generalized snake posets of the same rank, we characterize those whose order polytopes have…

We prove that for a given flat surface with conical singularities, any pair of geometric triangulations can be connected by a chain of flips.

Geometric Topology · Mathematics 2019-07-03 Guillaume Tahar

Given two triangulations of a convex polygon, computing the minimum number of flips required to transform one to the other is a long-standing open problem. It is not known whether the problem is in P or NP-complete. We prove that two…

Computational Geometry · Computer Science 2012-05-14 Anna Lubiw , Vinayak Pathak

This work presents the tessellations and polytopes from the perspective of both n-dimensional geometry and abstract symmetry groups. It starts with a brief introduction to the terminology and a short motivation. In the first part, it…

Group Theory · Mathematics 2023-01-06 Plamen Dimitrov

We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include convex subsets of…

Computational Geometry · Computer Science 2016-08-12 David Eppstein

The "Perpendicular Bisectors Construction" is a natural way to seek a replacement for the circumcenter of a noncyclic quadrilateral in the plane. In this paper, we generalize this iterative construction to a construction on polytopes with…

Metric Geometry · Mathematics 2012-03-30 Emmanuel Tsukerman

The triangulations of point configurations which decompose as a free sum are classified in terms of the triangulations of the summands. The methods employ two new kinds of partially ordered sets to be associated with any triangulation of a…

Combinatorics · Mathematics 2018-10-30 Benjamin Assarf , Michael Joswig , Julian Pfeifle

We explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once-punctured polygons which, in turn, contain all possible geometric flip-graphs of…

Combinatorics · Mathematics 2018-09-10 Hugo Parlier , Lionel Pournin

With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…

Combinatorics · Mathematics 2024-04-10 Jonas Frede , Volker Kaibel , Maximilian Merkert

We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a…

Computational Geometry · Computer Science 2019-12-11 Vincent Despré , Jean-Marc Schlenker , Monique Teillaud
‹ Prev 1 2 3 10 Next ›