STOKER'S THEOREM FOR ORTHOGONAL POLYHEDRA
Loading...
Files
Date
2011
Authors
Genç, Burkay
Journal Title
Journal ISSN
Volume Title
Publisher
World Scientific Publ Co Pte Ltd
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Average
Popularity
Average
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.
Description
Keywords
Computational geometry, combinatorial problems, algorithms, theory of computation, Computer graphics; computational geometry (digital and algorithmic aspects), computational geometry, combinatorial problems, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Three-dimensional polytopes, algorithms, Combinatorial complexity of geometric structures, theory of computation
Fields of Science
0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
Citation
WoS Q
Scopus Q
Q4
OpenCitations Citation Count
N/A
Source
Internatıonal Journal of Computatıonal Geometry & Applıcatıons
Volume
21
Issue
4
Start Page
383
End Page
391
PlumX Metrics
Citations
Scopus : 1
Google Scholar™
