triangulation: triangulation of polygons

[ bsd3, graphics, library ] [ Propose Tags ]

An implementation of a simple triangulation algorithm for polygons without crossings (holes are possible). The code is explained her:


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS] 0.1, 0.2, 0.3
Dependencies array, base (>=4 && <5), collada-types (>=0.3), haskell98, tuple, vector, vector-algorithms [details]
License BSD-3-Clause
Author Joern Dinkla, Tillmann Vogt
Category Graphics
Home page
Uploaded by TillmannVogt at 2011-07-25T10:28:33Z
Reverse Dependencies 2 direct, 22 indirect [details]
Downloads 2383 total (9 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]