Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
30
click to vote
DMCCG
2001
Springer
favorite
Email
discuss
report
113
views
Combinatorics
»
more
DMCCG 2001
»
Enumerating Triangulations of Convex Polytopes
14 years 3 months ago
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
more »
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)
Researcher Info
Combinatorics Study Group
Computer Vision