Fall
2007
CSc 437/537 Geometric Algorithms
TuThu 5:00-6:15, GS W906
Revierw - Sunday 6 at GS 906 . Materials - here
Course Description
The course surveys a list of geometric algorithms and
geometric data structure. These algorithms are useful for solving problems in
areas such as Visualization, Geographic Information Systems (GIS), VLSI,
Robotics, Computer Graphics, Computer Vision, and many other areas. Many of
these algorithms are elegant and clever, and have ethtetical value on their
own. We would tailor the material of the course to the interests of the
participants. Some of the question that would be addressed in the course are
- How to efficiently compute the
shortest path of a robot in a room full of obstacles.
- Given a map of rivers and a map of
roads, find all the points where a road crosses a river.
- How to simplify a map, or a curve of
a function, without loosing too much of the information.
- Efficient way to compare shapes, for
pattern recognition purposes.
- Robustness issues - how to avoid
numerical errors that mislead the algorithm.
Revierw - Sunday 6 at GS 906 . Materials - here
Course Description
The course surveys a list of geometric algorithms and geometric data structure. These algorithms are useful for solving problems in areas such as Visualization, Geographic Information Systems (GIS), VLSI, Robotics, Computer Graphics, Computer Vision, and many other areas. Many of these algorithms are elegant and clever, and have ethtetical value on their own. We would tailor the material of the course to the interests of the participants. Some of the question that would be addressed in the course are
- How to efficiently compute the
shortest path of a robot in a room full of obstacles.
- Given a map of rivers and a map of
roads, find all the points where a road crosses a river.
- How to simplify a map, or a curve of
a function, without loosing too much of the information.
- Efficient way to compare shapes, for
pattern recognition purposes.
- Robustness issues - how to avoid
numerical errors that mislead the algorithm.