'Circular sweep line' diaporamas de présentation

Last Time: Plane Sweep Algorithms, Segment Intersection, + (Element Uniqueness)

Last Time: Plane Sweep Algorithms, Segment Intersection, + (Element Uniqueness). This time: Planar Subdivisions. Eventually, get to problems such as intersection of planar subdivisions, and show that these algorithms are easier (more efficient) than general segment intersection.

268 views • 20 slides