Add computational geometry algorithms

[sahilbansal17]

• [ ] Graham Scan algorithm for Convex Hull in O(nlogn)
• [ ] Online construction of 3-D convex hull in O(n²)
• [ ] Bentley Ottmann algorithm to list all intersection points of n line segments in O((n+I)logn)
• [ ] Rotating Calipers technique
• Line sweep/Plane sweep algorithms -
  • [ ] Area/perimeter of union of rectangles
  • [ ] Closest pair of points
• [ ] Area of union of circles
• [ ] Delayunay triangulation of n points in O(nlogn)
• [ ] Voronoi diagrams of n points in O(nlogn) using Fortunes algorithm
• Point in a polygon problem
  • [ ] O(n) solution without preprocessing
  • [ ] O(logn) algorithm with O(nlogn) preprocessing for convex polygons
• Problem solutions for following problems on SPOJ:
  • [ ] BSHEEP
  • [ ] BULK
  • [ ] SEGVIS
  • [ ] CONDUIT
  • [ ] RUNAWAY
  • [ ] DIRVS
  • [ ] SHAMAN
  • [ ] TCUTTER
  • [ ] LITEPIPE
  • [ ] RHOMBS
  • [ ] FSHEEP
  • [ ] FLBRKLIN
  • [ ] CERC07P

[MananJethwani]

can i submit solution for Graham Scan algorithm for Convex Hull in c++

[sahilbansal17]

@MananJethwani Sure.