Unit
|
Topic
|
Proposed Lectures
|
I
|
Convex
hulls: construction In 2d and 3d. lower bounds; |
8
|
II
|
Voronoi
diagrams: construction and applications, variants; Delayney
triangulations: divide-and-conquer. flip and
incremental algorithms duality of voronoi diagrams.
min-max angle properties |
8
|
III
|
Geometric
searching point-location, fractional cascading, linear |
8
|
IV |
Arrangements
of lines: arrangements of hyper planes, zone theorems, many-faces complexity
and algorithms: Combinatorial geometry: |
8
|
V
|
Code
Generation: Design Issues, the Target Language. Addresses |
8
|
Textbooks:
|