Computational Geometry
3 Credit Hour Course
Intended For Level 4 Term 2 Students
Prerequisite:
CSE207
Algorithm and complexity of fundamental geometric objects:
polygon triangulations and art gallery theorem, polygon partitioning,
convex hulls in 2-dimension.
Proximity: Voronoi diagrams and Delaunary triangulations.
Graph Drawing: drawing styles and applications, drawing of rooted trees, straight line drawing of planar graph
- Teacher: Radi Muhammad Reza