Mastering Computational Geometry with C++

计算几何算法在计算机游戏、计算机模拟、计算机图形、CAD/CAM 软件、导航系统和更多日常应用等领域有大量应用。但是属于这一类的数据结构和算法仍然被认为是专业领域，因为它们继承了复杂性。要精通计算几何，您至少需要以下知识。

通过线性代数和几何表示的知识。

几何形状的数学表示。

原始测试的计算步骤，如交集和距离查询。

对计算几何中的算法以及在何处使用这些算法有很好的理解。

在本课程中，我将涵盖所有必需的知识，使您能够流利并自信地掌握计算几何。

Learn, Analyze and Simulate Computational geometry algorithm in C++

MP4 | Video: h264, 1280×720 | Audio: AAC, 44.1 KHz, 2 Ch
Genre: eLearning | Language: English + srt | Duration: 79 lectures (10h 23m) | Size: 2.53 GB

What you’ll learn:
Applications of Computational Geometry algorithms.
Able to implement Computation Geometry algorithms with C++
Precision and Performance concern and how to solve them when implementing Computational Geometry Algorithms
Solid understanding on Mathematics and the interpretation of Mathematics behind Computational Geometry
Solid understanding on Vector algebra to be using in Computational Geometry.

Requirements
Knowledge on basic data structures and algorithms will be helpful.
Hands on experience with any programming language

Description
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

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

Mathematical representation of basic geometry primitives and implementation.

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

Orientation test on geometric primitives.

Polygon triangulation.

Monotone polygon partition.

Plane sweep algorithms.

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

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

KD Tree implementation and range queries using KDTrees.

Range Trees..

Graph Theory

Who this course is for
Algorithm enthusiasts.
Competitive Programmers.
Anyone who seek advanced real-world applications of algorithms
University students
Software developers