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
25
click to vote
CCCG
2008
favorite
Email
discuss
report
118
views
Computational Geometry
»
more
CCCG 2008
»
A Class of Convex Polyhedra with Few Edge Unfoldings
14 years 10 days ago
Download
cccg.ca
We construct a sequence of convex polyhedra on n vertices with the property that, as n, the fraction of its edge unfoldings that avoid overlap approaches 0, and so the frac
Alex Benton, Joseph O'Rourke
Real-time Traffic
CCCG 2008
|
Computational Geometry
|
Convex Polyhedra
|
Edge Unfoldings
|
claim paper
Related Content
»
Local Overlaps In Special Unfoldings Of Convex Polyhedra
»
Unfolding Polyhedra via CutTree Truncation
»
Ununfoldable Polyhedra with Convex Faces
»
Unfolding Restricted Convex Caps
»
Common EdgeUnzippings for Tetrahedra
»
On the Fewest Nets Problem for Convex Polyhedra
»
On the infinitesimal rigidity of weakly convex polyhedra
»
On Unfolding Lattice PolygonsTrees and Diameter4 Trees
more »
Post Info
More Details (n/a)
Added
29 Oct 2010
Updated
29 Oct 2010
Type
Conference
Year
2008
Where
CCCG
Authors
Alex Benton, Joseph O'Rourke
Comments
(0)
Researcher Info
Computational Geometry Study Group
Computer Vision