Cauchy's Theorem for Orthogonal Polyhedra of Genus 0

Loading...
Publication Logo

Date

2009

Authors

Genç, Burkay

Journal Title

Journal ISSN

Volume Title

Publisher

Open Access Color

Green Open Access

No

OpenAIRE Downloads

OpenAIRE Views

Publicly Funded

No
Impulse
Average
Influence
Average
Popularity
Average

Research Projects

Journal Issue

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.

Description

17th Annual European Symposium on Algorithms, ESA 2009 -- 7 September 2009 through 9 September 2009 -- Copenhagen -- 77841

Keywords

Convex polyhedrons, Dihedral angles, Linear-time algorithms, Clustering algorithms, Radar antennas

Fields of Science

Citation

WoS Q

N/A

Scopus Q

Q3
OpenCitations Logo
OpenCitations Citation Count
3

Source

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volume

5757 LNCS

Issue

Start Page

71

End Page

82
PlumX Metrics
Citations

CrossRef : 1

Scopus : 5

SCOPUS™ Citations

5

checked on Mar 18, 2026

Web of Science™ Citations

3

checked on Mar 18, 2026

Downloads

12

checked on Mar 18, 2026

Google Scholar Logo
Google Scholar™
OpenAlex Logo
OpenAlex FWCI
2.0109

Sustainable Development Goals

SDG data is not available