STOKER'S THEOREM FOR ORTHOGONAL POLYHEDRA
| dc.contributor.author | Biedl, Therese | |
| dc.contributor.author | Genç, Burkay | |
| dc.date.accessioned | 2023-06-16T14:31:32Z | |
| dc.date.available | 2023-06-16T14:31:32Z | |
| dc.date.issued | 2011 | |
| dc.description.abstract | Stoker's theorem states that in a convex polyhedron, the dihedral angles and edge lengths determine the facial angles if the graph is fixed. In this paper, we study under what conditions Stoker's theorem holds for orthogonal polyhedra, obtaining uniqueness and a linear-time algorithm in some cases, and NP-hardness in others. | en_US |
| dc.description.sponsorship | NSERC | en_US |
| dc.description.sponsorship | Supported by NSERC. | en_US |
| dc.identifier.doi | 10.1142/S0218195911003718 | |
| dc.identifier.issn | 0218-1959 | |
| dc.identifier.issn | 1793-6357 | |
| dc.identifier.scopus | 2-s2.0-84860395222 | |
| dc.identifier.uri | https://doi.org/10.1142/S0218195911003718 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14365/2134 | |
| dc.language.iso | en | en_US |
| dc.publisher | World Scientific Publ Co Pte Ltd | en_US |
| dc.relation.ispartof | Internatıonal Journal of Computatıonal Geometry & Applıcatıons | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | Computational geometry | en_US |
| dc.subject | combinatorial problems | en_US |
| dc.subject | algorithms | en_US |
| dc.subject | theory of computation | en_US |
| dc.title | STOKER'S THEOREM FOR ORTHOGONAL POLYHEDRA | en_US |
| dc.type | Article | en_US |
| dspace.entity.type | Publication | |
| gdc.author.id | 0000-0001-5134-1487 | |
| gdc.author.id | Genç, Burkay | |
| gdc.author.scopusid | 7004350208 | |
| gdc.author.scopusid | 57202163971 | |
| gdc.author.wosid | AAG-6482-2021 | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C5 | |
| gdc.bip.popularityclass | C5 | |
| gdc.coar.access | metadata only access | |
| gdc.coar.type | text::journal::journal article | |
| gdc.collaboration.industrial | false | |
| gdc.description.department | İzmir Ekonomi Üniversitesi | en_US |
| gdc.description.departmenttemp | [Biedl, Therese] Univ Waterloo, David R Cheriton Sch Comp Sci, Waterloo, ON N2L 3G1, Canada; [Genc, Burkay] Izmir Univ Econ, Fac Engn & Comp Sci, Izmir, Turkey | en_US |
| gdc.description.endpage | 391 | en_US |
| gdc.description.issue | 4 | en_US |
| gdc.description.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | Q4 | |
| gdc.description.startpage | 383 | en_US |
| gdc.description.volume | 21 | en_US |
| gdc.identifier.openalex | W2042411230 | |
| gdc.identifier.wos | WOS:000296628800001 | |
| gdc.index.type | WoS | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 0.0 | |
| gdc.oaire.influence | 2.5349236E-9 | |
| gdc.oaire.isgreen | false | |
| gdc.oaire.keywords | Computer graphics; computational geometry (digital and algorithmic aspects) | |
| gdc.oaire.keywords | computational geometry | |
| gdc.oaire.keywords | combinatorial problems | |
| gdc.oaire.keywords | Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) | |
| gdc.oaire.keywords | Three-dimensional polytopes | |
| gdc.oaire.keywords | algorithms | |
| gdc.oaire.keywords | Combinatorial complexity of geometric structures | |
| gdc.oaire.keywords | theory of computation | |
| gdc.oaire.popularity | 4.947062E-10 | |
| gdc.oaire.publicfunded | false | |
| gdc.oaire.sciencefields | 0202 electrical engineering, electronic engineering, information engineering | |
| gdc.oaire.sciencefields | 0102 computer and information sciences | |
| gdc.oaire.sciencefields | 02 engineering and technology | |
| gdc.oaire.sciencefields | 01 natural sciences | |
| gdc.openalex.collaboration | International | |
| gdc.openalex.fwci | 0.5299 | |
| gdc.openalex.normalizedpercentile | 0.7 | |
| gdc.opencitations.count | 0 | |
| gdc.plumx.scopuscites | 1 | |
| gdc.scopus.citedcount | 1 | |
| gdc.virtual.author | Genç, Burkay | |
| gdc.wos.citedcount | 0 | |
| 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