15,798,592 members
See more:
i wrote that code to calculate the distance between two point any one can gime a tip how to get the minimun distance between these point -not the max - ^^

thanks a lot

XML
```int distanceX;
int distanceY;

int index = 0;
int max_index = 0;
int shortd=0;

double total_distance;
double max_distance = 0;

List<PointPixel> ppList1 = new List<PointPixel>();
List<PointPixel> ppList2 = new List<PointPixel>();```

C#
```ppList1.Insert(index, getPointPixel(plist, h));
ppList2.Insert(index, getPointPixel(plist, g));

distanceX = ppList1.ElementAt(index).getX() - ppList2.ElementAt(index).getX();
distanceY = ppList1.ElementAt(index).getY() - ppList2.ElementAt(index).getY();
total_distance = Math.Pow((double)distanceX, 2) + Math.Pow((double)distanceY, 2);
total_distance = Math.Sqrt(total_distance);
total_distance = Math.Round(total_distance, 2);

if (total_distance > max_distance)
{
max_distance = total_distance;
max_index = index;
}

index++;```
Posted
Zoltán Zörgő 19-Feb-13 17:42pm
You need the minimum distance between the two point lists? Since there is only one distance between two singular points.
alexandrosok 19-Feb-13 17:47pm
i use the lists to insert the pair inside like list1(x,y) compared with list2(x,y) i found the max distance but my brain i stuck and i want to find the minimum distance
Sergey Alexandrovich Kryukov 19-Feb-13 18:08pm
There is no algorithmic difference between max and min... :-)
—SA
Sergey Alexandrovich Kryukov 19-Feb-13 18:07pm
There is only one Cartesian distance between two points, no minimum, maximum or something else.
—SA

## Solution 1

Use the following feature: `double.PositiveInfinity` as a starting value, if you want to find minimum, and `double.NegativeInfinity`, if you want to find maximum:
http://msdn.microsoft.com/en-us/library/system.double.positiveinfinity.aspx[^],
http://msdn.microsoft.com/en-us/library/system.double.negativeinfinity.aspx[^].

Cycle through all possible pairs of point and find the distance between them, compare with current minimum and decrease the current minimum if the distance is smaller. The opposite with maximum. When iterations are done, your current minimum will be the answer. Same thing with maximum.

—SA

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Top Experts
Last 24hrsThis month
 Dave Kreskowiak 70 Bassam Abdul-Baki 46 Kenneth Haugland 45 KarstenK 35 Maciej Los 30
 Richard Deeming 538 Dave Kreskowiak 455 Maciej Los 380 Andre Oosthuizen 360 Richard MacCutchan 263

CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900