CSC437

Download as PDF

CSC437 - Geometric Algorithms

Computer Science Undergraduate UA - UA General

Course Description

The study of algorithms for geometric objects, using a computational geometry approach, with an emphasis on applications for graphics, VLSI, GIS, robotics, and sensor networks. Topics may include the representation and overlaying of maps, finding nearest neighbors, solving linear programming problems, and searching geometric databases.

Min Units

3

Max Units

3

Repeatable for Credit

No

Grading Basis

GRD - Regular Grades A, B, C, D, E

Career

Undergraduate

Course Attributes

WE - WEC (Writing Emphasis Course)

Enrollment Requirements

017104

May be convened with

CSC537

Name

Discussion

Workload Hours

0

Optional Component

Yes

Name

Lecture

Workload Hours

3

Optional Component

No

Typically Offered Main Campus

Fall

Typically Offered Distance Campus

Not Offered

Typically Offered UA Online Campus

Not Offered

Typically Offered Phoenix Campus

Not Offered

Typically Offered South Campus

Not Offered

Typically Offered Community Campus

Not Offered