CSC274b
Spring 2000
Ileana Streinu
Lecture 16
Tuesday, March 28, 2000
- Line Arrangements. Ch. 6. (6.1, 6.2, 6.3). Combinatorial
properties: nr. of vertices, edges, faces. Zone Theorem (without proof).
- Next lecture: Data Structures for representing planar
graphs/arrangements/polyhedral boundaries. Ch. 4.4.
- Today, Algorithms for constructing an arrangement: sweep, incremental.
Last modified March 28, 2000.