triangulation: triangulation of polygons
An implementation of a simple triangulation algorithm for polygons without crossings (holes are possible). The code is explained her: www.dinkla.net/download/GeomAlgHaskell.pdf.
Modules
[Index]
Downloads
- triangulation-0.3.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- 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 |
| Maintainer | tillk.vogt@googlemail.com |
| Category | Graphics |
| Home page | http://www.dinkla.net/ |
| Uploaded | by TillmannVogt at 2011-07-25T10:28:33Z |
| Distributions | |
| Reverse Dependencies | 2 direct, 22 indirect [details] |
| Downloads | 2429 total (2 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] |