Computational Geometry - Study24x7
Social learning Network
study24x7

Default error msg

Login

New to Study24x7 ? Join Now
Already have an account? Login
googlePlay app_img
Computational Geometry
broucher Course Brochure
Computational Geometry
by Prof. Sandeep Sen

Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational geometry. While modern computational geometry is a r...

0.0  (0 Ratings) 861 Learner
validy img Validity Unlimited
level All Level
level English
cover Img Preview not available
Program Fee
FREE
About This Course

Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational geometry. While modern computational geometry is a r...

Show more
Course Curriculum
14 Sections | 40 Lecture | 36h 25min total length
Expand all sections
Computational Geometry

Introduction using Basic Visibility Problems

| 01h 39min total length
  • <?php echo $alt; ?>

    Lec-01 Introduction

    47m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-02 Visibility Problems

    52m <?php echo $alt; ?>
Computational Geometry

The Maximal Points Problem

| 52min 49sec total length
  • <?php echo $alt; ?>

    Lec-03 2D Maxima

    52m <?php echo $alt; ?>
Computational Geometry

The Plane Sweep Technique and applications

| 02h 54min total length
  • <?php echo $alt; ?>

    Lec-04 Line Sweep Method

    1h 60 min <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-05 Segment Intersection Problem

    54m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-06 Line Sweep: Rectangle Union

    59m <?php echo $alt; ?>
Computational Geometry

Convex Hull Different Paradigms and Quickhull

| 03h 36min total length
  • <?php echo $alt; ?>

    Lec-07 Convex Hull

    52m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    ?Lec-08 Convex Hull Contd

    55m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-09 Quick Hull

    54m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-10 More Convex Hull Algorithms

    54m <?php echo $alt; ?>
Computational Geometry

Dual Transformation and Applicatiopns

| 01h 47min total length
  • <?php echo $alt; ?>

    Lec-11 Intersection of Half Planes and Duality

    52m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-12 Intersection of Half Planes and Duality Contd

    55m <?php echo $alt; ?>
Computational Geometry

Lower Bounds on Algebraic tree model

| 55min 54sec total length
  • <?php echo $alt; ?>

    Lec-13 Lower Bounds

    55m <?php echo $alt; ?>
Computational Geometry

Point Location and Triangulation

| 02h 49min total length
  • <?php echo $alt; ?>

    Lec-14 Planar Point Location

    58m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-15 Point Location and Triangulation Contd...

    51m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    lec16 Triangulation of Arbitrary Polygon

    59m <?php echo $alt; ?>
Computational Geometry

Voronoi Diagram and Delaunay Triangulation

| 02h 56min total length
  • <?php echo $alt; ?>

    Lec-17 Voronoi Diagram : Properties

    59m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    ?Lec-18 Voronoi Diagram Construction

    59m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-19 Delaunay Triangulation.

    57m <?php echo $alt; ?>
Computational Geometry

Randomized Incremental Construction and Random Sampling

| 02h 17min total length
  • <?php echo $alt; ?>

    Lec-20 Quick sort and Backward Analysis

    56m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-21 Generalized RIC

    42m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-22 RIC Continued

    38m <?php echo $alt; ?>
Computational Geometry

Arrangements and Levels

| 02h 52min total length
  • <?php echo $alt; ?>

    Lec-23 Arrangements

    1h 60 min <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-24 Zone Theorem and Application

    52m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-25 Levels

    59m <?php echo $alt; ?>
Computational Geometry

Range Searching

| 04h 38min total length
  • <?php echo $alt; ?>

    Lec-26 Range Searching : Introduction

    55m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-27 Orthogonal Range searching

    51m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-28 Priority Search Trees

    51m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-29 Non - Orthogonal Range Searching

    55m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-30 Half - Plane Range Query

    1h 63 min <?php echo $alt; ?>
Computational Geometry

Clustering Point Sets using Quadtrees and? Applications

| 03h 50min total length
  • <?php echo $alt; ?>

    Lec-31 Well Separated Partitioning

    1h 63 min <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-32 Quadtrees Epsilon -WSPD

    49m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-33 Construction of Epsilon - WSPD

    57m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-34 Epsilon - WSPD to Geometric Spanner

    59m <?php echo $alt; ?>
Computational Geometry

Epsilon - Nets VC Dimension and Applications

| 03h 35min total length
  • <?php echo $alt; ?>

    Lec-35 Epsilon-Nets & VC Dimension

    51m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-36 Epsilon-Nets & VC Dimension contd

    58m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-37 Geometric Set Cover

    57m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-38 Geometric Set Cover (with Bounded VC Dimension)

    48m <?php echo $alt; ?>
Computational Geometry

Shape Analysis and Shape Comparison

| 01h 36min total length
  • <?php echo $alt; ?>

    Lec-39 Shape Representation

    48m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Lec-40 Shape Comparison

    48m <?php echo $alt; ?>
show 11 more sections