triangulation: triangulation of polygons

[ bsd3, graphics, library ] [ Propose Tags ] [ Report a vulnerability ]

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: www.dinkla.net/download/GeomAlgHaskell.pdf. 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.

Modules

[Index]

Graphics
- Triangulation
  - Graphics.Triangulation.KETTriangulation
  - Graphics.Triangulation.Triangulation

Downloads

triangulation-0.1.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

TillmannVogt

For package maintainers and hackage trustees

edit package information

Candidates

No Candidates

Versions [RSS]	0.1, 0.2, 0.3
Dependencies	array, base (>=4 && <5), collada-types, haskell98 [details]
License	LicenseRef-GPL
Author	Joern Dinkla
Maintainer	Tillmann.Vogt@rwth-aachen.de
Category	Graphics
Home page	http://www.dinkla.net/
Uploaded	by TillmannVogt at 2011-05-29T22:22:18Z
Distributions
Reverse Dependencies	2 direct, 22 indirect [details]
Downloads	2421 total (13 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]