13 search results - page 2 / 3 » Enumerating Triangulations of Convex Polytopes |
DCG
2008
13 years 6 months ago
2008
We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that t...
ALENEX
2007
13 years 8 months ago
2007
In polyhedral studies of 0/1 polytopes two prominent problems exist. One is the vertex enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points. Anot...
SIAMDM
2011
13 years 1 months ago
2011
The convex hull of the roots of a classical root lattice is called a root polytope. We determine explicit unimodular triangulations of the boundaries of the root polytopes associat...
MOC
2010
13 years 1 months ago
2010
Abstract. Many key algorithms in 3-manifold topology involve the enumeration of normal surfaces, which is based upon the double description method for finding the vertices of a con...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...