Modules / Lectures
Module NameDownloadDescriptionDownload Size
Introduction using Basic Visibility ProblemsFAQs of Module1Introduction using basic visibility problems113
The Plane Sweep Technique and applicationsFAQs of Module3The plane sweep technique and applications111
Convex Hull Different Paradigms and QuickhullFAQs of Module4Convex hull different paradigms and quickhull133
Dual Transformation and ApplicationsFAQs of Module5Dual transformation and applications43
Lower Bounds on Algebraic tree modelFAQs of Module6Lower bounds on algebraic tree model82
Point Location and TriangulationFAQs of Module7Point location and triangulation66
Voronoi Diagram and Delaunay TriangulationFAQs of Module8Voronoi diagram and delaunay triangulation129
Randomized Incremental Construction and Random SamplingFAQs of Module9Randomized incremental construction and random sampling64
Arrangements and LevelsFAQs of Module10Arrangements and levels88
Range SearchingFAQs of Module11Range searching91
Clustering Point Sets using Quadtrees and ApplicationsFAQs of Module12Clustering point sets using quadtrees and applications101
Epsilon-Nets VC Dimension and ApplicationsFAQs of Module13E-nets VC dimension and applications115


Sl.No Chapter Name MP4 Download
1IntroductionDownload
2Visibility ProblemsDownload
32D MaximaDownload
4Line Sweep MethodDownload
5Segment Intersection ProblemDownload
6Line Sweep: Rectangle UnionDownload
7Convex HullDownload
8Convex Hull ContdDownload
9Quick HullDownload
10More Convex Hull AlgorithmsDownload
11Intersection of Half Planes and DualityDownload
12Intersection of Half Planes and Duality ContdDownload
13Lower BoundsDownload
14Planar Point LocationDownload
15Point Location and Triangulation Contd...Download
16Triangulation of Arbitrary Polygon.Download
17Voronoi Diagram : PropertiesDownload
18Voronoi Diagram ConstructionDownload
19Delaunay Triangulation.Download
20Quick sort and Backward AnalysisDownload
21Generalized RICDownload
22RIC ContinuedDownload
23ArrangementsDownload
24Zone Theorem and ApplicationDownload
25LevelsDownload
26Range Searching : IntroductionDownload
27Orthogonal Range searching Download
28Priority Search TreesDownload
29Non - Orthogonal Range SearchingDownload
30Half - Plane Range QueryDownload
31Well Separated PartitioningDownload
32Quadtrees Epsilon -WSPDDownload
33Construction of Epsilon - WSPDDownload
34Epsilon - WSPD to Geometric SpannerDownload
35Epsilon-Nets & VC DimensionDownload
36Epsilon-Nets & VC Dimension contdDownload
37Geometric Set CoverDownload
38Geometric Set Cover (with Bounded VC Dimension)Download
39Shape RepresentationDownload
40Shape ComparisonDownload

Sl.No Chapter Name English
1IntroductionDownload
To be verified
2Visibility ProblemsDownload
To be verified
32D MaximaDownload
To be verified
4Line Sweep MethodDownload
To be verified
5Segment Intersection ProblemDownload
To be verified
6Line Sweep: Rectangle UnionDownload
To be verified
7Convex HullDownload
To be verified
8Convex Hull ContdDownload
To be verified
9Quick HullDownload
To be verified
10More Convex Hull AlgorithmsDownload
To be verified
11Intersection of Half Planes and DualityDownload
To be verified
12Intersection of Half Planes and Duality ContdDownload
To be verified
13Lower BoundsDownload
To be verified
14Planar Point LocationDownload
To be verified
15Point Location and Triangulation Contd...Download
To be verified
16Triangulation of Arbitrary Polygon.Download
To be verified
17Voronoi Diagram : PropertiesDownload
To be verified
18Voronoi Diagram ConstructionDownload
To be verified
19Delaunay Triangulation.Download
To be verified
20Quick sort and Backward AnalysisDownload
To be verified
21Generalized RICDownload
To be verified
22RIC ContinuedDownload
To be verified
23ArrangementsDownload
To be verified
24Zone Theorem and ApplicationDownload
To be verified
25LevelsDownload
To be verified
26Range Searching : IntroductionDownload
To be verified
27Orthogonal Range searching Download
To be verified
28Priority Search TreesDownload
To be verified
29Non - Orthogonal Range SearchingDownload
To be verified
30Half - Plane Range QueryDownload
To be verified
31Well Separated PartitioningDownload
To be verified
32Quadtrees Epsilon -WSPDDownload
To be verified
33Construction of Epsilon - WSPDDownload
To be verified
34Epsilon - WSPD to Geometric SpannerDownload
To be verified
35Epsilon-Nets & VC DimensionDownload
To be verified
36Epsilon-Nets & VC Dimension contdDownload
To be verified
37Geometric Set CoverDownload
To be verified
38Geometric Set Cover (with Bounded VC Dimension)Download
To be verified
39Shape RepresentationDownload
To be verified
40Shape ComparisonDownload
To be verified


Sl.No Language Book link
1EnglishNot Available
2BengaliNot Available
3GujaratiNot Available
4HindiNot Available
5KannadaNot Available
6MalayalamNot Available
7MarathiNot Available
8TamilNot Available
9TeluguNot Available