Name
Abstract | ||
|---|---|---|
A polyhedron (3-dimensional polytope) is defined as a tessellation polyhedron if it possesses a net of which congruent copies can be used to tile the plane. In this paper we determine all convex polyhedra with regular polygonal faces which are tessellation polyhedra. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-24983-9_1 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
3-dimensional polytope,tessellation polyhedron,regular polygonal face,congruent copy,convex polyhedron | Discrete mathematics,Semiregular polyhedron,Combinatorics,Net (polyhedron),Dual polyhedron,Regular polyhedron,Polyhedron,Tetradecahedron,Spherical polyhedron,Mathematics,Isotoxal figure | Conference |
Volume | ISSN | Citations |
7033 | 0302-9743 | 3 |
PageRank | References | Authors |
0.61 | 1 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jin Akiyama | 1 | 3 | 1.29 |
| Takayasu Kuwata | 2 | 4 | 1.47 |
| Stefan Langerman | 3 | 831 | 101.66 |
| Kenji Okawa | 4 | 3 | 0.61 |
| Ikuro Sato | 5 | 25 | 6.46 |
| Geoffrey C. Shephard | 6 | 6 | 1.64 |