Subject:
Computer Science (CS)
Catalog number:
763
Unit weight:
0.50
Meet type:
LEC
Grading basis:
NUM
Cross-listing(s):
N/A
Requisites:
Antireq: CS 760M
Description:
Introduction to the design, analysis and application of algorithms for geometric problems. Topics include convex hull algorithms in two and three dimensions; Voronoi diagrams, Delaunay triangulations, and their applications; linear programming in low dimensions; line segments, planar subdivision, and polygons; range searching.
Topic titles:
N/A
Faculty:
Mathematics (MAT)
Academic level:
GRD
Course ID:
011297
