Causal Dynamical Triangulations in C++ using CGAL
- Updated
Nov 3, 2025 - C++
Causal Dynamical Triangulations in C++ using CGAL
3D model voxelizer for deep learning applications (e.g. 3D CNN) in additive manufacutring (3D printing)
Boolean Operations of two three-dimensional Polyhedrons based on CGAL Package
Strongly typed CGAL with generics, cross-platform with pure rust.
Optimizing Non-Amblygonal Triangulation of Flat Graphs of Straight Sections (Planar Straight Line Graphs) using the CGAL library
Different approaches to impose interface conditions with non matching techniques
Non-amblygonal triangulation of Planar Straight Line Graphs (PSLG) using CGAL library
In this project, we compare various algorithms for calculating the area of a polygon, including optimal local search, optimal simulated annealing, incremental, onion method and other well-known methods, to determine the most efficient and effective approach.
Add a description, image, and links to the cgal-library topic page so that developers can more easily learn about it.
To associate your repository with the cgal-library topic, visit your repo's landing page and select "manage topics."