The goal of the CGAL Open Source Project is to provide easy access to efficient and reliable geometric algorithms in the form of a C++ library. CGAL is used in various areas needing geometric computation, such as: computer graphics, scientific visualization, computer aided design and modeling, geographic information systems, molecular biology, medical imaging, robotics and motion planning, mesh generation, numerical methods... More on the projects using CGAL web page. The Computational Geometry Algorithms Library (CGAL), offers data structures and algorithms like triangulations (2D constrained triangulations and Delaunay triangulations in 2D and 3D, periodic triangulations in 3D), Voronoi diagrams (for 2D and 3D points, 2D additively weighted Voronoi diagrams, and segment Voronoi diagrams), polygons (Boolean operations, offsets, straight skeleton), polyhedra (Boolean operations), arrangements of curves and their applications (2D and 3D envelopes, Minkowski sums), mesh generation (2D Delaunay mesh generation and 3D surface and volume mesh generation, skin surfaces), geometry processing (surface mesh simplification, subdivision and parameterization, as well as estimation of local differential properties, and approximation of ridges and umbilics), alpha shapes, convex hull algorithms (in 2D, 3D and dD), search structures (kd trees for nearest neighbor search, and range and segment trees), interpolation (natural neighbor interpolation and placement of streamlines), shape analysis, fitting, and distances (smallest enclosing sphere of points or spheres, smallest enclosing ellipsoid of points, principal component analysis), and kinetic data structures. All these data structures and algorithms operate on geometric objects like points and segments, and perform geometric tests on them. These objects and predicates are regrouped in CGAL Kernels. Finally, the Support Library offers geometric object generators and spatial sorting functions, as well as a matrix search framework and a solver for linear and quadratic programs. It further offers interfaces to third party software such as the GUI libraries Qt, Geomview, and the Boost Graph Library.
This software is also referenced in ORMS.
This software is also referenced in ORMS.
Keywords for this software
References in zbMATH (referenced in 372 articles , 4 standard articles )
Showing results 1 to 20 of 372.
- Cicerone, Serafino; D’Emidio, Mattia; Di Stefano, Gabriele; Navarra, Alfredo: On the effectiveness of the genetic paradigm for polygonization (2021)
- Gonzalez, Ivan; Choksi, Rustum; Nave, Jean-Christophe: A simple geometric method for navigating the energy landscape of centroidal Voronoi tessellations (2021)
- Groiss, Lisa; Jüttler, Bert; Mokriš, Dominik: 27 variants of Tutte’s theorem for plane near-triangulations and an application to periodic spline surface fitting (2021)
- Hugo Ledoux, Filip Biljecki, Balázs Dukai, Kavisha Kumar, Ravi Peters, Jantien Stoter, Tom Commandeur: 3dfier: automatic reconstruction of 3D city models (2021) not zbMATH
- Kamensky, David: Open-source immersogeometric analysis of fluid-structure interaction using FEniCS and tIGAr (2021)
- Limbeck, Jan; Bisdom, Kevin; Lanz, Fabian; Park, Timothy; Barbaro, Eduardo; Bourne, Stephen; Kiraly, Franz; Bierman, Stijn; Harris, Chris; Nevenzeel, Keimpe; den Bezemer, Taco; van Elk, Jan: Using machine learning for model benchmarking and forecasting of depletion-induced seismicity in the Groningen gas field (2021)
- Rouwane, Ali; Bouclier, Robin; Passieux, Jean-Charles; Périé, Jean-Noël: Adjusting fictitious domain parameters for fairly priced image-based modeling: application to the regularization of digital image correlation (2021)
- Schweinhart, Benjamin: Persistent homology and the upper box dimension (2021)
- Sophie Theis, Magali Suzanne, Guillaume Gay: Tyssue: an epithelium simulation library (2021) not zbMATH
- Sukhorukova, Nadezda; Ugon, Julien; Yost, David: Chebyshev multivariate polynomial approximation and point reduction procedure (2021)
- Thayyil, Safeer Babu; Yadav, Sunil Kumar; Polthier, Konrad; Muthuganapathy, Ramanathan: Local Delaunay-based high fidelity surface reconstruction from 3D point sets (2021)
- Zhou, Bo; Chiang, Yi-Jen; Yap, Chee: Soft subdivision motion planning for complex planar robots (2021)
- Alemany-Puig, Lluís; Mora, Mercè; Ferrer-i-Cancho, Ramon: Reappraising the distribution of the number of edge crossings of graphs on a sphere (2020)
- Burbulla, Samuel; Rohde, Christian: A fully conforming finite volume approach to two-phase flow in fractured porous media (2020)
- Dong, Guozhi; Guo, Hailong: Parametric polynomial preserving recovery on manifolds (2020)
- Duan, Xianglong; Quan, Chaoyu; Stamm, Benjamin: A boundary-partition-based Voronoi diagram of (d)-dimensional balls: definition, properties, and applications (2020)
- Duque, Daniel; Español, Pep: An assignment procedure from particles to mesh that preserves field values (2020)
- Ferrada, Héctor; Navarro, Cristóbal A.; Hitschfeld, Nancy: A filtering technique for fast convex hull construction in (\mathbbR^2) (2020)
- Guo, Hailong: Surface Crouzeix-Raviart element for the Laplace-Beltrami equation (2020)
- Hartmann, Valentin; Schuhmacher, Dominic: Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case (2020)
Further publications can be found at: http://www.cgal.org/Manual/3.2/doc_html/cgal_manual/biblio.html