Skip to main content
Article thumbnail
Location of Repository



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

Year: 2010
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.