• Support PF! Buy your school textbooks, materials and every day products Here!

Minimum distance in within a quadrilateral

  • #1

Homework Statement


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.


Homework 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.

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.
 

Answers and Replies

  • #2
81
0
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.
 

Related Threads on Minimum distance in within a quadrilateral

  • Last Post
2
Replies
29
Views
6K
  • Last Post
Replies
1
Views
2K
Replies
10
Views
3K
Replies
8
Views
2K
  • Last Post
Replies
1
Views
883
Replies
9
Views
2K
Replies
5
Views
2K
Replies
8
Views
1K
Replies
1
Views
3K
  • Last Post
Replies
2
Views
6K
Top