Mostrar el registro sencillo del ítem
Ponencia
3D realization of two triangulations of a onvex polygon
dc.creator | Bereg, Sergey | es |
dc.date.accessioned | 2017-03-01T13:10:32Z | |
dc.date.available | 2017-03-01T13:10:32Z | |
dc.date.issued | 2004 | |
dc.identifier.citation | Bereg, S. (2004). 3D realization of two triangulations of a onvex polygon. En 20th European Workshop on Computational Geometry, Sevilla. | |
dc.identifier.uri | http://hdl.handle.net/11441/55053 | |
dc.description.abstract | We 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. | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.relation.ispartof | 20th European Workshop on Computational Geometry (2004). | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Triangulation | es |
dc.subject | Convex polytope | es |
dc.subject | Steinitz theorem | es |
dc.title | 3D realization of two triangulations of a onvex polygon | es |
dc.type | info:eu-repo/semantics/conferenceObject | es |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
idus.format.extent | 4 p. | es |
dc.eventtitle | 20th European Workshop on Computational Geometry | es |
dc.eventinstitution | Sevilla | es |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
3D realization of two triangul ... | 165.7Kb | [PDF] | Ver/ | |