2014-02-11 12:58 GMT+01:00 Richard <
address@hidden>:
On 11/02/2014 11:45, José Luis García Pallero wrote:
About the 2D Delaunay triangulation generation, there exist the
Triangle library (http://www.cs.cmu.edu/~quake/triangle.html), which
is by far the fastest implementation available. It permits also the
generation of constrained triangulation (qhull has not such
possibility AFAIK) and returns the list of vertices for each triangle,
as qhull does. The problem is that Triangle is not free software. The
last version was released on 2005. I have written a couple of times to
the author asking about the possibility to release Triangle as free
software, but I have not obtained any answer. Maybe some of the Octave
core developers could ask again about such possibility in order to use
Triangle in GNU Octave
I have also contacted the author about Triangle to ask a technical question,
but he did not respond, I wouldn't be too hopeful. I would actually suggest
making the GPL gmsh (http://geuz.org/gmsh/) available through the (largely
undocumented) C++ API which they now provide. I think the msh package is
based on gmsh, but this would be a more direct approach. Yet another
dependency though. There is a python gmsh interface that uses this.
Another possibility is to use the GNU Triangulated Surface library
(
http://gts.sourceforge.net/). It permits also the generation of
constrained meshes. As a bad issue, it is in general terribly slow,
and also is apparently discontinued since 2006
Richard
--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.
--
*****************************************
José Luis García Pallero
address@hidden(o<
/ / \
V_/_
Use Debian GNU/Linux and enjoy!
*****************************************