Sciweavers

13 search results - page 1 / 3
» Enumerating Triangulations of Convex Polytopes
Sort
View
DMCCG
2001
Springer
113views Combinatorics» more  DMCCG 2001»
13 years 11 months ago
Enumerating Triangulations of Convex Polytopes
Sergei Bespamyatnikh
DCG
2007
125views more  DCG 2007»
13 years 6 months ago
Alcoved Polytopes, I
The aim of this paper is to initiate the study of alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many clas...
Thomas Lam, Alexander Postnikov
DCG
2000
55views more  DCG 2000»
13 years 6 months ago
Minimal Simplicial Dissections and Triangulations of Convex 3-Polytopes
This paper addresses three questions related to minimal triangulations of a 3-dimensional convex polytope P.
Alexander Below, Jesús A. De Loera, Jü...
DM
2011
191views Education» more  DM 2011»
13 years 1 months ago
Notes on lattice points of zonotopes and lattice-face polytopes
Minkowski’s second theorem on successive minima gives an upper bound on the volume of a convex body in terms of its successive minima. We study the problem to generalize Minkowsk...
Christian Bey, Martin Henk, Matthias Henze, Eva Li...
COMPGEOM
1995
ACM
13 years 10 months ago
How Good are Convex Hull Algorithms?
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
David Avis, David Bremner