2010/09/12 by Masud Hasan, Hasan, Masud, Mohammad Monoar Hossain +9
Computer Science · #Computational Geometry (cs.CG) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #cs.CG #cs.DM
paper · pdf · doi:10.48550/arxiv.1009.2252
10 pages, 8 figures
arxiv created 2010/09/12 · arxiv updated 2010/09/14
A convex polyhedron P is k-equiprojective if all of its orthogonal projections, i.e., shadows, except those parallel to the faces of P are k-gon for some fixed value of k. Since 1968, it is an open problem to construct all equiprojective polyhedra. Recently, Hasan and Lubiw [CGTA 40(2):148-155, 2008] have given a characterization of equiprojective polyhedra. Based on their characterization, in this paper we discover some new equiprojective polyhedra by cutting and gluing existing polyhedra.