Parallel tetrahedral remeshing using TBB
Contributor: Iason Manolas
Iteratively reshaping the cells of a 3D mesh to improve quality for simulations like finite element analysis — is computationally expensive: large...
C++ library of computational geometry
Contributor: Iason Manolas
Iteratively reshaping the cells of a 3D mesh to improve quality for simulations like finite element analysis — is computationally expensive: large...
Contributor: Raco
We want to implement an algorithm to compute from a surface mesh representation a basis for 1-homotopy and 1-homology groups represented by polylines...
Contributor: Rajdeep Singh Kushwaha
CGAL's Basic Viewer provides one-call visualization of any CGAL data structure via draw(), but its OpenGL shader system has concrete user-facing...
Contributor: Théo Tyburn
Some packages in CGAL need to compute the intersections of segments, rays, or lines with an implicit function. This is generally done through naive...
Contributor: Utkarsh Khajuria
The current CGAL Python bindings expose powerful computational geometry algorithms, but they've accumulated real usability problems: method...
Contributor: Vanrap
Point cloud data is widely used in domains such as reverse engineering, medical imaging, and cultural heritage preservation. However, many...
Contributor: Yury Elkin
This project investigates GPU-accelerated approaches for spatial searching and mesh intersection in CGAL, a widely used computational geometry...
Contributor: Iason Manolas
The goal of this project is to parallelize the CGAL Tetrahedral Remeshing package using the Intel Threading Building Blocks (TBB) library. This will...
Contributor: Qijia HUANG
The project aims to integrate into the CGAL library an algorithm for medial axis approximation that I developed and published at SIGGRAPH Asia 2024....
Contributor: Shepard Liu
The 2D Arrangements package in CGAL provides an efficient and extensible framework for representing and manipulating arrangements induced by...
Contributor: Soichiro
This proposal aims to develop an advanced hexahedral grid refinement framework (Owen et al. 2017), supporting single-threaded and multi-threaded...
Contributor: Taoli Shen
The goal of this project is to enhance the existing Dual Contouring (DC) method in CGAL by implementing manifold contouring methods. While the...
Contributor: Bradley McCoy
For various applications, a good sampling of triangle meshes is required. While CGAL provides different sampling strategies in the Polygon Mesh...
Contributor: Théo Bénard
The goal of this project is to implement the method of the paper "A template-based approach for parallel hexahedral two-refinement", Steven J. Owen,...
Contributor: Islam Omar
The project aims to tackle the challenge of low-quality triangles in triangle meshes by mollifying each triangle, effectively simulating improved...
Contributor: Theo Grillon
In the past, I played an active role in the development of a lightweight basic viewer for CGAL, utilizing the GLFW framework. The primary aim of this...
Contributor: Radosław Dąbkowski
The CGAL library provides many robust and extensive algorithms, but its use is limited only to C++ experts. My project aims to lower the barrier to...
Contributor: Dániel Unyi
Non-rigid Iterative Closest Point (N-ICP) is a classic method used for the registration of non-rigidly deforming shapes. Non-rigid registration seeks...
Contributor: Deniz Diktas
Abstract: Recently the "2D Arrangement" package of CGAL has been enhanced with the support of 2D arrangement of geodesic arcs embedded on the sphere....
Contributor: Hossam Mohamed Saeed
This project introduces a new simplification (and remeshing) framework to CGAL. Based on the Approximated Centroidal Voronoi Diagrams (ACVD) project...
Contributor: Ivan Paden
The goal of the proposed project is to extend the existing remeshing functionality in the polygon mesh processing (PMP) package with the adaptive...
Contributor: Jeffrey.D.Cochran
Funded by GSoC this summer, I propose to add collision detection to CGAL in a way that naturally builds on and extends CGAL’s existing AABB-tree...
Contributor: Ken Arroyo Ohori
Polygons are defined by one outer ring and possibly multiple inner rings representing holes, where each ring is usually represented as a sequence of...
Contributor: Mathieu LADEUIL
- 1 weeks understanding the article and making small code test to get into the CGAL architecture at this point I should be able to manipulate the...
Contributor: rp01052
The goal of the project is to add the "Virtual Source Propagation" (Trettner, Bommes, Kobbelt 2021) algorithm to CGAL. This algorithm finds...
Contributor: Tolga Yildiz
CGAL has been using OpenGL API to generate its visuals in the 3D demonstrations. With recent MacOS update there, OpenGL support has ben deprecated by...
Contributor: William Wen
Many applications of point set surfaces work with noisy point sets, requiring a denoising operation to reconstruct the original surface. This project...
Contributor: Julian Stahl
Extracting isosurfaces from scalar functions is a common method for generating 3D meshes. An isosurface is a subspace with equal values of the...
Contributor: Mostafa Ashraf Mohamed
Visualization is an important aspect of computer graphics because it’s useful to visualize the result of an algorithm and help to debug errors in...
Contributor: Hongyi Liu
Surface reconstruction recovers a watertight surface mesh from a given set of oriented or unoriented point clouds. Given a tensor field that...
Contributor: Hossam Mohamed Saeed
This project will implement Interpolated Corrected Curvature Measures for triangular meshes based on “Lachaud, J.-O., Romon, P., Thibert, B. and...
Contributor: G Yuvan Shankar
CGAL currently uses the Boost Parameter Library to provide a convenient way for users to pass parameters. However, with the evolution of C++...
Contributor: asipos
An isosurface is a 3D surface representation of points with equal values of a scalar function defined in 3D space. The task of isosurfacing consists...
Contributor: aniket agarwalla
The goal of this project is to add Moving Least Squares surface reconstruction algorithms to the point set processing component. This family of...
Contributor: Jackson Campolattaro
CGAL’s Axis-Aligned Bounding Box Tree is an acceleration structure which speeds up common tasks such as collision-detection. It is used both directly...
Contributor: Kabir
The Computational Geometry Algorithm’s Library has a program that demonstrates the package named '2D Regularized Boolean Set Operations'. This...
Contributor: Antonio Gomes
For this project, I would like to implement 3D Barycentric Coordinates for Convex Polyhedra with Triangular Faces, which is one of the ideas for this...
Contributor: Julian Komaromy
CGAL currently supports the decimation of triangular meshes using two distinct strategies: Lindstrom-Turk and Garland-Heckbert. These strategies...
Contributor: Krezhairo
CGAL works on computational geometry. It has a Demo version of a package named '2D Regularized Boolean Set Operations'. With the use of generic...
Contributor: Felix Herrmann
CGAL recently added wrappers to their library to enable global and local point-cloud registration using the OpenGR library. In the current version,...
Contributor: Ayush Saraswat
Introduction of Intel’s Embree and its applications to CGAL in the form of a package "Embree" after sufficient bench-marking. The "Embree" package...
Contributor: Shuhao Tan
The new package "Surface mesh topology" will be available in the next CGAL release. It is concerned with the computation of topological invariants of...
Contributor: Jackson Campolattaro
A new package which provides an octree data structure. CGAL’s Shape-detection package depends on an octree for nearest-neighbor calculations. The...
Contributor: Jing Yang
I'm currently a Ph.D. student at the University of Southern California and focused on computer graphics. This doc proposed my detailed solutions to...
Contributor: Ahmed Essam-Sayed
The CGAL 2D arrangement package is capable of creating planar arrangements, and running queries on them. CGAL provides a demo for the package that...
Contributor: Necip Fazil Yildiran
CGAL’s components are used with other libraries to achieve complex tasks, some of which are suffering from the lack of interoperability while some...
Contributor: Jasmeet Singh
CGAL provides now basic viewers, i.e. global functions allowing to visualize in 3D some CGAL data-structures. These small viewers are very usefull in...
Contributor: Saurabh Singh
The 2D Arrangement package can be used to construct, maintain, alter, and display arrangements in the plane. Once an arrangement is constructed, the...
Contributor: Krezhairo
CGAL works on computational geometry. It has a Demo version of a package named '2D Regularized Boolean Set Operations'. With the use of generic...
Contributor: Baskin Burak Senbaslar
The project will include adding new approaches to already existing triangulated mesh simplification framework of CGAL. The current approach depends...
Contributor: Thien Hoang
A new package about the computation of some topological invariants on surfaces is under development in CGAL. The goal of this project is to add a new...
Contributor: Xiao Xiao
Intersection problems are common in many engineering applications, for example, enforcement of non-penetration constraints in contact mechanics,...
Contributor: Martin Skrodzki
Measuring the similarity between two geometric models is an important problem in diverse fields, including computer graphics, computer games, and...
Contributor: Gennadii Sytov
For this project, I would like to create a new CGAL package that combines the global regularization algorithm from Section 3 of the KIPPI paper,...
Contributor: Keyu Chen
This project aims at providing another two powerful generalized barycentric coordinates Harmonic coordinates and Maximum Entropy coordinates that...
Contributor: Tong ZHAO
This project aims to build a package for reconstruction watertight surfaces from un-oriented point sets. The first step is to estimate un-oriented...
Contributor: Vasudha Varadarajan
The current implementation of Poisson Surface Reconstruction algorithm in CGAL constructs a continuous, piecewise linear implicit function, i.e. it...
Contributor: Christina Vaz
A wide variety of problems in scientific computing and data analysis need to compute accurate shortest paths and distances along curved domains...
Contributor: Apurva Kamlesh Bhatt
CGAL works on computational geometry. It has 2 packages named '2D Regularized Boolean Set Operations' and '2D Minkowski Sum'. My task is to build a...
Contributor: Thien Hoang
Apply the Region Growing algorithm to any user-defined elements
Contributor: Liubomyr Piadyk
The algorithm in this project was proposed by Khaled Mamou and Faouzi Ghorbel. It’s an efficient approach to decompose a concave 3D mesh into a set...
Contributor: Konstantinos Katrioplas
Currently, CGAL's Polygon Mesh Processing package offers an incremental triangle-based isotropic remeshing algorithm to perform two-dimensional mesh...
Contributor: Vasudha Varadarajan
Hexahedral meshing has been proven to be significantly more efficient than tetrahedral meshing in the solving of most PDEs for physical simulations,...
Contributor: Tianyu Zhou
By playing around with the 2D Arrangement demo, users can have a visual and direct experience on what functionalities to expect from this module...
Contributor: Lingjie Zhu
For many applications ranging from geometry compression to reverse engineering, finding the concise and faithful approximation of an excessively...