Back to Results
First PageMeta Content
Archimedean solids / Platonic solids / Uniform polyhedra / Polyhedra / Polytopes / Binary decision diagram / Polyhedron / Icosahedron / Octahedron / Geometry / Convex geometry / Euclidean geometry


CCCG 2011, Toronto ON, August 10–12, 2011 Edge Unfoldings of Platonic Solids Never Overlap Takashi Horiyama∗ Wataru Shoji∗
Add to Reading List

Document Date: 2011-08-06 04:11:13


Open Document

File Size: 1,55 MB

Share Result on Facebook

City

Baltimore / /

Company

Cambridge University Press / Intel / /

Continent

America / /

/

Facility

University of Maryland / Johns Hopkins University / University of Tokyo / Saitama University / /

IndustryTerm

manipulation algorithms / enumeration algorithms / /

OperatingSystem

Ubuntu / /

Organization

University of Tokyo / Cambridge University / Graduate School / Johns Hopkins University / University of Maryland / Department of Computer Science / Saitama University / /

/

Position

salesman / painter and a mathematician / /

ProvinceOrState

Maryland / /

Technology

3 Algorithms / 0.01 384 0.01 384 0.01 5 / 184 / 000 0.01 5 / 184 / 000 0.02 Algorithm / Geometric Folding Algorithms / manipulation algorithms / Graph-based algorithms / enumeration algorithms / Tetrahedron Cube Octahedron Dodecahedron Icosahedron Algorithm / two algorithms / /

URL

http /

SocialTag