The previous lecture showed various ways of finding points of intersection between a given set of line segments. The lecture 5 analysis an output sensitive algorithm. Lecture 6 introduces yet another interesting problem typical to computational geometry. We are given plane contains which contains many rectangles possibly overlapping.The objective is to calculate the total area coverage
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.