[math-fun] Approximate disk-dissection
Does anyone know of work that's been done on approximate dissection and recomposition of disks? For instance, dividing a disk of radius 2 into pieces and then rearranging the pieces to form an approximation to two discs of radius 1? Jim Propp
an interesting idea. although you obviously meant a circle of AREA 2, not radius 2. how would you measure how good the approximation is? the smallest inradius of the two sets of rearranged pieces? the largest circumradius of the two sets of rearranged pieces? the minimum area of overlap of a unit disk with these sets? erich
Does anyone know of work that's been done on approximate dissection and recomposition of disks? For instance, dividing a disk of radius 2 into pieces and then rearranging the pieces to form an approximation to two discs of radius 1?
On Saturday, February 20, 2016, Erich Friedman <erichfriedman68@gmail.com <javascript:_e(%7B%7D,'cvml','erichfriedman68@gmail.com');>> wrote:
an interesting idea. although you obviously meant a circle of AREA 2, not radius 2.
Actually, I meant to say FOUR circles of radius 1. You can for instance radially divide a disk of radius 2 into lots of approximately triangular wedges, divide each wedge into four roughly triangular pieces, and rearrange the pieces to form four approximate disks of radius 1. how would you measure how good the approximation is? the smallest inradius
of the two sets of rearranged pieces? the largest circumradius of the two sets of rearranged pieces? the minimum area of overlap of a unit disk with these sets?
I'm not sure what the most natural measure is. All of Erich's suggestions sound good. Jim
erich
Does anyone know of work that's been done on approximate dissection and recomposition of disks? For instance, dividing a disk of radius 2 into pieces and then rearranging the pieces to form an approximation to two discs of radius 1?
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
You can for instance radially divide a disk of radius 2 into lots of approximately triangular wedges, divide each wedge into four roughly triangular pieces, and rearrange the pieces to form four approximate disks of radius 1.
an excellent observation. here's a small related puzzle. it's clear that you can cut a unit disk into two pieces that each contain a disk of radius 1/2. let phi = (sqrt5 - 1) / 2. let epsilon be a small positive number. how can you cut a unit disk into four pieces that can be rearranged in a non-overlapping fashion to form two regions that each contain a disk of radius phi - epsilon? (no piece covers more than one disk) no idea whether this is optimal, but it's the best i can do on an hour's notice and 6 hours sleep. erich
This paper, "Scissor congruence" by Hirsch, Dubins, and Karush Israel Journal of Mathematics December 1963, Volume 1, Issue 4, pp 239-247 seems to address some aspect of this question, depending on how the question is defined. The first page: http://link.springer.com/article/10.1007/BF02759727#page-1 mentions rearranging one circle into four explicitly. (I don't have access to the whole paper, so if someone gets an electronic copy, I would appreciate getting a copy of that myself.) —Dan
On Feb 20, 2016, at 10:43 AM, James Propp <jamespropp@gmail.com> wrote:
Actually, I meant to say FOUR circles of radius 1.
Does anyone know of work that's been done on approximate dissection and recomposition of disks? For instance, dividing a disk of radius 2 into pieces and then rearranging the pieces to form an approximation to two discs of radius 1?
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
I came across an interesting formula in an optics book for the solid angle of a spherical triangle. Let a, b, c, be the unit vectors from the center to the vertices of a spherical triangle on the unit sphere. Then the solid angle Omega, which equals the area of the triangle, is given by tan(Omega/2) = [a,b,c] / (1 + b.c + a.c + a.b), where a.b etc. are dot products, and [a,b,c] is the scalar triple product. This paper is the cited reference. http://www.maa.org/sites/default/files/Eriksson14108673.pdf -- Gene
I like it! Is there a generalization to n dimensions? Presumably dot products and triple products give way to determinantal expressions. Jim Propp On Saturday, February 20, 2016, Eugene Salamin via math-fun < math-fun@mailman.xmission.com> wrote:
I came across an interesting formula in an optics book for the solid angle of a spherical triangle. Let a, b, c, be the unit vectors from the center to the vertices of a spherical triangle on the unit sphere. Then the solid angle Omega, which equals the area of the triangle, is given by
tan(Omega/2) = [a,b,c] / (1 + b.c + a.c + a.b),
where a.b etc. are dot products, and [a,b,c] is the scalar triple product. This paper is the cited reference.
http://www.maa.org/sites/default/files/Eriksson14108673.pdf
-- Gene
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com <javascript:;> https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
For the length, theta, of an arc on the circle, tan(theta/2) = sin(theta) / (1 + cos(theta)) = |a x b| / (1 + a.b) But the obvious generalization fails in dimension 4 or higher. Remembering that the volume of the unit n-ball is (pi^(n/2) / (n/2)!), the expression for its total solid angle is a rational number times pi^2 or higher power of pi. On the other hand, consider an orthant, for which the unit vectors are orthogonal. The volume determinant is 1, and all the dot products are 0, so we have tan(Omega/2) = 1 and Omega = pi/2. Back in 3 dimensions, here's a nice relation between the scalar triple product and the sides of the triangle. Let V be the matrix whose rows are the components of the vectors a, b, c, so that [a,b,c] = det V. Then [a,b,c]^2 = det(V V^T) = det [[1, a.b, a.c], [b.a, 1, b.c], [c.a, c.b, 1]] The sides of a spherical triangle are measured as angles, and a.b = cos c etc. Expanding the determinant, we get [a,b,c]^2 = 1 - (cos a)^2 - (cos b)^2 - (cos c)^2 + 2 cos a cos b cos c. -- Gene From: James Propp <jamespropp@gmail.com> To: Eugene Salamin <gene_salamin@yahoo.com>; math-fun <math-fun@mailman.xmission.com> Sent: Saturday, February 20, 2016 11:17 AM Subject: Re: [math-fun] Solid angle of a spherical triangle I like it! Is there a generalization to n dimensions? Presumably dot products and triple products give way to determinantal expressions. Jim Propp On Saturday, February 20, 2016, Eugene Salamin via math-fun <math-fun@mailman.xmission.com> wrote: I came across an interesting formula in an optics book for the solid angle of a spherical triangle. Let a, b, c, be the unit vectors from the center to the vertices of a spherical triangle on the unit sphere. Then the solid angle Omega, which equals the area of the triangle, is given by tan(Omega/2) = [a,b,c] / (1 + b.c + a.c + a.b), where a.b etc. are dot products, and [a,b,c] is the scalar triple product. This paper is the cited reference. http://www.maa.org/sites/default/files/Eriksson14108673.pdf -- Gene
participants (4)
-
Dan Asimov -
Erich Friedman -
Eugene Salamin -
James Propp