Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

DMCCG
2001
Springer

favoriteEmaildiscussreport

113views Combinatorics» more DMCCG 2001»

Enumerating Triangulations of Convex Polytopes

13 years 10 months ago

Enumerating Triangulations of Convex Polytopes

Download www.emis.de

Sergei Bespamyatnikh

Real-time Traffic

Combinatorics | DMCCG 2001 |

claim paper

Related Content

» Alcoved Polytopes I

» Minimal Simplicial Dissections and Triangulations of Convex 3Polytopes

» Notes on lattice points of zonotopes and latticeface polytopes

» How Good are Convex Hull Algorithms

» Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres

» 01 Vertex and Facet Enumeration with BDDs

» Root Polytopes and Growth Series of Root Lattices

» Optimizing the double description method for normal surface enumeration

» Sublinear geometric algorithms

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	DMCCG
Authors	Sergei Bespamyatnikh

Comments (0)