Your question is Rectangle Intersection Check. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
Groq's geometry utilities need to determine whether two rectangular regions overlap in any way. Given the four vertices of each rectangle, return True if the rectangles overlap or touch, and False otherwise.
The vertices within each rectangle are provided in arbitrary order. Each rectangle has positive area, and its four points are guaranteed to form a valid rectangle. Touching at an edge, corner, or any boundary point counts as an intersection.
Implement intersect_rectangles(rect1, rect2), where rect1 and rect2 are lists containing exactly four points. Each point is a two-element list [x, y], and all coordinates are integers. Return a boolean.
Use the separating axis theorem: two convex polygons do not intersect if some axis, perpendicular to an edge of either polygon, separates their projections.
def intersect_rectangles(rect1, rect2):