Fdtxjr

How could indestructible materials be used in power generation?

Extract rows of a table, that include less than x NULLs

What mechanic is there to disable a threat instead of killing it?

What's the in-universe reasoning behind sorcerers needing material components?

How can saying a song's name be a copyright violation?

What is a romance in Latin?

How to tell a function to use the default argument values?

Plagiarism or not?

Is there an expression that means doing something right before you will need it rather than doing it in case you might need it?

How to show a landlord what we have in savings?

Valid term from quadratic sequence?

Unlock My Phone! February 2018

Why was the shrinking from 8″ made only to 5.25″ and not smaller (4″ or less)?

Should I cover my bicycle overnight while bikepacking?

What about the virus in 12 Monkeys?

How writing a dominant 7 sus4 chord in RNA ( Vsus7 chord in the 1st inversion)

Alternative to sending password over mail?

Am I breaking OOP practice with this architecture?

What are some good books on Machine Learning and AI like Krugman, Wells and Graddy's "Essentials of Economics"

Do UK voters know if their MP will be the Speaker of the House?

Do scales need to be in alphabetical order?

Bullying boss launched a smear campaign and made me unemployable

How can I deal with my CEO asking me to hire someone with a higher salary than me, a co-founder?

Arrow those variables!

Steiner tree to minimise travelling distance: Building roads to connect a network of points

Connecting square vertexes with minimal roadIs the layout of Burning Man's city “grid” optimal?Find the minimum sum of distances of a point in x-y plane.Gerrymandering on a high-genus surface/can I use my powers for evil?Maximizing the number of non-crossing lines between a number of pointsoptimal road layout problem - how to convert to maths and see the shapes it makes?Shortest system of roads between 4 citiesGiven distances (shortest paths) between four cities, how to show that they cannot be in the same plane?Why is the shortest distance between two circles along the segment connecting their centers?Heilbronn problem on Unit SphereIs the set of paths between any two points moving only in units on the plane countable or uncountable?

0

$begingroup$

Suppose we have four points in a unit square, as described in the question here. We are tasked with building a network of roads that connect all the cities. The travelling distance (T) of this network is defined as the sum of the distance you must travel along a road to get from point A to B, and point A to C, ... and all six combinations of points.

Suppose we're given a certain budget, which will enable us to construct a length L of roads. Where should we build the roads, to minimise T? And what is the relation between L and T?

As the question linked to above describes, there are no solutions possible if L < 1+√3. When L = 1+√3, it is only possible to construct one network to connect all the cities (the first option in the diagram below). Here, T = 2*(2/√3) + 4*(1+1/√3) = 4 + 8/√3 = 8.6188...

If we were given slightly more budget, the best use (I believe) would be to shift the two junction points slightly closer together. Once L = 2√2, the network simplifies to two roads, from A to C, and B to D, and now T = 6√2 (the second option in the diagram below).

Then, as L increases, the optimal network evolves - each infinitesimal unit of road seems to reduce T by approximately 0.76 units. Once L = 4 + 2√2 , we can construct a network that connects each point to the other, and T = 4 + 2√2.

But is this process which I show in the diagram the optimal process? And what would the general process be if there was a larger network of cities?

geometry optimization euclidean-geometry

share|cite|improve this question

asked Mar 21 at 5:01

Thomas DelaneyThomas Delaney

62139

$endgroup$

add a comment | 

0

$begingroup$

Suppose we have four points in a unit square, as described in the question here. We are tasked with building a network of roads that connect all the cities. The travelling distance (T) of this network is defined as the sum of the distance you must travel along a road to get from point A to B, and point A to C, ... and all six combinations of points.

Suppose we're given a certain budget, which will enable us to construct a length L of roads. Where should we build the roads, to minimise T? And what is the relation between L and T?

As the question linked to above describes, there are no solutions possible if L < 1+√3. When L = 1+√3, it is only possible to construct one network to connect all the cities (the first option in the diagram below). Here, T = 2*(2/√3) + 4*(1+1/√3) = 4 + 8/√3 = 8.6188...

If we were given slightly more budget, the best use (I believe) would be to shift the two junction points slightly closer together. Once L = 2√2, the network simplifies to two roads, from A to C, and B to D, and now T = 6√2 (the second option in the diagram below).

Then, as L increases, the optimal network evolves - each infinitesimal unit of road seems to reduce T by approximately 0.76 units. Once L = 4 + 2√2 , we can construct a network that connects each point to the other, and T = 4 + 2√2.

But is this process which I show in the diagram the optimal process? And what would the general process be if there was a larger network of cities?

geometry optimization euclidean-geometry

share|cite|improve this question

asked Mar 21 at 5:01

Thomas DelaneyThomas Delaney

62139

$endgroup$

add a comment | 

$begingroup$

Suppose we have four points in a unit square, as described in the question here. We are tasked with building a network of roads that connect all the cities. The travelling distance (T) of this network is defined as the sum of the distance you must travel along a road to get from point A to B, and point A to C, ... and all six combinations of points.

Suppose we're given a certain budget, which will enable us to construct a length L of roads. Where should we build the roads, to minimise T? And what is the relation between L and T?

As the question linked to above describes, there are no solutions possible if L < 1+√3. When L = 1+√3, it is only possible to construct one network to connect all the cities (the first option in the diagram below). Here, T = 2*(2/√3) + 4*(1+1/√3) = 4 + 8/√3 = 8.6188...

If we were given slightly more budget, the best use (I believe) would be to shift the two junction points slightly closer together. Once L = 2√2, the network simplifies to two roads, from A to C, and B to D, and now T = 6√2 (the second option in the diagram below).

Then, as L increases, the optimal network evolves - each infinitesimal unit of road seems to reduce T by approximately 0.76 units. Once L = 4 + 2√2 , we can construct a network that connects each point to the other, and T = 4 + 2√2.

But is this process which I show in the diagram the optimal process? And what would the general process be if there was a larger network of cities?

geometry optimization euclidean-geometry

share|cite|improve this question

asked Mar 21 at 5:01

Thomas DelaneyThomas Delaney

62139

$endgroup$

share|cite|improve this question

asked Mar 21 at 5:01

Thomas DelaneyThomas Delaney

62139

share|cite|improve this question

asked Mar 21 at 5:01

Thomas DelaneyThomas Delaney

62139

asked Mar 21 at 5:01

Thomas DelaneyThomas Delaney

62139

asked Mar 21 at 5:01

Thomas DelaneyThomas Delaney

62139