Exercises

Exercise: Write a method and that computes the region representing the intersection of two regions.

Exercise: Write a method contains$\_,$ which checks whether a n$-$dimensional point belongs to the region. Remember, a point belongs to the region if it belongs to one of the rectangles in the region.

Membership of a point in a region

$"$@title Membership of a point in a region

def rectangle$\_$contains$($self$,$ P$)$:

Region.$\_$contains $=$ region$\_$contains

Traceback $($most recent call last$)$:

File $"(0,2),(0,3)(4,6),(5,8)(2,1)(0,1),(0,3)(4,6),(5,8)(2,1)in$ Region$(Rectangle((0,2),(0,3)),$ Rectangle$((4,6),(5,8)))$

assert $(2,1)$ not $in$ Region$(Rectangle(0,1),(0,3)),$ Rectangle $(4,6),(5,8)$