scientific article; zbMATH DE number 20626
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.
- Resolvable representation of polyhedra
- Representing polyhedra: Faces are better than vertices
- The representation of polyhedra by polynomial inequalities
- Complexity yardsticks for \(f\)-vectors of polytopes and spheres
- scientific article; zbMATH DE number 647646 (Why is no real title available?)
- scientific article; zbMATH DE number 701095 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3979861)