Project Description
A library of Computational Geometry algorithms such as convex hulls, Voronoi diagrams, line intersections, triangulations, and more; written in C#.

Features:

  • Convex Hull 2D algorithm
  • Basic shape library (point, line, polygon)
  • Data Structures
    • Binary Tree
    • Binary Heap (Max, Min planned)

Planned:

  • Algorithms
    • Line sweep algorithm for detecting line segment intersections
    • Map overlays
    • Voronoi diagram
    • Delaunay triangulations
    • and more.

Last edited Feb 27, 2011 at 5:53 AM by jonlave, version 3