Representing Polyhedra: Faces Are Better than Vertices

Simple item page
dc.contributor.authorHeath, Lenwood S.en
dc.contributor.authorParipati, Praveen K.en
dc.contributor.authorRoach, John W.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:20Zen
dc.date.available2013-06-19T14:36:20Zen
dc.date.issued1992en
dc.description.abstractIn this paper, we investigate the reconstruction of planar-faced polyhedra given their spherical dual representation. We prove that the spherical dual representation is unambiguous for all genus 0 polyhedra and that a genus 0 polyhedron can be uniquely reconstructed in polynomial time. We also prove that when the degree of spherical dual representation is at most four, the representation is unambiguous for polyhedra of any genus.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000300/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000300/01/TR-92-20.pdfen
dc.identifier.trnumberTR-92-20en
dc.identifier.urihttp://hdl.handle.net/10919/19678en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleRepresenting Polyhedra: Faces Are Better than Verticesen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-92-20.pdf
Size:
1.87 MB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports