voronoi diagram


This is an introductory course on computational geometry and its applications. We will discuss techniques needed in designing and analyzing efficient algorithms and data structures for computational problems in discrete geometry, such as convex hulls, geometric intersections, geometric structures such as Voronoi diagrams and Delaunay triangulations, arrangements of lines and hyperplanes, and range searching.

For further information, please see the course syllabus.

General Information

Class TimeTue, Thu 12:30-1:45pm
LocationCSI 3120
Instructor Dave Mount
Email mount@cs.umd.edu
Office AVW 3373
Office Hours Mon 2:00-3:00, Wed 3:00-4:00 (or by appointment)

-   CMSC 754 Home   -