PureBasic Forums - English

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

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

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.

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!

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

We all have those days...

I have one of these years lately...