13. Chapter 13: Elements of Computational Geometry

• 13.1. Basics of Computational Geometry
  • 13.1.1. Working with graphics in OCaml
• 13.2. Points, Segments and their Properties
  • 13.2.1. On precision and epsilon-equality
  • 13.2.2. Points on a two-dimensional plane
  • 13.2.3. Points as vectors
  • 13.2.4. Scalar product of vectors
  • 13.2.5. Polar coordinate system
  • 13.2.6. Vector product and its properties
  • 13.2.7. Segments on a plane
  • 13.2.8. Generating random points on a segment
  • 13.2.9. Collinearity of segments
  • 13.2.10. Checking for intersections
  • 13.2.11. Finding intersections
• 13.3. Working with Polygons
  • 13.3.1. Encoding and rendering polygons
  • 13.3.2. Some useful polygons
  • 13.3.3. Basic polygon manipulations
  • 13.3.4. Queries about polygons
  • 13.3.5. Intermezzo: rays and intersections
  • 13.3.6. Point within an polygon
• 13.4. Convex Hulls
  • 13.4.1. Plane-sweeping algorithm
  • 13.4.2. Graham scan invariant