CODEWITHSUNDEEP
computational-geometrycgaltriangulation
Charles Arnal
Charles Arnal

Reputation: 11

Check using CGAL that a collection of simplices defines a valid triangulation

Let us assume that I have a collection of d-dimensional simplices in d dimension, each simplex being defined by its set of vertices (whose coordinates I have access to). d is strictly greater than 3. I want to check whether this collection is a valid triangulation of the convex hull of the union of their vertices (i.e. the simplices intersect correctly and their union covers the convex hull of the union of their vertices).

I assume that it should be doable using CGAL, but I have very little experience with it--how should I proceed?

Thanks in advance

I read the CGAL documentation and asked GPT for help, but nothing worked.

Upvotes: 1

Views: 22

Answers (0)

Related Questions