Lecture 7 - CS409

Heaps, Applications of PQs, Choosing a PQ

2/16/99


Click here to start


Table of Contents

To Build a Heap

Efficient Heap Building

Other Heap Operations

Another PQ Implementation

PQ Application: Simulation

PQ (and Balanced Tree) Application: Line Segment Intersection

Idea: Use a Sweepline

Sweepline Intuition

Sweepline Events

A Sweepline Program

Adjacency using a Balanced Tree

Selecting a Priority Queue Scheme

Author: Paul Chew

Home Page: http://www.cs.cornell.edu/cs409-sp99/