1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Minimum distance in within a quadrilateral

  1. Mar 12, 2009 #1
    1. The problem statement, all variables and given/known data
    Let A, B, C, D be the vertices of a convex quadrilateral. Convexity means that for each lines L(ab), L(bc), L(cd), L(da) the quadrilateral lies in one of its half-planes. Find the point P for which the minimum Min(d(P,A)+d(P,B)+d(P,C)+d(P,D)) is realized.


    2. Relevant equations
    Min(d(P,A)+d(P,B)+d(P,C)+d(P,D)) is the equation we're trying to minimize.
    distance=d(X,Y)=abs(X-Y)=sqrt((X-Y)x(X-Y)) where "x" is the dot product.

    3. The attempt at a solution
    For starters, this is for my Euclidean geometry class, so there's no coordinates or Calculus, I presume. My initial guess is that the point that would minimize those distances would be the intersection of the diagonals but I can't figure out why.
     
  2. jcsd
  3. Mar 12, 2009 #2
    I think you are probably right about the intersection of the diagonals. I'm not sure of a mathematical way to prove this, but I believe you can show that moving away from that point increase the sum of the lengths of those four lines. I can think of a few examples.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Minimum distance in within a quadrilateral
  1. Minimum distance (Replies: 29)

Loading...