Computational Geometry

Computational Geometry

@VTU COE

0.0
(0) 0 Students
Download Brochure

What you will learn

  • none

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 .

img
No Discussion Found

0.0

0 Reviews

5
0
4
0
3
0
2
0
1
0
Meet Your Instructor

Instructor
3.2 Rating
5446 Students
800 Courses
About Instructor

VTU is one of the largest Technological Universities in India with 24 years of Tradition of excellence in Engineering & Technical Education, Research and Innovations. It came into existence in the year 1998 to cater the needs of Indian industries for trained technical manpower with practical experience and sound theoretical knowledge.

video

Free

  • Course Duration
    36 h 34 m 17 s
  • Course Level
    Intermediate
  • Student Enrolled
    0
  • Language
    English
This Course Includes
  • 36 h 34 m 17 s Video Lectures
  • 0 Quizzes
  • 0 Assignments
  • 0 Downloadable Resources
  • Full Lifetime Access
  • Certificate of Completion