Databases
StackOverflow2013
Postsdbo
POAlgorithm to minimize distance variance between coordinates
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POAlgorithm to minimize distance variance between coordinates
    primarykey
    data
    text
    <p>I've been looking around for an algorithm that would optimize the distance between 2 list of coordinates and choose which coordinate should go together.</p> <p>Say I have List 1:</p> <pre><code>205|200 220|210 200|220 200|180 </code></pre> <p>List 2:</p> <pre><code>210|200 207|190 230|200 234|190 </code></pre> <p>Calculated Distance between Coords:</p> <pre><code>205|200 to 210|200 == 5.00 205|200 to 207|190 == 10.20 205|200 to 230|200 == 25.00 205|200 to 234|190 == 30.68 220|210 to 210|200 == 14.14 220|210 to 207|190 == 23.85 220|210 to 230|200 == 14.14 220|210 to 234|190 == 24.41 200|220 to 210|200 == 22.36 200|220 to 207|190 == 30.81 200|220 to 230|200 == 36.06 200|220 to 234|190 == 45.34 200|180 to 210|200 == 22.36 200|180 to 207|190 == 12.21 200|180 to 230|200 == 36.06 200|180 to 234|190 == 35.44 </code></pre> <p>This Algorithm would pick:</p> <pre><code>205|200 to 230|200 == 25.00 220|210 to 207|190 == 23.85 200|220 to 210|200 == 22.36 200|180 to 234|190 == 35.44 </code></pre> <p>The Algorithm would pick these numbers as they would be the group that would have the littlest variance between the distance. Conditions:</p> <ol> <li>A Coordinate may only be used ones from each list</li> <li>If List 1 or List2 is larger than it still only uses each coordinate once, but it tries to get the smallest distance variance and does nothing with the unused coordinates.</li> </ol> <p>If you need more clarification please ask.</p> <p>P.S. I've looked at the Hungarian algorithm and it seems like it will sort of do the job, but not exactly how I was expecting. The Hungarian algorithm will only try and make the least distance from all the coordinates, which can mean the smallest variance, but not every time as variance is more important here then least distance optimization.</p>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USbasicxman
    1. USSteven10172
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POAlgorithm to minimize distance variance between coordinates
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POAlgorithm to minimize distance variance between coordinates
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POAlgorithm to minimize distance variance between coordinates
      1. USdasblinkenlight
      1. VTFavorite
    1. This table or related slice is empty.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload