New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Constrained Delaunay Triangulations (2D) #8

Open

mv740 opened this issue Dec 8, 2020 · 0 comments

Assignees

Member

mv740 commented Dec 8, 2020

Description

Create a VTK filter based on the Constrained Delaunay Triangulations
Constrained Delaunay Triangulations CGAL DOCUMENTATION

A constrained Delaunay triangulation is a triangulation with constrained edges which try to be as much Delaunay as possible.

A constrained Delaunay triangulation is not a Delaunay triangulation but it is a constrained triangulation.

code example

https://doc.cgal.org/latest/Triangulation_2/Triangulation_2_2polygon_triangulation_8cpp-example.html

Acceptance criteria

input: mesh with constraints
output: poly data with constrained Delaunay triangulation result

mv740 assigned grzac

fstamour changed the title ~~Constrained Delaunay Triangulations ( 2D)~~ Constrained Delaunay Triangulations (2D)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment