A Congruence Problem for Polyhedra
From MaRDI portal
Publication:3058129
Abstract: It is well known that to determine a triangle up to congruence requires three measurements: three sides, two sides and the included angle, or one side and two angles. We consider various generalizations of this fact to two and three dimensions. In particular we consider the following question: given a convex polyhedron , how many measurements are required to determine up to congruence? We show that in general the answer is that the number of measurements required is equal to the number of edges of the polyhedron. However, for many polyhedra fewer measurements suffice; in the case of the unit cube we show that nine carefully chosen measurements are enough. We also prove a number of analogous results for planar polygons. In particular we describe a variety of quadrilaterals, including all rhombi and all rectangles, that can be determined up to congruence with only four measurements, and we prove the existence of -gons requiring only measurements. Finally, we show that one cannot do better: for any sequence of distinct points in the plane one needs at least measurements to determine it up to congruence.
Recommendations
- scientific article; zbMATH DE number 5875567
- Some problems on polyhedra
- A converse of Euler's theorem for polyhedra
- scientific article; zbMATH DE number 703140
- scientific article; zbMATH DE number 3918098
- scientific article; zbMATH DE number 7498813
- scientific article; zbMATH DE number 3897724
- On the Identity of Polyhedra
- scientific article; zbMATH DE number 3913153
- scientific article; zbMATH DE number 3918105
Cited in
(7)- scientific article; zbMATH DE number 7644071 (Why is no real title available?)
- On a problem of Stocker
- Reconstruction of tetrahedra from sets of edge lengths
- ON THE DIMENSIONS OF THE REALIZATION SPACES OF POLYTOPES
- Rigidity, tensegrity, and reconstruction of polytopes under metric constraints
- Polyhedra and commensurability
- Efficient generation of large-scale Pareto-optimal topologies
This page was built for publication: A Congruence Problem for Polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058129)