Mastering Computational Geometry Algorithms with C++

Computational Geometry algorithms have tons of applications in the fields like computer games, computer simulation, computer graphic, CAD/CAM software's, Navigation systems and many more day to day applications. But the data structure and algorithms fall under this category is still considered specialized area due to inherit complexities of those. To become fluent in computational geometry you need at least following knowledge.

• Through knowledge on linear algebra and geometrical representation of  those.

• Mathematical representation of  geometrical shapes.

• Computational steps for primitive test like intersection and distance queries.

• Good understanding on algorithms in computational geometry and where to use those.

In this course I will cover all the required knowledge for you to be fluent and confident on Computational Geometry. Following are the topic expected to cover in this course.

Topics

1. Basics of linear algebra including vector and matrix arithmetic and implementation of those operations.

2. Mathematical representation of basic geometry primitives and implementation.

3. Computational approach for finding intersections and distance between basic primitives like rectangles, lines, planes etc.

4. Orientation test on geometric primitives.

5. Polygon triangulation.

6. Monotone polygon partition.

7. Plane sweep algorithms.

8. Convex hull calculations and implementation in both 2D and 3D space.

9. Overview of simple tree data structures like Binary Search Trees (BST) and Red Black Tree (RBT)

10. KD Tree implementation and range queries using KDTrees.

11. Range Trees..

12. Graph Theory