Computational geometry is a branch of computer science that deals with algorithms and data structures for solving geometric problems. It involves the study of geometric objects such as points, lines, curves, and surfaces and their relationships. Some examples of problems that can be addressed with computational geometry include Finding the intersection points of two lines or curves, Computing the convex hull of a set of issues, Determining whether a point lies inside a polygon or not, Finding the closest pair of points in a group, Computing the shortest path between two points in a geometric network. Computational geometry has applications in various fields, including computer graphics, computer-aided design (CAD), robotics, geographic information systems (GIS), and computational biology. It is also used in computer vision, pattern recognition, and machine learning.

* Lectures: Wednesday (10:00 am-10:55 am in CSE 107), Thursday (9:00 am - 9:55 am in Old Seminar room) and Friday (11:00 am - 12:55 pm in CSE 107) * Venue: Classroom CSE-107: First lecture January 04, 2023, at 10 am in CSE 107

General Information