/Geometry.jl

Simple geometric algorithms.

MIT LicenseMIT

Geometry.js

  • Intersection of two line segments (done)
  • Constructing a simple polygon (incomplete)
  • Finding the convex hull (incomplete)
  • Finding a closest pair of points (incomplete)
  • Intersection of horizontal and vertical line segments (incomplete)