What is the length of the shortest network of lines that connects all four of the points A = ( 0 , 0 ) , B = ( 5 , 1 ) , C = ( 4 , 4 ) , D = ( 1 , 3 ) ?
If the answer can be expressed as U + V W , where U , V , W are positive integers and W is square-free, give the value of U + V + W .
With thanks to
this one
and
that one
.
Note that the coordinates of
C
in this problem are different.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Given A(0,0) , D(1,3), C(4,4) and B(5,1) .
AD=(1+3^2)^.5=3.16...
DC=(1+3^2)^.5=3.16...
CB=(1+3^2)^.5=3.16...
XY<= AD+DC+CB~3*3.16..~9.49... .
So XY < 10 .
Why XY = 71?
I think.
Real Shortest XY is
XY = (44+24*3^0.5)^0.5
= (85.569)^.5
=9.25 #
Log in to reply
I am not saying that X Y = 7 1 . The answer I asked for involved taking the 4 4 , 2 4 and 3 from the exact expression for X Y and adding them.
Log in to reply
I thought about two possibilities knowing Steiner tree problem... I bet for minimizing a 2 + b 2 + ( 1 − a ) 2 + ( 3 − b ) 2 + ( c − a ) 2 + ( d − b ) 2 + ( c − 4 ) 2 + ( d − 4 ) 2 + ( c − 1 ) 2 + ( d − 5 ) 2 . The rest is a personal history...
Log in to reply
@Guillermo Templado – Wolframalpha is the best at those. :)
I have an question or doubt : In the "usual" euclidean plane, is there a workable general formula for connecting 4 or more points such that "the path" is the shortest? and if there are 4 points in the euclidean plane is able to there exist a "shortest path" connecting the 4 points composed by 7 line segments and 2 Steiner's points? I know there is an approximated algorithm NP-hard ...
Log in to reply
@Guillermo Templado – Define "workable general formula". Any network of shortest length must be a tree (otherwise at least one edge is redundant). If we consider a network between n towns obtained by adding a number of extra vertices, then we can show that each extra vertex is connected to at least 3 edges (If only 1 , the vertex does nothing, so can be deleted. If 2 , then this vertex can be deleted, and the two edges attached to it can be replaced by the straight line segment joining the other two ends). A simple edge-counting procedure now tells us that a minimum length network connecting n vertices requires at most 2 additional vertices.
If there are 2 additional vertices, then these will sit in one of the two Steiner configurations (which don't always exist). You have to show that a 5 -edge, 2 additional vertices, system is the only way in which to have a minimum-distance tree. Otherwise, the various possibilities with 0 or 1 additional vertex can be seen as degenerate versions of the 2 -additional vertex case.
Thus the shortest network is formed by a Steiner system, if it exists. You then need to consider what happens when a Steiner system does not exist. What often happens is that the shortest network is then one like the edges A B , B C and C D .
Indeed, when I first posted this problem, the point C had the coordinates given in its two predecessor problems. That was one of the degenerate cases, and that is why I moved C .
There are papers out there in cyberspace which categorise these options (try Googling for "Steiner systems" and "regular polygons").
Log in to reply
@Mark Hennings – Thank you very much, I'll "research" your words, and I'll try to answer to myself... I meant "workable general formula", as for example, the second degree polynomial equation has a general formula... ok, forget those words, your answer is impressive... thank you very much for your time, sorry...
Aye, same approach! -hifive-
Problem Loading...
Note Loading...
Set Loading...
If all possible Steiner points exist, the shortest network linking four points is obtained by joining up the points to two Steiner points within the quadrilateral formed by the vertices. To see how this works, pick points P , Q inside the quadrilateral rotate the triangle A P D through 6 0 ∘ about the point A to form the triangle A P 1 X , thereby creating the equilateral triangle A D X . Similarly, rotate the triangle C Q B through 6 0 ∘ about C to form the triangle C Q 1 Y and the equilateral triangle C B Y . Note that A P P 1 and C Q Q 1 are also equilateral triangles, and hence A P + D P + P Q + B Q + C Q = P P 1 + X P 1 + P Q + Q 1 Y + Q Q 1 ≥ X Y and so the length of any network formed by joining A , D to P , P to Q and B , C to Q is greater than or equal to the length X Y . Moreover, this length can be achieved if it is possible to choose P , Q such that P , Q , P 1 , Q 1 all lie on the line X Y . This will happen if the angles ∠ A P D , ∠ D P Q , ∠ Q P A , ∠ P Q B , ∠ B Q C and ∠ C Q P are all 1 2 0 ∘ . The first diagram above shows that this is possible. The second diagram also shows that it is possible to construct a pair of Steiner points if the vertices of the quadrilateral are to be joined in the other pairing. The minimum length of such a network is X ′ Y ′ . It remains to show which of X Y and X ′ Y ′ is the shorter.
It is easy to show that X , Y , X ′ , Y ′ have coordinates X X ′ ( 2 1 ( 1 − 3 3 ) , 2 1 ( 3 + 3 ) ) ( 2 1 ( 5 + 3 ) , 2 1 ( 1 − 5 3 ) ) Y Y ′ ( 2 1 ( 9 + 3 3 ) , 2 1 ( 5 + 3 ) ) ( 2 1 ( 5 − 3 ) , 2 1 ( 7 + 3 3 ) ) so that X Y = = ( 4 + 3 3 ) 2 + 1 2 4 4 + 2 4 3 X ′ Y ′ = = 3 2 + ( 3 + 4 3 ) 2 6 0 + 2 4 3 and so the shortest network has length X Y , making the answer 4 4 + 2 4 + 3 = 7 1 .