/PA093-project

PA093 Computation Geometry Project

Primary LanguageJava

PA093 Computational Geometry Project

Implemented algorithms:

  • Convex hull - Gift wrapping
  • Convex hull - Graham scan
  • Triangulation
  • Kd-tree
  • Delaunay triangulation - incremental algorithm
  • Voronoi diagram - constructed from Delaunay triangulation

Modes:

  • a - Add points
  • d - Remove points
  • m - Move points
  • p - Create polygon (end polygon by right mouse click)

Commands:

  • r - Generate random points
  • c - Clear screen
  • h - Convex hull - Gift wrapping
  • g - Convex hull - Graham scan
  • t - Triangulation for convex hull or monotone polygon
  • k - Kd-tree
  • l - Delaunay triangulation
  • v - Voronoi diagram