2017-03-012017-03-012004Bereg, S. (2004). 3D realization of two triangulations of a onvex polygon. En 20th European Workshop on Computational Geometry, Sevilla.http://hdl.handle.net/11441/55053We study the problem of construction of a convex 3-polytope whose (i) shadow boundary has n vertices and (ii) two hulls, upper and lower, are isomorphic to two given triangulations of a convex n-gon. Barnette [℄ D. W. Barnette. Projections of 3-polytopes. Israel J. Math., 8:304{308, 1970] proved the existence of a convex 3-polytope in general case. We show that, in our case, a polytope can be constructed using an operation of edge creation.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/TriangulationConvex polytopeSteinitz theoreminfo:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/openAccess