A Congruence Problem for Polyhedra
نویسندگان
چکیده
We will make this more specific by specifying what sorts of measurements will be allowed. For example, in much of the paper, allowed measurements will include distances between pairs of vertices, angles between edges, angles between two intersecting face diagonals (possibly on different faces with a common vertex) or between a face diagonal and an edge, and dihedral angles (that is, angles between two adjoining faces). One motivation for these choices is given below. Sometimes we are more restrictive, for example, allowing only distance measurements. In two dimensions this was a fundamental question answered by Euclidean geometers, as (we hope) every student who takes geometry in high school learns. If the lengths of the corresponding sides of two triangles are equal, then the triangles are congruent. The SAS, ASA, and AAS theorems are equally well known. The extension to other shapes is not often discussed, but we will have some remarks about the planar problem as well. It is surprising to us that beyond the famous theorem of Cauchy discussed below, we have been unable to find much discussion of the problems we consider in the literature, though we think it is almost certain that they have been studied in the past. We would be appreciative if any reader can point us to relevant results. Our approach will usually be to look at the problem locally. If the two polyhedra are almost congruent, and agree in a certain set of measurements, are they congruent? At first glance this looks like a basic question in what is known as rigidity theory, but a little thought shows that it is different. In rigidity theory, attention is paid to relative positions of vertices, viewing these as connected by inextensible rods which are hinged at their ends and so can rotate relative to each other, subject to constraints imposed by the overall structure of rods. In our problem there is the additional constraint that in any movement of the vertices, the combinatorial structure of the polyhedron cannot change. In particular, any vertices that were coplanar before the movement must be coplanar after the movement. This feature seems to us to produce an interesting area of study. Our original motivation for considering this problem came from a very practical question encountered by one of us (SPH). If one attempts to make solid wooden models of interesting polyhedra, using standard woodworking equipment, it is natural to want to check how accurate these models are.1 As a mathematician one may be attracted first to the Platonic solids, and of these, the simplest to make appears to be the cube. (The regular tetrahedron looks harder, because non-right angles seem harder to cut accurately.)
منابع مشابه
A FEASIBLE ALGORITHM FOR CHECKING n-SCISSORS CONGRUENCE OF POLYHEDRA IN R
While in R2, every two polygons of the same area are scissors congruent (i.e., they can be both decomposed into the same finite number of pair-wise congruent polygonal pieces), in R3, there are polyhedra P and P ′ of the same volume which are not scissors-congruent. It is therefore necessary, given two polyhedra, to check whether they are scissorscongruent (and if yes – to find the correspondin...
متن کاملOn the infinitesimal rigidity of weakly convex polyhedra
The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex polyhedron, is infinitesimally rigid. We prove that it is indeed the case for two classes of polyhedra: those obtained from a convex polyhedron by “denting” at most two edges at a common vertex, and suspensions with a natu...
متن کاملEQUIDECOMPOSABILITY (SCISSORS CONGRUENCE) OF POLYHEDRA IN R3 AND R4 IS ALGORITHMICALLY DECIDABLE: HILBERT'S 3rd PROBLEM REVISITED
Hilbert's third problem: brief reminder. It is known that in a plane, every two polygons P and P ′ of equal area A(P ) = A(P ′) are scissors congruent (equidecomposable) i.e., they can be both decomposed into the same nite number of pair-wise congruent polygonal pieces: P = P1 ∪ . . . ∪ Pp, P ′ = P ′ 1 ∪ . . . ∪ P ′ p, and Pi ∼ P ′ i . In one of the 23 problems that D. Hilbert formulated in 1...
متن کاملModelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملRigid Ball-Polyhedra in Euclidean 3-Space
A ball-polyhedron is the intersection with non-empty interior of finitely many (closed) unit balls in Euclidean 3-space. One can represent the boundary of a ballpolyhedron as the union of vertices, edges, and faces defined in a rather natural way. A ball-polyhedron is called a simple ball-polyhedron if at every vertex exactly three edges meet. Moreover, a ball-polyhedron is called a standard ba...
متن کاملThe Personality Congruence of Iranian Veterinary Students with Their Field of Study
Introduction: Evidence shows problems like feelings of dislike for the profession, job inconsistency, and low rate of career success have increased among the Iranian vets in the recent years. We have studied the correlation between personality congruence of Iranian veterinary students with their field of study to find the cause of the mentioned problems. Methods: In this survey study, we admin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The American Mathematical Monthly
دوره 117 شماره
صفحات -
تاریخ انتشار 2010