c# i want to calculate the lower distance between two points

Question

1.50/5 (2 votes)

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 19-Feb-13 11:35am

alexandrosok

Add a Solution

Comments

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

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

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

Sergey Alexandrovich Kryukov · Answer 1 · 2013-02-19T12:13:00

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