Premium Content

Computational Geometry

Algorithms for geometric problems

This chapter requires a subscription to access.

What you'll unlock:

  • 1. Point, Line, Polygon Representations
  • 2. Cross Product and Orientation
  • 3. Line Segment Intersection
  • 4. Convex Hull Algorithms
  • 5. Polygon Area and Centroid
  • 6. Point in Polygon Test
  • 7. Voronoi Diagrams
Subscribe to Unlock

Already have an account? Sign in