Hi everyone,
Here is the initial release of Delaunay, a Lua module for convex polygon
triangulation [1]. I have been working on it in the past days mostly for
the purpose of learning. The long-term intent is to compare it with other
triangulation methods and use it as a dependancy in my pathfinding library
Jumper [2].
Documentation is included, generated from the source thanks to LDoc [3]. It
is available online. Unit tests (running with Telescope [4]) and
performance tests are also included.
Here is the link to the raw rockspec [5].
A few complementary links :
* Project page [6]
* Github source [7]
* Online documentation [8]
As usual, any feedback will be much appreciated.
Thanks in advance.
Regards,
Roland.
[1] http://en.wikipedia.org/wiki/Delaunay_triangulation
[2] https://github.com/Yonaba/Jumper
[3] https://github.com/stevedonovan/ldoc
[4] https://github.com/norman/telescope
[5]
https://raw.github.com/Yonaba/delaunay/master/rockspecs/delaunay-0.1-1.rockspec
[6] http://yonaba.github.io/delaunay
[7] https://github.com/Yonaba/delaunay
[8] http://yonaba.github.io/delaunay/doc
------------------------------------------------------------------------------
Rapidly troubleshoot problems before they affect your business. Most IT
organizations don't have a clear picture of how application performance
affects their revenue. With AppDynamics, you get 100% visibility into your
Java,.NET, & PHP application. Start your 15-day FREE TRIAL of AppDynamics Pro!
http://pubads.g.doubleclick.net/gampad/clk?id=84349831&iu=/4140/ostg.clktrk
_______________________________________________
Luarocks-developers mailing list
Luarocks-developers@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/luarocks-developers
