<\/p>\nToday’s challenge is one where you need to figure out if two rectangles have a non-zero area of overlap.<\/p>\n
The rectangles will be specified as follows:<\/p>\n
<\/p>\n
Just fill in your part of the code until you get the binary variable overlap defined.<\/p>\n
\nax = sort(rand(1,2));\nay = sort(rand(1,2));\nbx = sort(rand(1,2));\nby = sort(rand(1,2));\n\nclf\nrectangle('position',[ax(1) ay(1) diff(ax) diff(ay)], 'edgecolor', 'r')\nhold on\nrectangle('position',[bx(1) by(1) diff(bx) diff(by)], 'edgecolor', 'k')\naxis equal\n\n\n%your code here\n\noverlap = %1 for overlap, 0 for non-overlapping<\/code><\/pre>\nWhen you post your code in the comments, please use the tags<\/p>\n
\n<pre> <code>\n\nall the code so someone can just copy and paste it from the comments.\n\n<\/code> <\/pre>\n<\/code><\/pre>\nMy solution is already posted.<\/p>\n","protected":false},"excerpt":{"rendered":"
Today’s challenge is one where you need to figure out if two rectangles have a non-zero area of overlap.
\nThe rectangles will be specified as follows:<\/p>\n