Cauchy's Theorem for Orthogonal Polyhedra of Genus 0
| dc.contributor.author | Biedl T. | |
| dc.contributor.author | Genç, Burkay | |
| dc.date.accessioned | 2023-06-16T14:58:01Z | |
| dc.date.available | 2023-06-16T14:58:01Z | |
| dc.date.issued | 2009 | |
| dc.description | 17th Annual European Symposium on Algorithms, ESA 2009 -- 7 September 2009 through 9 September 2009 -- Copenhagen -- 77841 | en_US |
| dc.description.abstract | A famous theorem by Cauchy states that the dihedral angles of a convex polyhedron are determined by the incidence structure and face-polygons alone. In this paper, we prove the same for orthogonal polyhedra of genus 0 as long as no face has a hole. Our proof yields a linear-time algorithm to find the dihedral angles. © 2009 Springer Berlin Heidelberg. | en_US |
| dc.identifier.doi | 10.1007/978-3-642-04128-0_7 | |
| dc.identifier.isbn | 3642041272 | |
| dc.identifier.isbn | 9783642041273 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.scopus | 2-s2.0-70350397057 | |
| dc.identifier.uri | https://doi.org/10.1007/978-3-642-04128-0_7 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14365/3398 | |
| dc.language.iso | en | en_US |
| dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Convex polyhedrons | en_US |
| dc.subject | Dihedral angles | en_US |
| dc.subject | Linear-time algorithms | en_US |
| dc.subject | Clustering algorithms | en_US |
| dc.subject | Radar antennas | en_US |
| dc.title | Cauchy's Theorem for Orthogonal Polyhedra of Genus 0 | en_US |
| dc.type | Conference Object | en_US |
| dspace.entity.type | Publication | |
| gdc.author.scopusid | 7004350208 | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C5 | |
| gdc.bip.popularityclass | C5 | |
| gdc.coar.access | open access | |
| gdc.coar.type | text::conference output | |
| gdc.collaboration.industrial | false | |
| gdc.description.departmenttemp | Biedl, T., David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON N2L 3G1, Canada; Genc, B., Faculty of Computer Science, Izmir University of Economics, Sakarya Cad. No:156, Balcova, Izmir, Turkey | en_US |
| gdc.description.endpage | 82 | en_US |
| gdc.description.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | Q3 | |
| gdc.description.startpage | 71 | en_US |
| gdc.description.volume | 5757 LNCS | en_US |
| gdc.description.wosquality | N/A | |
| gdc.identifier.openalex | W141947981 | |
| gdc.identifier.wos | WOS:000279102100007 | |
| gdc.index.type | WoS | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 1.0 | |
| gdc.oaire.influence | 2.6484406E-9 | |
| gdc.oaire.isgreen | false | |
| gdc.oaire.popularity | 1.949814E-9 | |
| gdc.oaire.publicfunded | false | |
| gdc.openalex.collaboration | International | |
| gdc.openalex.fwci | 2.0109 | |
| gdc.openalex.normalizedpercentile | 0.89 | |
| gdc.openalex.toppercent | TOP 10% | |
| gdc.opencitations.count | 3 | |
| gdc.plumx.crossrefcites | 1 | |
| gdc.plumx.scopuscites | 5 | |
| gdc.scopus.citedcount | 5 | |
| gdc.virtual.author | Genç, Burkay | |
| gdc.wos.citedcount | 3 | |
| relation.isAuthorOfPublication | 54926735-6061-411c-b0dd-a15f8590eccc | |
| relation.isAuthorOfPublication.latestForDiscovery | 54926735-6061-411c-b0dd-a15f8590eccc | |
| relation.isOrgUnitOfPublication | b4714bc5-c5ae-478f-b962-b7204c948b70 | |
| relation.isOrgUnitOfPublication | 26a7372c-1a5e-42d9-90b6-a3f7d14cad44 | |
| relation.isOrgUnitOfPublication | e9e77e3e-bc94-40a7-9b24-b807b2cd0319 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | b4714bc5-c5ae-478f-b962-b7204c948b70 |
Files
Original bundle
1 - 1 of 1