Which convex 3D polyhedra can be obtained by gluing several regular hexagons edge-to-edge? It turns out that there are only 15 possible types of shapes, 5 of which are doubly-covered 2D polygons. We give examples for most of them, including all simplicial and all flat shapes, and give a characterization for the latter ones. It is open whether the remaining can be realized.SCOPUS: ar.jinfo:eu-repo/semantics/publishe
AbstractWe introduce a notion of k-convexity and explore polygons in the plane that have this proper...
The structure of the set of all convex polyhedra foldable from a square is detailed. It is proved th...
It is a common conjecture that all convex polyhedra must be edge-unfoldable but to date a valid proo...
We give a complete description of all convex polyhedra whose surface can be constructed from several...
This paper proposes a presentation unfolding regular and semi-regular polyhedra. Regular polyhedra a...
AbstractThe best-known developments of a regular tetrahedron are an equilateral triangle and a paral...
An infinite series of twofold, two-way weavings of the cube, corresponding to 'wrappings', or double...
It is known that one can fold a convex polyhedron from a non-overlapping face unfolding, but the com...
AbstractUnfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In thi...
An unfolding of a polyhedron is a cutting along its surface such that the surface remains connected ...
The main topic of my research is my discovery of a new series of uniform polyhedra, which I have nam...
We address ourselves to three types of combinatorial and projective problems, all of which concern ...
A folding of a simple polygon into a convex polyhedron is accomplished by glueing portions of the pe...
The combinatorial, geometric, and topological structure of the set of all convex polyhedra foldable ...
Polyhedra are geometric solids formed by a finite number of polygons they can be convex or non...
AbstractWe introduce a notion of k-convexity and explore polygons in the plane that have this proper...
The structure of the set of all convex polyhedra foldable from a square is detailed. It is proved th...
It is a common conjecture that all convex polyhedra must be edge-unfoldable but to date a valid proo...
We give a complete description of all convex polyhedra whose surface can be constructed from several...
This paper proposes a presentation unfolding regular and semi-regular polyhedra. Regular polyhedra a...
AbstractThe best-known developments of a regular tetrahedron are an equilateral triangle and a paral...
An infinite series of twofold, two-way weavings of the cube, corresponding to 'wrappings', or double...
It is known that one can fold a convex polyhedron from a non-overlapping face unfolding, but the com...
AbstractUnfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In thi...
An unfolding of a polyhedron is a cutting along its surface such that the surface remains connected ...
The main topic of my research is my discovery of a new series of uniform polyhedra, which I have nam...
We address ourselves to three types of combinatorial and projective problems, all of which concern ...
A folding of a simple polygon into a convex polyhedron is accomplished by glueing portions of the pe...
The combinatorial, geometric, and topological structure of the set of all convex polyhedra foldable ...
Polyhedra are geometric solids formed by a finite number of polygons they can be convex or non...
AbstractWe introduce a notion of k-convexity and explore polygons in the plane that have this proper...
The structure of the set of all convex polyhedra foldable from a square is detailed. It is proved th...
It is a common conjecture that all convex polyhedra must be edge-unfoldable but to date a valid proo...