Implementation of Kallmann's Dynamic Constrained Delaunay Triangulation algorithm [closed]

Question

Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.

---

We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.

Closed 7 years ago.

Improve this question

Does anyone know of any open source implementation (preferably in java) of Kallmann's DCDT algorithm? If there's another DCDT algorithm that has been implemented, that may work as well. I wasn't sure if I should post this here or on CSTheory StackExchange, so let me know if this is the wrong place to post.

EDIT: Here's the algorithm: http://infoscience.epfl.ch/record/100269/files/Kallmann_and_al_Geometric_Modeling_03.pdf

Answer 1

He keeps the source code on his web page: http://graphics.ucmerced.edu/software/tripath/index.html

Answer 2

I think there is no great difference between the DCDT algorithm from Kallmann, and the implementation in CGAL. At the functionality level, at least: CGAL 2D CDT are as dynamic as the DCDT from Kallmann.

CGAL also has Java bindings, via the cgal-bindings project, and the 2D CDT data structure is wrapped.