Previous | Next --- Slide 33 of 70
Back to Lecture Thumbnails

Can I know how to decide when should I use which basic operation given a complicated shape?


If these shapes are represented as a cluster of points or even a polynomial, how does the computer determine what to store as filled/empty when performing a union/intersection.


Is it computationally expensive to rasterize shapes when they are represented by a chain of booleans?