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 274 articles , 4 standard articles )
Showing results 1 to 20 of 274.
Sorted by year (- Bus, Norbert; Mustafa, Nabil H.; Ray, Saurabh: Practical and efficient algorithms for the geometric hitting set problem (2018)
- Calvin, James; Gimbutienė, Gražina; Phillips, William O.; Žilinskas, Antanas: On convergence rate of a rectangular partition based global optimization algorithm (2018)
- Haque, Tasnuva; Lucet, Yves: A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions (2018)
- Peter G. Lelièvre; Angela E. Carter-McAuslan; Michael W. Dunham; Drew J. Jones; Mariella Nalepa; Chelsea L.Squires; Cassandra J. Tycholiz; Marc A. Vallée; Colin G .Farquharson: FacetModeller: Software for manual creation, manipulation and analysis of 3D surface-based models (2018)
- Sheng, Bin; Liu, Bowen; Li, Ping; Fu, Hongbo; Ma, Lizhuang; Wu, Enhua: Accelerated robust Boolean operations based on hybrid representations (2018)
- Yan, Ke; Cheng, Ho-Lun; Ji, Zhiwei; Zhang, Xin; Lu, Huijuan: Accelerating smooth molecular surface calculation (2018)
- Anisimov, Dmitry; Panozzo, Daniele; Hormann, Kai: Blended barycentric coordinates (2017)
- Assarf, Benjamin; Gawrilow, Ewgenij; Herr, Katrin; Joswig, Michael; Lorenz, Benjamin; Paffenholz, Andreas; Rehn, Thomas: Computing convex hulls and counting integer points with polymake (2017)
- Carr, Hamish (ed.); Garth, Christoph (ed.); Weinkauf, Tino (ed.): Topological methods in data analysis and visualization IV. Theory, algorithms, and applications. Selected papers based on the presentations at the TopoInVis workshop, Annweiler, Germany, 2015 (2017)
- Elliott, Charles M.; Ranner, Thomas; Venkataraman, Chandrasekhar: Coupled bulk-surface free boundary problems arising from a mathematical model of receptor-ligand dynamics (2017)
- Ernestus, Maximilian; Friedrichs, Stephan; Hemmer, Michael; Kokemüller, Jan; Kröller, Alexander; Moeini, Mahdi; Schmidt, Christiane: Algorithms for art gallery illumination (2017)
- Francesco Furiani, Giulio Martella, Alberto Paoluzzi: Geometric Computing with Chain Complexes: Design and Features of a Julia Package (2017) arXiv
- Herrera-Montojo, J.; Fossati, M.; Minisci, E.: Shock-conforming mesh generation for aerodynamic analyses at supersonic regimes (2017)
- Hug, Daniel; Klatt, Michael A.; Last, Günter; Schulte, Matthias: Second order analysis of geometric functionals of Boolean models (2017)
- Ibanez, Dan; Shephard, Mark S.: Modifiable array data structures for mesh topology (2017)
- Kabaria, Hardik; Lew, Adrian J.: Universal meshes for smooth surfaces with no boundary in three dimensions (2017)
- Lhuillier, Maxime: Overview of shelling for 2-manifold surface reconstruction based on 3D Delaunay triangulation (2017)
- Sattari, Sattar; Izadi, Mohammad: An exact algorithm for the minimum dilation triangulation problem (2017)
- Schlittler, Thiago Milanetto; Cottereau, Régis: Fully scalable implementation of a volume coupling scheme for the modeling of multiscale materials (2017)
- Shivashankar, Nithin; Natarajan, Vijay: Efficient software for programmable visual analysis using Morse-Smale complexes (2017)
Further publications can be found at: http://www.cgal.org/Manual/3.2/doc_html/cgal_manual/biblio.html