Constrained Delaunay triangulation
|Inserted by||Prof. Dr. Ing. Ivana Kolingerová|
|Date last modified||29.12.2013|
|Number of downloads||3|
This software has been developed under the project LC 06008 of the Ministry of Education, Youth and Sports. The author is dr.Ivana Kolingerova, DCSE, University of West Bohemia, Pilsen, Czech Republic. The program computes the Delaunay triangulation and Constrained Delaunay triangulation. If the constraints form a closed look, the program also allows to clip the triangulation on this look, i.e. to keep only inner or outer triangles. The description of input and output files is given in the attached documentation. The program is able to work up to about 2 mil. of points; for bigger data sets, problems with memory management may appear. The program implements the incremental insertion algorithm, providing O(n log n) expected time complexity, memory requirements are linear. For a correct function of numerical computation, the program needs the library ShewLib.DLL , the author of which is J.R.Shewchuk from the University of California in Berkeley, U.S.A., which is a public domain code (http://www.cs.cmu.edu/~quake/robust.html).