triangulation: triangulation of polygons

[ bsd3, graphics, library ] [ Propose Tags ]

An implementation of a simple triangulation algorithm for polygons without holes, crossings (and maybe other anomalies that I am not aware of). The code is explained in this diploma thesis: The original author made a very big library that needs a long time to compile. Thats why only one algorithm was extracted and freed from a big net of inner dependencies and types.

Versions 0.1, 0.2, 0.3
Dependencies array, base (==4.*), collada-types, haskell98 [details]
License LicenseRef-GPL
Author Joern Dinkla
Category Graphics
Home page
Uploaded by TillmannVogt at Sun May 29 22:22:18 UTC 2011
Distributions NixOS:0.3
Downloads 1070 total (12 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI




Maintainer's Corner

For package maintainers and hackage trustees