challenge - find nearest corners of two boxes

blueznl · Post by **blueznl** » Sat Jan 28, 2006 9:28 pm

here's a nice one: imagine you have two boxes, with known coordinates and sizes x1,y1,w1,h1 and x2,y2,w2,h2

these two are non-overlapping

now how can you find the two corners that are nearest to each other? (that's one corner on each box, obviously

)

for bonus points, how do you check if they are not overlapping?

sorry, no price attached

Joakim Christiansen · Post by **Joakim Christiansen** » Sat Jan 28, 2006 9:37 pm

Want us to do your homework?
I bet I could work out something, but not at the moment...

Trond · Post by **Trond** » Sat Jan 28, 2006 9:39 pm

I don't understand the problem. Do you mean like finding the two circled corners because they are the ones that are closest to each other?

That's simple, simply loop through all the distances and check which is the shortest.

Joakim Christiansen · Post by **Joakim Christiansen** » Sat Jan 28, 2006 9:46 pm

Trond wrote:I don't understand the problem. Do you mean like finding the two circled corners because they are the ones that are closest to each other?

That's simple, simply loop through all the distances and check which is the shortest.

That's what I was thinking too!

blueznl · Post by **blueznl** » Sun Jan 29, 2006 12:02 am

well, that's actually the way i solved it now, but that was after a long detour thinking up all sorts of wrong solutions

i was wondering if other people would be smarter than that (appearently: yes

)

checking if two rectangles overlap provided to be surprisingly easy though...

Joakim Christiansen · Post by **Joakim Christiansen** » Sun Jan 29, 2006 1:16 am

We all have those days...

El_Choni · Post by **El_Choni** » Sun Jan 29, 2006 3:36 am

I have one of these years lately...