No label defined (Q3979861)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 20626
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 20626 |
Statements
26 June 1992
0 references
complexity
0 references
representation
0 references
polyhedron
0 references
0.7735956907272339
0 references
0.7697601318359375
0 references
0.7697081565856934
0 references
0.7673897743225098
0 references
The authors study the complexity of representations of a convex polyhedron in \({\mathbb{R}}^ 3\) from the given graph of the polyhedron in three variants: as a system of distances between vertices; as a system of vertices and as a system of facettes. The complexity is defined as the minimal number of parameters sufficient for the unique representation of the polyhedron. If \(r_ 1\) is the number of edges of the polyhedron \(P\), then \(r_ 1\) distances are necessary to get a unique representation of \(P\). An algorithm for the construction of \(P\) from the \(r_ 1\) distances is given. Let \(r_ 2\) and \(r_ 3\) be the minimal numbers of parameters necessary for the second and third representation of \(P\), respectively. The following results are given: \(e/2+2\leq r_ 2\leq e\), \(k/2+2\leq r_ 3\leq k\), where \(e\) and \(k\) denote the number of vertices and edges, respectively.
0 references