| Related sites for http://www.btinternet.com/~se16/js/cuboid.htm |
| Geometric_Group_Theory Information and resources about geometric group theory and low-dimensional topology. People, groups, meetings, links. | | Geometry_Activities By Ephraim Fithian. | | Geometry_and_the_Imagination_in_Minneapolis Geometry exercises for a two-week summer workshop led by John Conway, Peter Doyle, Jane Gilman and Bill Thurston at the Geometry Center in Minneapolis, June 1991. | | Geometry_Center Web site for the (now closed) Center for the Computation and Visualization of Geometric Structures at the University of Minnesota. Graphics, multimedia, software, teaching resources. | | Geometry_Formulas_and_Facts Excerpts from the 30th Edition of the CRC Standard Mathematical Tables and Formulas (1995), namely, the geometry section minus differential geometry. | | Geometry_from_the_Land_of_the_Incas Presents problems involving circles and triangles, with proofs, SAT practice quizzes and famous quotes. Also, has examples of geometry in Peruvian culture. | | Geometry_in_Action Includes collections from various areas in which ideas from discrete and computational geometry meet real world applications. | | The_Geometry_Junkyard Usenet clippings, web pointers, lecture notes, research excerpts, papers, abstracts, programs, problems, and other stuff related to discrete and computational geometry. | | Geometry_Page_from_Interactive_Mathematics_Miscellany Includes articles on topics in elementary and not so elementary geometry, many with interactive Java illustrations and multiple proofs. | | GLaD_Comments A new type of geometric construction that was discovered by Dan Litchfield and David Goldenheim. Includes general explanation and sketch examples. | | The_Kepler_Conjecture Information on the recent proof of Kepler conjecture on sphere packings. | | The_Lepidoptera_of_the_Circles The Butterfly theorem and its generalizations illustrated by Java applets. | | Math_3210_-_Higher_Geometry_I Course notes by Bill Cherowitzo. | | Math_Forum__Geometry_POW/POM_Search Search the Geometry Problem of the Week's archive of creative, non-routine challenges, as well as submissions and commentary, dating back to 1993. | | Math_Forum__Geometry_research Discussion board for geometry professors and instructors to keep informed of the latest research. | | Math_Forum__Search_geometry-forum Those interested in examining the previous incarnation of the Math Forum may search the archives of the Geometry Forum. | | Mathematical_Curves_and_Surfaces Graphical representations of computer generated forms. (French/English). | | Morley\'s_Miracle A discussion of Morley's famous theorem and the research of which it was a tiny part. 5 proofs are given including J. Conway's, D. Newman's, and A. Connes'. | | New_Mathematical_Findings_by_Secondary_Students High school students solve complex geometric problems by using GLad Sketchpad. Page includes diagrams. | | A_New_Way_to_Calculate_a_Triangle\'s_Area Using the length of the three sides. The proof is better understood than the old one. | | Packomania Includes packings of equal objects in containers together with source codes to obtain them numerically. | | Paul_Bourke\'s_Geometry_Page Includes formulas, definitions and three dimensional image illustrations. | | Problem_of_the_Minimum_Rotation_Surface Java applet demonstrating the catenary. | | Steiner_Surfaces Mathematical descriptions and ray-traced images of various types of Steiner surfaces | | Tim_Lister\'s_Hyperbolic_Geometry Cabri constructions for the demonstration of the basic concepts of hyperbolic geometry in the Poincare disc model. | | Wilson_Stothers\'_Inversive_Geometry_and_CabriJava_Pages Includes Steiner's Porism and the arbelos. | | Xah\'s_Personal_Page Features an illustrated dictionary of special plane curves, a paper on wallpaper groups, mathematics image gallery and links to software packages. | | NPR___Mathematicians_Get_Crafty_with_Geometry A husband and wife from Cornell University have come up with a crafty way to illustrate high-level geometry concepts -- by manipulating yarn into models that help explain the curvature of spaces. The | | The_Abacus Articles on the history, techniques, and construction of the abacus, with interactive Java Applet. | | Digital_Library_of_Mathematical_Functions This mockup gives an idea of the current ideas about the design and organization of the new Digital Library; these ideas are, of course, subject to change. Content only is only available in a few pla | | Geometry_Formulas_and_Facts An excerpt from the 30th Edition of the CRC Standard Mathematical Tables and Formulas, covering the area of Geometry (minus differential geometry), by Silvio Levy. | | Glossary_of_Math_Terms Explains commonly used words specialized to this field. Includes examples and some graph illustrations. | | Math_Assistance Lists rules and formulas for a number of mathematical subjects, such as plotting graphics, functions, factoring, derivatives, integrals, matrices, vectors, and numerical analysis. In English, French | | The_Math_Reference_Project An electronic archive of articles by Karl Dahlke on topics ranging from high school geometry up to graduate level topology. | | Mathematical_Atlas A topical guide to modern mathematics that explains the subdisciplines. Includes graphics that represent their relative size and relationship. | | Mathematics_Resources This site comprises a large number of links to matheamtical resources, dedicated to various topics. | | Math2_Org Formerly Dave's Math Tables. Mathematical tables on-line and downloadable. | | Numbers_and_Numerical_Prefixes Tables for Greek and Latin number values alone and as a part of other words. | | On-Line_Encyclopedia_of_Integer_Sequences Identify a sequence by entering few terms in the sequence. Additional information includes examples, formulas, and related links. | | PlanetMath A collaborative encyclopaedia with entries contributed under the GNU Free Documentation License. |
|
Distances on the surface of a cubical boxThis appletdemonstrates distances across the surface of a rectangular box. More information below. Since you are reading this, you are not seeing the applet. Sorry, but I hope the rest of the page makes some kind of sense. Contents Applet How to use Commentary Surface of a cube Spider and Fly Ant Square prism Surface Distance Conjecture General cuboid Numerical examples Javascript Top Links and comments How to use: Contents AppletThe first three boxes are the dimensions of the cuboid. Tochange them, type new numbers in and then press the "Youchoose" button. Numbers between about 1 and perhaps 50 seemto work best, but you can try others higher or lower. Thepictures are not perfect, due to rounding effects.The text box offers six almost self-explanatory choices for thepicture. With "distance from clicked point", just click a point on the cuboid, and the picture will show distances on the surface starting from that point. A small black x (or perhaps more than one) should appear at the point furthest from the starting point. With "sides used from starting point", the picture tries to show (by using a variety of colours) the faces used in shortest route from the clicked starting point to every other point on the cuboid. It takes a little getting used to; in particular, all points on the same face as the starting point only require routes using that face. Again, a small black x (or perhaps more than one) should appear at the point furthest from the starting point, and a dot should appear at the starting point. With " number of sides from clicked point", the picture tries to show (by using a variety of colours) the number of faces used in shortest route from the clicked starting point to every other point on the cuboid. The only possibilities are 1 (i.e. to points on the same face), 2, 3, 4, or 5 (which if it occurs will be on the opposite face - this counterintuitive case involves a route using all but one of the cuboid's faces and was first mentioned by Dudeney). With "distance to opposite point", the picture shows for each point the surface distance of the point on the cuboid which is opposite that point through the centre of the cuboid. Here a small black x indicates a point on the cuboid for which this is maximised. With " number of sides to opposite point", the picture again tries to show (by using a variety of colours) the number of faces used in shortest route from the clicked starting point to every other point on the cuboid. The only possibilities are 3, 4, or 5 (this counterintuitive case is related to the Dudeney Spider and Fly problem below). With "distance to furthest point", the picture shows for each point the surface distance of the point furthest on the surface from that point. Here a small black x indicates a point on the cuboid for which this is maximised. THIS IS VERY SLOW: theoretically the time should depend roughly on the 4th power of the screen scale (i.e. the square of the screen area) of the picture of the cuboid, so before selecting this choice it might be sensible to reduce the scale using the next function (perhaps to 60?) before selecting this choice, and if this choice works fast enough, try increasing the value slowly until an acceptable time/detail balance is achieved. The relative values of the three dimensions will also have an impact, as the speed is inversely proportional to the square of the screen area used.The final function affects the scale of the picture on thescreen and can be reduced to improve speed or increased toimproved detail.The picture does not work well in 256 colours, and a highernumber improves the position. Each sharp transition from red toyellow is supposed to signify a change of unit in the distancebeing shown, with a slow build up from yellow though orange tored showing increasing distances in fractions of a unit. More red/yellowtransitions can be introduced by multiplying all three dimensionsby a common number, and this may be particularly useful when looking at some choices for the picture (e.g. looking at a cube, the first choice are meaningful for 1x1x1, the second and third and fifth do not really depend on the overall scale, while the fourth and sixth look much better with 10x10x10 or more).The Javasource code is here. Comments are welcome.Commentary Contents AppletThis work has been stimulated by three sources available onthe web: Henry Ernest Dudeney's Spider and Fly Problem: With a cuboid 30x12x12, what is the minimum surface distance from a point which is on a 12x12 face and in 1 from the mid-point of an edge to the opposite point across the centre of the cuboid? Solution Yoshiyuki Kotani and Donald Knuth's Ant Problem: With a cuboid 1x1x2, what is the furthest point on the surface from a corner, and which are the pairs of points with the greatest surface distance between them? Suggested solution Jim Propp's Surface Distance Conjecture: For a centrally symmetric convex compact body, the greatest surface distance between two points is achieved only for pairs which are opposites through the centre. CommentTo add to the curiosities that this problem produces, here isanother simpler (and I think therefore odder) one: Find a point on a cube which is the furthest on the surface from the mid-point of an edge. (Hint: the intuitively obvious possibilities seem to be a corner of the cube, or the mid-point of the opposite edge - neither are correct) SolutionAny other sources of similar questions would be welcome.Cube Contents AppletThe following assertions seem plausible, based on acombination of experimentation and calculation: If a point P on a cube of side sis on face F with the nearest corner at Cand is distance x from the nearest edge Dand is distance y from the next nearest side Ewhere D and E are edges of Fwhich meet at C (i.e. 0 <= x <= y <= s/2),with OC being the corner opposite Cthrough the centre of the cuboid, OD and OEsimilarly being the edges opposite D and Erespectively and OF being the face opposite F,then: The point GP which is the furthest on the surface from P is on the face OF opposite F; GP is X from the side OD opposite D and Y from the side OE opposite E where: X = x and Y = Max( (2x(s-x)+ys)/(3s-2y) , (s-x)(x+y)/(2s+x-y) ) where x <= Y <= y; if y = s/2 then this gives X = x and Y = Max( x(s-x)/s+s/4 , (s-x)(2x+s)/(3s+2x) ), but there is a second solution with X = x and Y = Min( ( 3s/4-x(s-x)/s , (2x2+xs+2s2)/(3s+2x) ) where s/2 <= Y <= s-x; if x = 0 and y = s/2 then the two solutions have X = 0 and Y = s/3 or Y = 2s/3, i.e. the points on a cube which are the furthest on the surface from the mid-point of an edge are a third and two-thirds of the way across the opposite edge; the following picture aims to shows the four possible routes to each of the two points at greatest distance from the mid-point of an edge  in general, the surface distance from P to GP is sqrt(4s2+(s-y-Y)2) with Y = Max( (2x(s-x)+ys)/(3s-2y) , (s-x)(x+y)/(2s+x-y) ); sqrt(4s2+(s-y-Y)2) is maximised when y = Y = 0 (requiring x = 0), and minimised when y = Y = s/2 (requiring x = s/2) at a value of 2s ; so on a cube, the pairs of greatest surface distance points which maximise the greatest distance are opposite corners, while the pairs which minimise the greatest distance are mid-points of opposite faces; the surface distance from P to the point OP opposite P through the centre is sqrt(4s2+(s-2y)2) which does not depend on x apart from the constraint 0 <= x <= y <= s/2; iff x = y, i.e. P is on the diagonal of a face, then X = Y = x = y, i.e. GP is OP the opposite point to P through the centre of the cube; the number of routes of shortest distance from P to GP depends on the position of P (i.e. on the values of x and y): if x=y=0 there are six routes; otherwise if x=0, if x=y, or if (2x(s-x)+ys)/(3s-2y)=(s-x)(x+y)/(2s+x-y) there are four routes; and in all other cases there are three routes; (if y=s/2 and x<s/2 then there are three (or in two cases, four) routes to each of the two possibilities for GP;) for some values of x and y (with max(sqrt(2-x2)-1,(sqrt(3-4x2+4x)-1)/2)<y<1/2, i.e. with y close to 1/2), there is a point MP on OF which is a local maximum surface distance from P, although it is closer to P than GP is; the point on an adjacent face which is furthest from P is on OD a distance Z = s(y-x)/(2s-x-y) from C and the surface distance from P is sqrt((2s-x)2+(s-y-Z)2); if y=x then this point is OC and Z = 0; if x=0 then this point is GP and Z = sy/(2s-y); if y=s/2 then Z = (s2-2xs)/(3s-2x), but there is a second solution with Z = 2s2/(3s-2x); if y=x=s/2 then the points sought are the four corners of the face OF. The following graph indicates how the formula for the co-ordinatesof the point at greatest surface distance depends on the valuesof x and y. In the light greennear the edge Y=(s-x)(x+y)/(2s+x-y), while inthe light blue near the centre Y=(2x(s-x)+ys)/(3s-2y). The following picture of a cube aims to illustrate the fourroutes of shortest distance from a point between the light blueand light green areas above, for example x=s/10,y=3s/10 (in which case Y=2s/10).For a point closer to the edge (i.e. in the light green area) thelight green route would be shorter than the light blue route,while for a point further from the edge (i.e. in the light bluearea) the light blue route would be shorter than the light greenroute. To describe the points with different properties, we clearlyonly need to consider an eighth of a face, using symmetry tocover the rest of the face and of the cube. The following picturelabels some of the interesting points on a 1x1x1cube, and these are described in more detail below: We can then say: A (0.5,0.5) or (1/2,1/2): centre of face: furthest point is centre of opposite face with four shortest routes; also represents smallest distance a point and its furthest point. B (0,0.5) or (0,1/2): centre of edge: two furthest points each on the opposite edge a third of the way alonfg that edge from a corner, with four shortest routes to each point. C (0,0): corner: furthest point is opposite corner, with six shortest routes, also represents greatest distance between two points. J (0.096968283237315,0.5) or ((1-8*Cos(Pi/3+aCos(5/32)/3))/6,1/2): Other point (in addition to B) with four shortest routes to two points at greatest distance On AB excluding A: y=1/2 and 0<x<1/2: points with two furthest points, with three (apart from point J which has four) shortest routes to each On BC (i.e. edge) excluding B and C: x=0 and 0<y<1/2: furthest point is on opposite edge with four shortest routes On AC (i.e. face diagonal) excluding A and C: 0<x=y<1/2: furthest point is opposite point with four shortest routes H (0.101910213188,0.37200096992612) or ((1+sqrt(5)-sqrt(8))/4,1-1/(1-sqrt(5)+sqrt(8))): non-face-diagonal (i.e. apart from point A and points on AC) point with four shortest routes to point of greatest distance which has highest value of x . On CHJ excluding C and J: y=1-(1+/-sqrt(1-12x+20x2+16x3-16x4))/(2-4x) with 0<y<1/2 :other points with four shortest routes to point of greatest distance (in addition to A, J, B, points on AC and points on BC. Note that on AH +/- is positive, while on HJ +/- is negative. In AHJC (strictly between AC, AJ and CHJ, i.e. the light blue area above) and in BCHJ (strictly between BC, BJ and CHJ, i.e. the light green area above) there are three shortest routes to the point of greatest distance.We can also consider those points where there is a localmaximum: M (0,0.41421356237309) or (0,sqrt(2)-1): limit from above of points with x=0 which have a point which is a local maximum distance away but not a global maximum. (M itself does not have the property) On BM excluding B and M: x=0 and sqrt(2)-1<y<1/2: points with x=0 which have a point which is a local maximum distance away but not a global maximum, with four shortest routes to this local maximum distance point K (0.088562172233852,0.41143782776614) or ((3-sqrt(7))/4,(sqrt(7)-1)/4): other limit (apart from M) from above of points which have four shortest routes to a point which is a local maximum distance away but not a global maximum. (K itself does not have the property) On JK excluding J and K: y=(1-sqrt(1-4x*(1-2x)*(1+x)*(3-2x)))/(2-4x) and (3-sqrt(7))/4<x<(1-8*Cos(Pi/3+aCos(5/32)/3))/6: other points (apart from those on BM) which have four shortest routes to a point which is a local maximum distance away but not a global maximum. Note that JK is effectively the extension of AHJ after reflection in AJB. In AJBMK (strictly between AJB and AKM): max(sqrt(2-x2)-1,(sqrt(3-4x2+4x)-1)/2)<y<1/2 and 0<=x<1/2: points which have a point which is a local maximum distance away but not a global maximum, with three (apart from points on BM or JK, which have four) shortest routes to this local maximum distance point. Note that AK has the form y=(sqrt(3-4x2+4x)-1)/2 and (3-sqrt(7))/4<=x<1/2; and that KM has the form y=sqrt(2-x2)-1 and 0<=x<=(3-sqrt(7))/4. The following picture shows the surface distance to the pointof greatest surface distance from each point on a 20x20x20 cube,taken from the java applet above. The distances involved are 40at the centre of each square increasing to sqrt(2000)=44.721...at the corners. By comparison, the next picture shows the surfacedistance to the opposite point from each point on a 20x20x20cube, taken from the java applet above. Since the point ofgreatest distance form the centre of a face or a corner (orindeed any point on a diagonal of a face) is the opposite point,the range of distances involved is again 40 to sqrt(2000)=44.721... Many more questions could be asked. For example, we could look for closed routes which cross or visit each edge or face of a cube. Some suggested answers can be found on the page Circumnavigating a cube and a tetrahedron.Cuboid Contents AppletOf the assertions for a cube, none apply directly to allpoints P on all cuboids apart from the fact that there are casesof more than one point at greatest surface distance from somepoints P and there are points which are local maximum surfacedistances though not greatest surface distances from some otherpoints P. Spider and Fly Problem ContentsAppletHenryErnest Dudeney's Spiderand Fly Problem: With a cuboid 30x12x12, what is theminimum surface distance from a point which is on a 12x12 faceand in 1 from the mid-point of an edge to the opposite pointacross the centre of the cuboid?This is just a matter of checking all the possibilities: theJava applet above looks at twenty, but it is clear that for thisspecial case we will only consider four plausible shortest routes(the distance of each in fact represents more than onepossibility because of the symmetries in the question). One (a three face solution) is to go to the nearest edge, then across the 30x12 face and finally to the opposite point for a total distance of 1+30+11=42. Another (also a three face solution) is to go to an edge next to the nearest edge, then across the 30x12 face and finally to the opposite point for a total distance of sqrt(102+(6+30+6)2)=sqrt(1864)=43.174... Another (a four face solution) is to go to the nearest edge, then cut across a corner of the 30x12 face, then cut across another corner of the next 30x12 face, and finally go to the opposite point, for a distance of sqrt((6+11)2+(1+30+6)2)=sqrt(1658)=40.718... Finally (a five face solution) we can go to the nearest edge, then cut across the corner of the 30x12 face, then to the opposite side of the next 30x12 face, then cut across the corner of the next 30x12 face and finally go to the opposite point, for a distance of sqrt((6+12+6)2+(1+30+1)2)=sqrt(1600)=40. The five face solution (or its reflection) clearly results inthe shortest surface distance and 40 answers the question.Dudeney chose his problem to keep most of the numbers asintegers and to produce a (not immediately obvious) five facesolution.Further comments on the spider and the fly problem ContentsAppletThe furthest point from the starting point is in fact in thiscase where the four face and five face solutions give equaldistances: if it is x in from the mid-point of the nearest edgethen sqrt((6+12-x)2+(1+30+6)2)=sqrt((6+12+6)2+(1+30+x)2)i.e. when x=156/98=1.5918... and the surface distance from thestarting point is 40.475...Many (but not all) of the points on the 30x12 faces have theirpoint of greatest distance on an adjacent 12x12 face (notsurprisingly the further one). For an xY cuboid where Y/X>=(sqrt(17)+3)/2=3.56155...,all points on one of the four largest faces have points ofgreatest distance on an adjoining small face. Indeed for a WYcuboid where X>=W and Y>=max[X+W/2+sqrt(X2+3XW+W2/4),X2/W+2X], all points of greatest distance from any starting point on the cuboid are onone or other of the two smallest (WxX) faces. The first value (in max[]) applies if 1<=X/W<=(cbrt(37+sqrt(1026))+cbrt(37-sqrt(1026))-2)/3=1.26953..., and requires a cuboid twice the length (Y) of one where the point furthest from a corner is not the opposite corner (see below). The second value (in max[]) applies if X/W>=(cbrt(37+sqrt(1026))+cbrt(37-sqrt(1026))-2)/3=1.26953..., and requires a cuboid twice the length (Y) of one with X>=W and Y>X2/2W+X , which then has the property that the surface distance between opposite corners is less than the surface distance between the centres of the WxX faces (though neither represents the maximumgreatest surface distance on the cuboid). For a 30x12x12 cuboid, there are four pairs of points whichhave the greatest surface distance between the points in thepair; each point is on one of the 12x12 faces, a distance sqrt(189)-9=4.7477...in from two adjacent edges (i.e. on a diagonal of the face), withthe surface distance between them being sqrt(3420-sqrt(2721600))=42.0746...and each such point being the opposite point through the centreof its paired point. They occur where two three face and two fourface solutions give the same distance. This distance maximalsurface distance compares with the surface distance between thecentres of the 12x12 faces of 42 and between opposite corners ofsqrt(1476)=38.4187... (though, as we shall see in the ant problembelow, that the furthest point from a corner is not in this caseanother corner).Ant Problem Contents AppletYoshiyukiKotani and DonaldKnuth's AntProblem: With a cuboid 1x1x2, what is the furthest pointon the surface from a corner (Kotani), and which are the pairs ofpoints with the greatest surface distance between them (Knuth)? The solutions to these two problems are similar to the thoseanswered in the further comments on the Spider and Fly problem.The point with greatest surface distance from a given corneris on the further 1x1 face and is a and b in from the sides whereof the four expressions: sqrt((3-a)2+(1-b)2),sqrt((3-b)2+(1-a)2), sqrt((2-a)2+(2+b)2),and sqrt((2-b)2+(2+a)2), three are equaland the remaining one is greater than or equal to the others.This gives the solution that the point of greatestdistance from a given corner of a 1x1x2 cuboid is on the 1x1 faceand 1/4 in from each of the two sides of that face which meet atthe opposite corner to the starting corner. The distanceinvolved is sqrt(65/8)=2.8504... less than 1% more than sqrt(8)=2.8284...for the distance corner to corner. This result is easilygeneralised to any square prism or toany cuboid.This result is easily checked in the Java applet above,particularly if the dimensions used are 4x4x8 and you then clickon the little x which appears, seeing that the distance of thatpoint is then 1 from the two nearest edges.An equivalent question was posed in New Scientist in December 1998, leading to a usenet discussion. Many wrong answers were suggested. Even the relatively simple question of the shortest surface distance between opposite corners of a 2x1x1 cuboid posed around the same time also produced wrong answers.The second part of the ant problem is essentially the same asthat of the similar question of the spider and fly cuboid, withthe result being four pairs of points which have thegreatest surface distance between the points in the pair; eachpoint is on one of the 1x1 faces, a distance (sqrt(3)-1)/2=0.3660...in from two adjacent edges (i.e. on a diagonal of the face), andeach such point being the opposite point through the centre ofits paired point. The surface distance between each pairis sqrt(16-sqrt(48))=3.0119...., marginally more than 3 which isthe distance between the centres of the 1x1 faces.Further comments on the ant problem:generalising for a square prism Contents AppletHaving seen that the cuboids in the ant problem and in thespider and fly problem have many features in common, the questionis whether we can produce a general response to the questions inthe ant problem for all cuboids of the form AxAxB,i.e. for square prisms. The following assertions describe thatgeneralised result: If B/A<=1 then the greatest surface distance is represented by the four pairs of opposite corners and the distance involved is sqrt(2A2+2AB+B2), and so the point at greatest distance from a corner is the opposite corner; If 1<=B/A<(sqrt(17)+3)/4=1.7807... then the point at greatest distance from a corner is the opposite corner at a distance of sqrt(4A2+B2); If B/A>(sqrt(17)+3)/4=1.7807... then the point at greatest distance from a corner is on the further AxA face at a distance A/2-A2/2B in from the edges that meet at the opposite corner, at a surface distance of sqrt(B2+AB+3A2/2+A3/B+A4/2B2) from the starting point ; If B/A=(sqrt(17)+3)/4=1.7807... then both the opposite corner and the point (sqrt(17)-1)A/2(sqrt(17)+3)=0.2192...A in from the relevant edges are at greatest surface distance of (sqrt(153)+13)A/8=7.1711...*A from the starting corner; If 1<=B/A<sqrt(2)=1.4142... then the greatest surface distance is represented by the four pairs of opposite corners and the distance involved is sqrt(4A2+B2); If B/A>sqrt(2)=1.4142... then the greatest surface distance is represented by four pairs of opposite points where each point is on an AxA face and is (sqrt(B2-A2)-B+A)/2 in from two edges, and where the distance involved is sqrt(3B2+2AB-2Bsqrt(B2-A2)); If B/A=sqrt(2)=1.4142... then the greatest surface distance is represented by eight pairs of opposite points being either pairs of opposite corners or pairs of opposite points where each point is on an AxA face and is (1-sqrt(1/2))A=0.2928...A in from two edges, and where the distance involved is sqrt(6)A=2.4394...A.Surface Distance Conjecture ContentsAppletJim Propp's SurfaceDistance Conjecture: For a centrally symmetric convexcompact body, the greatest surface distance between two points isachieved only for pairs which are opposites through the centre. Little of what has been said so far can be generalised to allcentrally symmetric convex compact bodies, but experimentationwith the applet above suggests something which would, if true,imply the conjecture. The following statement may be strongerthan what might be required to prove the conjecture, though itmight point in a useful direction: For a centrally symmetric convex compact body, if a point G of greatest surface distance from a starting point P is not opposite P through the centre of the body, then P is not a point of greatest surface distance from G.This would imply that there could be no non-opposite pair ofpoints P and G each of greatest surface distance starting fromthe other, and therefore there could be no non-opposite pair ofpoints with the greatest surface distance between them of any twopoints on the body.Note that the following related statement is obviously true bythe central symmetry of the body: For a centrally symmetric body, if a point G of greatest surface distance from a starting point P is the symmetric point to P (i.e. G is opposite P through the centre of the body and the internal distances from P and from G are the same), then P is a point of greatest surface distance from G.Meanwhile the following is frequently not true even for a cube: If two opposite points P and G are each of greatest surface distance starting from the other, then this surface distance is the greatest possible of any two points on the body.But I suspect none of these comments add much to the solutionof the problem. Even proving the conjecture for a cuboid requiresa proper proof of the following assertions which attempt (notvery well) to generalise the issue of the pairs of points atgreatest distance.Points of greatest surface distance froma corner Contents AppletThe first of the ant questions is easilygeneralised for an AxBxC cuboid with A<=B<=C: If B>C(2C-A)/(2C+A) [or equivalently A<2C(C-B)/(C+B) or C>(2B+A+sqrt(4B2+12AB+A2))/4] then the point at greatest distance from a corner is the opposite corner, and the distance involved is sqrt(A2+B2+C2+2AB); If B<C(2C-A)/(2C+A) then the point at greatest distance from a corner is on the further AxB face at a distance A/2-AB/2C in from each of the edges that meet at the opposite corner, and the distance involved is sqrt((1+(B/C)2)(C2+AC+A2/2)) from the starting point ; If B=C(2C-A)/(2C+A) then there are two points at greatest distance from a corner, which are the opposite corner and the point on the further AxB face at a distance A/2-AB/2C in from each of the edges that meet at the opposite corner, and the distance involved is sqrt(A2+B2+C2+2AB) from the starting point. Curiously, when there are two points at greatest distance from a corner, if A and C are rational, or if B and C are rational, then all three sides must be rational; however if A and B are rational, then C can be (and often is) irrational.The numerical examples below describesome interesting integer cases while the Javascriptcalculator provides an easy way of applying these results.Pairs of points of greatest surfacedistance on a cuboid Contents AppletFor an AxBxC cuboid with A<=B<=C: if A=B=C then the points at greatest surface distance are the four pairs of opposite corners; if B<(Csqrt(C4+2AC3+A2C2-2A3C-A4)-C3)/(C2-A2) then there is a solution for x (and thus y) in the equation sqrt(A2-2BC+2AC-4Bx+4x2)=(2Cx+AB-BC)/(C-B+2x)=A-2y [an unattractive quartic in x when multiplied out, though in this form and with the following range, it is easily solvable for x by successive interval bisection] with B/2-AB/2C<x<B/2-sqrt((A+B+2C)(B-A))/2, and so: if B<C-A+x+y then the greatest surface distance is represented by four pairs of opposite points where each point is on an AxB face and is x in from an edge length A and y in from an edge length B, and where the distance involved is sqrt(A2+B2+C2+2AC+4x2-4Bx); if B>C-A+x+y then the greatest surface distance is represented by the four pairs of opposite corners and the distance involved is sqrt(A2+B2+C2+2AB); if B=C-A+x+y then the greatest surface distance is represented by eight pairs of opposite points being either pairs of opposite corners or pairs of opposite points where each point is on an AxB face and is x in from an edge length A and y in from an edge length B, and the distance involved is sqrt(A2+B2+C2+2AB); if B>=(Csqrt(C4+2AC3+A2C2-2A3C-A4)-C3)/(C2-A2) then: If B<(8C3+A3)/(8C2+4AC) then the greatest surface distance is represented by the four pairs of opposite corners, and the distance involved is sqrt(A2+B2+C2+2AB); If B>(8C3+A3)/(8C2+4AC) then the greatest surface distance is represented by two pairs of opposite points each on the AxB face in (B+C-sqrt((B+C)2-A(A+2C-2B)))/2 from the mid points of the shortest edges, and the distance involved is sqrt(B2+3C2+2AB+2BC-2Csqrt((B+C)2-A(A+2C-2B))); If B=(8C3+A3)/(8C2+4AC) then the greatest surface distance is represented by the four pairs of opposite corners and the two pairs of opposite points each on the AxB face in (B+C-sqrt((B+C)2-A(A+2C-2B)))/2 from the mid points of the shortest edges, and the distance involved is sqrt(A2+B2+C2+2AB); So there are cuboids with two, four, six or eight pairs of points representing the greatest surface distance, and in every case they are opposite points (as required by the Surface Distance Conjecture for a Cuboid). The numerical examples below describe some interesting integer cases while the Javascript calculator provides an easy way of applying these results.The following graphs show how the pairs of points representingthe greatest surface distance vary with the dimensions of thecuboid. They assume that one of the sides of the cuboid is length1 (or pick a side and divide the length of the other sides by thelength of that side. The yellow area represents the dimensionsresulting in the four pairs of opposite corners representing thegreatest surface distance; the green area represents the fourpairs of points strictly inside the smallest faces; the grey area(and the dark grey lines between grey and green) represent thetwo pairs of points strictly inside the smallest faces; the redline between yellow and grey represents the combination of thefour pairs of corners and the two pairs of points strictly insidethe smallest faces; and the blue line between green and yellowrepresents the combination of the four pairs of corners and thefour pairs of points strictly inside the smallest faces. Theright hand graph is a detail of part of the left hand graph, oneof the places where the three lines and three areas meet. Roughly in words, what this graph shows is that for the fourpairs of opposite corners to represent the greatest surfacedistance (yellow), B must be close to C; B being A/2 away from Cis too far, though this is approached as C increases relative toA. For four internal pairs to represent the greatest surfacedistance (green), B must be close to A and C must besignificantly more; as C increases relative to A, the limit onthe difference between B and A tightens quickly, although B canalways equal A (a square prism). With reasonable gaps between Aand B and between B and C, two internal pairs represent thegreatest surface distance. Numerical examplesContents AppletMany integer and other numerical examples are possible, inaddition to those in the Spider and Fly Problem and the AntProblem: On a 6x6x6 cube, the two points at greatestdistance from the mid-point of a side are on the opposite side 2in from the corners; this is related to the fact that 145 is thesum of two squares in two ways: 122+12=92+82.On a 10x10x10 cube the point at greatestdistance from the point 1 in from the nearest side and 3 in fromthe next nearest side is almost opposite but is 1 in from a sideand 2 in from another side; there are four routes from thestarting point to the finishing point, and this is related to thefact that 425 is the sum of two squares in three ways: 202+52=192+82=162+132.On an Nx(N-1)(N-2)/2xN(N-1)/2 cuboid withN>=5, for example a 5x6x10 or a 21x190x210cuboid, the two points at greatest distance from a corner are theopposite corner and the point 1 in from each of the two edges ona smallest face which meet at the opposite corner; again this isrelated to numbers which are the sum of two different pairs ofsquares, since ((N2-N+2)/2)2+((N2-N)/2)2=((N2-3N)/2)2+((N2+N-2)/2)2,for example 221=112+102=142+52and 88621=2112+2102=2302+1892.By scaling the ant cuboid to 4x4x8,we get one of many cuboids with the point at greatest distancefrom a corner the point 1 in from each of the two edges on asmallest face which meet at the opposite corner; this is relatedto 130=92+72=112+32.Another square prism with the same property is 3x3x9related to 125=102+52=112+22.There are numerous examples of other cuboids with the sameproperty, such as 3x4x12, 3x5x15, 3x6x18, ..., 4x5x10, 4x6x12,4x7x14, ..., 5x9x15, 5x12x20, 5x15x25, ..., 6x12x18, 6x14x21, 6x16x24,..., etc. The pattern is based on the requirement for thisproperty that B=C(A-2)/A as well as the basic constraint thatB<C(2C-A)/(2C+A). We then have (B-1)2+(A+C-1)2=(A+B-1)2+(C+1)2.The following examples demonstrate different possibilities foropposite points representing the greatest surface distance on thecuboid.There are numerous examples of cuboids which have two pairs ofopposite points representing the greatest surface distance on thecuboid which are the opposite pairs of points 1 in from the midpoints of the shortest edges. One of the simplest is 4x5x10with more of the form 4xNx(3N-2) with N>=5;others include 6x8x11 and others of the form 6xNx(2N-5)with N>=8, 8x16x21 and others of the form 8x2Nx(3N-3)with N>=8 etc.The 3x3x5 cuboid has four pairs of oppositepoints representing the greatest surface distance on the cuboid,which are the points 1 in from two edges on a smallest face.There are numerous examples of cuboids where the four pairs ofopposite points representing the greatest surface distance on thecuboid are the corners of the cuboid: 1x1x1 isthe simplest.The 6x7x9 cuboid has six pairs of oppositepoints representing the greatest surface distance on the cuboid.They are the four pairs of opposite corners and the oppositepairs of points 1 in from the mid points of the shortest edges.The same is true for 8x13x16, 10x21x25, 12x31x36, ...and in general 2Nx(N^2-N+1)xN^2 with N>=3.It is not clear whether there is a nice integer example ofeight pairs of opposite points representing the greatest surfacedistance on the cuboid. A non-integer example is 1x1xsqrt(2),where four pairs are corners of the cuboid and the other fourpairs are points (1-sqrt(1/2)) in from two edges on a smallestface. In the Javascript below the sides have to be 1, 1, and 1.414213562373to achieve the desired result.Javascript calculator (based onassertions above)Contents Applet Sides of the cuboid: Put the sides of the cuboid in the three boxes above and then press the button to see the results based on the earlier assertions. Copyright 2000 Henry Bottomley.Some extra cube pictures added 2001.Any comments?Top Contents Applet Java codeJava and JavaScriptexamples Circumnavigating a cube and a tetrahedron Mapprojections of the world var sc_project=1475506; var sc_invisible=1; var sc_partition=13; var sc_security="8a3425d7"; var sc_text=2;  |
|
