Uniform decompositions of polytopes

Daniel Berend; Luba Bromberg

The search session has expired. Please query the service again.

Displaying similar documents to “Uniform decompositions of polytopes”

Approximation of the Euclidean ball by polytopes

Monika Ludwig, Carsten Schütt, Elisabeth Werner (2006)

Studia Mathematica

Similarity:

There is a constant c such that for every n ∈ ℕ, there is an Nₙ so that for every N≥ Nₙ there is a polytope P in ℝⁿ with N vertices and $v o l ₙ (B ₂ ⁿ △ P) \leq c v o l ₙ (B ₂ ⁿ) N^{- 2 / (n - 1)}$ where B₂ⁿ denotes the Euclidean unit ball of dimension n.

Delaunay polytopes derived from the Leech lattice

Mathieu Dutour Sikirić, Konstantin Rybnikov (2014)

Journal de Théorie des Nombres de Bordeaux

Similarity:

A Delaunay polytope in a lattice $L$ is perfect if any affine transformation that preserve its Delaunay property is a composite of an homothety and an isometry. Perfect Delaunay polytopes are rare in low dimension and here we consider the ones that one can get in lattice that are sections of the Leech lattice. By doing so we are able to find lattices with several orbits of perfect Delaunay polytopes. Also we exhibit Delaunay polytopes which remain Delaunay in some superlattices....

Flexible cross-polytopes in the Euclidean 4-space.

Stachel, Hellmuth (2000)

Journal for Geometry and Graphics

Similarity:

Exterior Algebra and Projections of Polytopes.

P. Filliman (1990)

Discrete & computational geometry

Similarity:

Separation in the polytope algebra.

McMullen, Peter (1993)

Beiträge zur Algebra und Geometrie

Similarity:

Two Poset Polytopes.

R.P. Stanley (1986)

Discrete & computational geometry

Similarity:

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

Birkett Huber, Jörg Rambau, Francisco Santos (2000)

Journal of the European Mathematical Society

Similarity:

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 Minkowski sum $𝒜_{1} + \dots + 𝒜_{r}$ of point configurations and of coherent polyhedral subdivisions of the associated Cayley embedding $𝒞 (𝒜_{1}, \dots, 𝒜_{r})$ . In this paper we extend this correspondence in a natural way to cover also non-coherent subdivisions. As an application, we show that the Cayley Trick combined with results of Santos...

A purely combinatorial proof of the Hadwiger Debrunner $(p, q)$ conjecture.

Alon, N., Kleitman, D.J. (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The Mayer-Vietoris and IC Equations for Convex Polytopes.

J. Fine (1995)

Discrete & computational geometry

Similarity:

A Note on Small Linear-Ordering Polytopes.

G. Reinelt (1993)

Discrete & computational geometry

Similarity:

Flag vectors of multiplicial polytopes.

Bayer, Margaret M. (2004)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Rigidity and flexibility of virtual polytopes

G. Panina (2003)

Open Mathematics

Similarity:

All 3-dimensional convex polytopes are known to be rigid. Still their Minkowski differences (virtual polytopes) can be flexible with any finite freedom degree. We derive some sufficient rigidity conditions for virtual polytopes and present some examples of flexible ones. For example, Bricard's first and second flexible octahedra can be supplied by the structure of a virtual polytope.

Invertible Relations on Polytopes.

G.T. Sallee (1987)

Discrete & computational geometry

Similarity: