Learn · Computational Geometry

Lecture 33 of 40Clustering Point Sets using Quadtrees and Applications

Construction of Epsilon - WSPD

Prof. Amit Kumar · IIT Delhi

Credits and licence

From
Computational Geometry, IIT Delhi (at NPTEL)
Licence
CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
Attribution
NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
Who can watch
Tweens profiles and older. How courses are placed

All the lectures

  1. Introduction Video
  2. Visibility Problems Video
  3. 2D Maxima Video
  4. Line Sweep Method Video
  5. Segment Intersection Problem Video
  6. Line Sweep: Rectangle Union Video
  7. Convex Hull Video
  8. Convex Hull Contd Video
  9. Quick Hull Video
  10. More Convex Hull Algorithms Video
  11. Intersection of Half Planes and Duality Video
  12. Intersection of Half Planes and Duality Contd Video
  13. Lower Bounds Video
  14. Planar Point Location Video
  15. Point Location and Triangulation Contd... Video
  16. Triangulation of Arbitrary Polygon. Video
  17. Voronoi Diagram : Properties Video
  18. Voronoi Diagram Construction Video
  19. Delaunay Triangulation. Video
  20. Quick sort and Backward Analysis Video
  21. Generalized RIC Video
  22. RIC Continued Video
  23. Arrangements Video
  24. Zone Theorem and Application Video
  25. Levels Video
  26. Range Searching : Introduction Video
  27. Orthogonal Range searching Video
  28. Priority Search Trees Video
  29. Non - Orthogonal Range Searching Video
  30. Half - Plane Range Query Video
  31. Well Separated Partitioning Video
  32. Quadtrees Epsilon -WSPD Video
  33. Construction of Epsilon - WSPD Video
  34. Epsilon - WSPD to Geometric Spanner Video
  35. Epsilon-Nets & VC Dimension Video
  36. Epsilon-Nets & VC Dimension contd Video
  37. Geometric Set Cover Video
  38. Geometric Set Cover (with Bounded VC Dimension) Video
  39. Shape Representation Video
  40. Shape Comparison Video