-
Computational Geometry(FALL_2018)
Aims:
Design and analysis of algorithms for geometric problems
Syllabus:
- Art Gallery and Visibility
- Polygon Partitioning
- Convex Hulls
- Arrangements
- Intersection and Search/
-
Text Book:
- Computational Geometry, Algorithms and ApplicationsM. de Berg, M.van Krevold , 2008
-
Computer Gemetrical Design(FALL_2018)
Aims:
This course helps undergraduate students to improve their ability of designing algotithms for geometrical and graphical problems.
- Insert the additive algorithms: insertion sort, find a convex surface (surface additive), triangulation monotone polygons.
-
Plane Sweep Algorithm Finding the intersections of line segmentsFinding convex hulls: insertion hull revisitedContour of union of Rectangles.
- Spatial Subdivision1. The Range Searching Problems2. Kd (kd-Trees)3. The Grid Method4.Quadtrees5 2D Search Trees6. Removing Hidden Surfaces 7.Rang Trees, fractional cascading
Text Book:
- Computational Geometry and Computer Graphics in C++(Michael J. Laszlo) (2005).
- Computational Geometry in C, Joseph ORourke, Cambridge University Press, (1994).
- Principles of Management(FALL_2018)
- Special Topics in Computational Geometry (SPRING_2018)
- Topology (II)(SPRING_2018)
- Computational Geometry(FALL_2017)
- Computer Geometrical Design(FALL_2017)
|
|