Reconstructing Convex Polygons and Convex Polyhedra from Edge and Face Counts in Orthogonal Projections

We study the problem of reconstructing convex polygons and convex polyhedra given the number of visible edges and visible faces in some orthogonal projections. In 2D, we find necessary and sufficient conditions for the existence of a feasible polygon of size N and give an algorithm to construct one, if it exists. When N is not known, we give an algorithm to find the maximum and minimum sizes of a feasible polygon. In 3D, when the directions are covered by a single plane we show that a feasible polyhedron can be constructed from a feasible polygon. We also give an algorithm to construct a feasible polyhedron when the directions are covered by two planes. Finally, we show that the problem becomes NP-hard when the directions are covered by three or more planes.

[1]  W. Wang,et al.  A Survey of 3D Solid Reconstruction from 2D Projection Line Drawings , 1993, Comput. Graph. Forum.

[2]  Michael A. Penna,et al.  A Shape From Shading Analysis for a Single Perspective Image of a Polyhedron , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Kokichi Sugihara,et al.  A Necessary and Sufficient Condition for a Picture to Represent a Polyhedral Scene , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  George Markowsky,et al.  Fleshing Out Wire Frames , 1980, IBM J. Res. Dev..

[5]  Robin Thomas,et al.  AN UPDATE ON THE FOUR-COLOR THEOREM , 1998 .

[6]  J. Thomas.  The four color theorem , 1977 .

[7]  George Markowsky,et al.  Fleshing out projections , 1981 .

[8]  Aldo Laurentini,et al.  How Many 2D Silhouettes Does It Take to Reconstruct a 3D Object? , 1997, Comput. Vis. Image Underst..

[9]  Hod Lipson,et al.  Optimization-based reconstruction of a 3D object from a single freehand line drawing , 1996, Comput. Aided Des..

[10]  Luc Jaulin,et al.  Reconstructing 3D Objects from Silhouettes with Unknown Viewpoints: The Case of Planar Orthographic Views , 2003, CIARP.

[11]  Andrea Bottino,et al.  Introducing a New Problem: Shape-from-Silhouette when the Relative Positions of the Viewpoints is Unknown , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Zesheng Tang,et al.  Efficient algorithm for the reconstruction of 3D objects from orthographic projections , 1994, Comput. Aided Des..

[13]  K. Sugihara.  Machine interpretation of line drawings , 1986, MIT Press series in artificial intelligence.

[14]  Hod Lipson,et al.  Optimization-based reconstruction of a 3D object from a single freehand line drawing , 1996, Comput. Aided Des..

[15]  R. Gardner.  Geometric Tomography: Parallel X-rays of planar convex bodies , 2006 .

[16]  Masud Hasan.  Reconstruction and visualization of polyhedra using projections , 2005 .

[17]  Uday G. Gujar,et al.  3-D objects from 2-D orthographic views--A survey , 1988, Comput. Graph..

[18]  Goos Kant,et al.  On Triangulating Planar Graphs under the Four-Connectivity Constraint , 1994, Algorithmica.

[19]  Goos Kant,et al.  On Triangulating Planar Graphs under the Four-Connectivity Constraint , 1994, SWAT.

[20]  Robin Thomas,et al.  The Four-Colour Theorem , 1997, J. Comb. Theory, Ser. B.

[21]  Peter Ashley Clifford Varley,et al.  Automatic creation of boundary-representation models from single line drawings , 2003 .

[23]  G. Herman,et al.  Advances in discrete tomography and its applications , 2007 .

[24]  Sergey Bereg.  3D realization of two triangulations of a onvex polygon , 2004 .

[25]  Ramesh Raskar,et al.  Image-based visual hulls , 2000, SIGGRAPH.

[26]  Godfried T. Toussaint,et al.  Constructing convex 3-polytopes from two triangulations of a polygon , 2002, Comput. Geom..