Course abstract
The course covers lessons in Introduction using Basic Visibility Problems , The Maximal Points Problem ,The Plane Sweep Technique and applications ,Convex Hull Different Paradigms and Quickhull , Dual Transformation and Applications , Lower Bounds on Algebraic tree model , Point Location and Triangulation , Voronoi Diagram and Delaunay Triangulation , Randomized Incremental Construction and Random Sampling ,Arrangements and Levels , Range Searching , Clustering Point Sets using Quadtrees and Applications , Epsilon-Nets VC Dimension and Applications , Shape Analysis and Shape Comparison .
Course Instructor
Prof. Amit Kumar
Amit Kumar is "Tarwinder and Jaswinder Chadha" Chair Professor in the Dept. of Computer Science and Engineering at IIT Delhi. He obtained B.Tech. degree from IIT Kanpur in 1997 and Ph.D. from Cornell University in 2002. He works in the area of combinatorial optimization, with emphasis on problems arising in scheduling, graph theory and clustering. He received IBM Faculty Award in 2005, INAE (Indian National Academy of Engineering) Young Engineer Award in 2006 and INSA (Indian National Science Academy) Medal for Young Scientists in 2011. He was a Max Planck-India partner group research fellow during 2005-09. He received the prestigious Shanti Swarup Bhatnagar Award for Mathematical Sciences in 2018, and was elected Fellow of Indian Academy of Sciences in 2019.More info
Teaching Assistant(s)
No teaching assistant data available for this course yetCourse Duration : Jan-Apr 2022
View Course
Enrollment : 14-Nov-2021 to 31-Jan-2022
Exam registration : 13-Dec-2021 to 18-Mar-2022
Exam Date : 23-Apr-2022
Enrolled
Will be announced
Registered
Will be announced
Certificate Eligible
Will be announced
Certified Category Count
Gold
Will be announced
Silver
Will be announced
Elite
Will be announced
Successfully completed
Will be announced
Participation
Will be announced
Success
.jpg)
Category : Successfully Completed
Elite
.jpg)
Category : Elite
Gold
.jpg)
Category : Gold