Computational Geometry | Algorithms, Data Structures, IIT Delhi

Explore the fundamentals of computational geometry, including convex hulls, Voronoi diagrams, and Delaunay triangulations. Taught by experienced faculty from IIT Delhi.

Introduction

Computational Geometry is a branch of computer science that deals with the study of algorithms and data structures for solving geometric problems. This course covers various topics in computational geometry, including convex hulls, Voronoi diagrams, Delaunay triangulations, and geometric data structures.

Highlights

• Covers fundamental concepts and algorithms in computational geometry
• Emphasizes practical applications and implementation aspects
• Includes hands-on programming assignments and projects
• Taught by experienced faculty from IIT Delhi

Recommendation

This course is recommended for students and professionals interested in algorithms, data structures, and their applications in various fields, such as computer graphics, robotics, and geographic information systems. It provides a solid foundation in computational geometry and equips learners with the necessary skills to tackle complex geometric problems.