Skip to search formSkip to main contentSkip to account menu

Triangulations: Structures for Algorithms and Applications

Triangulations appear everywhere, from volume computations and meshing to algebra and topology. This book studies the subdivisions and triangulations of polyhedral regions and point sets and presents…
View via Publisher (opens in a new tab)

A counterexample to the Hirsch conjecture

TLDR
This paper presents the rst counterexample to the Hirsch Conjecture, obtained from a 5-dimensional polytope with 48 facets that violates a certain generalization of the d-step conjecture of Klee and Walkup.
View PDF on arXiv (opens in a new tab)

Higher Lawrence configurations

View PDF on arXiv (opens in a new tab)

Expansive Motions and the Polytope of Pointed Pseudo-Triangulations

We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the…
View PDF on arXiv (opens in a new tab)

The Polytope of All Triangulations of a Point Configuration

We study the convex hull P A of the 0-1 incidence vectors of all triangulations of a point con guration A. This was called the universal polytope in [4]. The a ne span of P A is described in terms of…

Pseudo-Triangulations - a Survey

A pseudo-triangle is a simple polygon with three convex vertices, and a pseudo-triangulation is a face-to-face tiling of a planar region into pseudo-triangles. Pseudo-triangulations appear as data…
View PDF on arXiv (opens in a new tab)

The Cayley Trick, lifting subdivisions and the Bohne-Dress theorem on zonotopal tilings

Abstract.In 1994, Sturmfels gave a polyhedral version of the Cayley Trick of elimination theory: he established an order-preserving bijection between the posets of coherent mixed subdivisions of a…
View on Springer (opens in a new tab)

Triangulations of oriented matroids

Introduction Preliminaries on oriented matroids Triangulations of oriented matroids Duality between triangulations and extensions Subdivisions of Lawrence polytopes Lifting triangulations…
View via Publisher (opens in a new tab)

Asymptotically Efficient Triangulations of the d-Cube

TLDR
The method has a computational part, where it is shown how to triangulate the product P \times Q efficiently (i.e., with few simplices) starting with a given triangulation of $Q$.
View on Springer (opens in a new tab)

Planar minimally rigid graphs and pseudo-triangulations

TLDR
This paper proves that planar minimally rigid graphs always admit pointed embeddings, even under certain natural topological and combinatorial constraints, and provides the first algorithmically effective result on graph embeddeddings with oriented matroid constraints other than convexity of faces.
View on ACM (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)