Constrained Delaunay Triangulation (C++)

c-plus-plus cdt compiled computational-geometry conforming constrained constrained-delaunay-triangulation delaunay delaunay-triangulation fast header-only library robust triangle triangulation
2 Open Issues Need Help Last updated: Jun 29, 2025

Open Issues Need Help

View All on GitHub

AI Summary: The task is to add a public function to the CDT C++ library that efficiently locates the triangle containing a given point. This likely involves making the existing internal `walkTriangles` function publicly accessible or creating a new public function with similar functionality.

Complexity: 3/5
enhancement good first issue question

Constrained Delaunay Triangulation (C++)

C++
#c-plus-plus#cdt#compiled#computational-geometry#conforming#constrained#constrained-delaunay-triangulation#delaunay#delaunay-triangulation#fast#header-only#library#robust#triangle#triangulation

AI Summary: Debug and fix a bug in the Constrained Delaunay Triangulation (CDT) C++ library where inserting a vertex on an existing fixed edge with the TryResolve strategy does not correctly split the edge, leading to incorrect and low-quality triangulations. The solution requires understanding the CDT algorithm, debugging the existing code, and implementing a fix that ensures correct edge splitting in all cases, especially when dealing with incremental vertex and edge insertion.

Complexity: 4/5
bug good first issue

Constrained Delaunay Triangulation (C++)

C++
#c-plus-plus#cdt#compiled#computational-geometry#conforming#constrained#constrained-delaunay-triangulation#delaunay#delaunay-triangulation#fast#header-only#library#robust#triangle#triangulation