CGAL
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 320 articles , 4 standard articles )
Showing results 1 to 20 of 320.
Sorted by year (- Duque, Daniel; Español, Pep: An assignment procedure from particles to mesh that preserves field values (2020)
- Wan, Andy T. S.; Laforest, Marc: A posteriori error estimation for the p-curl problem (2020)
- Attali, Dominique; Nguyen, Tuong-Bach; Sivignon, Isabelle: ((\delta,\varepsilon))-ball approximation of a shape: definition and complexity (2019)
- de Gournay, Frédéric; Kahn, Jonas; Lebrat, Léo: Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure (2019)
- Edelsbrunner, Herbert; Ölsböck, Katharina: Holes and dependences in an ordered complex (2019)
- González Obando, Daniel Felipe; Olivo-Marin, Jean-Christophe; Wendling, Laurent; Meas-Yedid, Vannary: Vector-based morphological operations on polygons using straight skeletons for digital pathology (2019)
- Grande, Jörg: Red-green refinement of simplicial meshes in (d) dimensions (2019)
- Guha, Sumanta: Computer graphics through OpenGL. From theory to experiments (2019)
- Milenkovic, Victor; Sacks, Elisha; Butt, Nabeel: Fast detection of degenerate predicates in free space construction (2019)
- Soto-Francés, Víctor-Manuel; Sarabia-Escrivá, Emilio-José; Pinazo-Ojer, José-Manuel: Consistently oriented dart-based 3D modelling by means of geometric algebra and combinatorial maps (2019)
- Valentin Niess, Anne Barnoud, Cristina Cârloganu, Olivier Martineau-Huynh: TURTLE: A C library for an optimistic stepping through a topography (2019) arXiv
- Yan, Ke; Cheng, Ho-Lun; Huang, Jing: Representing implicit surfaces satisfying Lipschitz conditions by 4-dimensional point sets (2019)
- Baram, Alon; Fogel, Efi; Halperin, Dan; Hemmer, Michael; Morr, Sebastian: Exact Minkowski sums of polygons with holes (2018)
- Beaude, Laurence; Beltzung, Thibaud; Brenner, Konstantin; Lopez, Simon; Masson, Roland; Smai, Farid; Thebault, Jean-Frédéric; Xing, Feng: Parallel geothermal numerical model with fractures and multi-branch wells (2018)
- Bus, Norbert; Mustafa, Nabil H.; Ray, Saurabh: Practical and efficient algorithms for the geometric hitting set problem (2018)
- Cabello, Sergio; Milinković, Lazar: Two optimization problems for unit disks (2018)
- Calvin, James; Gimbutienė, Gražina; Phillips, William O.; Žilinskas, Antanas: On convergence rate of a rectangular partition based global optimization algorithm (2018)
- Damiand, Guillaume; Gonzalez-Lorenzo, Aldo; Zara, Florence; Dupont, Florent: Distributed combinatorial maps for parallel mesh processing (2018)
- D’Amore, Fabrizio; Franciosa, Paolo G.: A low arithmetic-degree algorithm for computing proximity graphs (2018)
- Eder, Günther; Held, Martin; Palfrader, Peter: Min-/max-volume roofs induced by bisector graphs of polygonal footprints of buildings (2018)
Further publications can be found at: http://www.cgal.org/Manual/3.2/doc_html/cgal_manual/biblio.html