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.


References in zbMATH (referenced in 207 articles , 4 standard articles )

Showing results 1 to 20 of 207.
Sorted by year (citations)

1 2 3 ... 9 10 11 next

  1. Antonietti, Paola F.; Formaggia, Luca; Scotti, Anna; Verani, Marco; Verzott, Nicola: Mimetic finite difference approximation of flows in fractured porous media (2016)
  2. Caroli, Manuel; Teillaud, Monique: Delaunay triangulations of closed Euclidean $d$-orbifolds (2016)
  3. Dedner, Andreas; Madhavan, Pravin: Adaptive discontinuous Galerkin methods on surfaces (2016)
  4. Escolar, Emerson G.; Hiraoka, Yasuaki: Persistence modules on commutative ladders of finite type (2016)
  5. Fisikopoulos, Vissarion; Peñaranda, Luis: Faster geometric algorithms via dynamic determinant computation (2016)
  6. Machado Manhães de Castro, Pedro; Mérigot, Quentin; Thibert, Boris: Far-field reflector problem and intersection of paraboloids (2016)
  7. Peterka, Tom; Croubois, Hadrien; Li, Nan; Rangel, Esteban; Cappello, Franck: Self-adaptive density estimation of particle data (2016)
  8. Agarwal, Pankaj K.; Kaplan, Haim; Rubin, Natan; Sharir, Micha: Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions (2015)
  9. Antonietti, Paola F.; Dedner, Andreas; Madhavan, Pravin; Stangalino, Simone; Stinner, Björn; Verani, Marco: High order discontinuous Galerkin methods for elliptic problems on surfaces (2015)
  10. Baram, Alon; Fogel, Efi; Halperin, Dan; Hemmer, Michael; Morr, Sebastian: Exact Minkowski sums of polygons with holes (2015)
  11. Cuel, Louis; Lachaud, Jacques-Olivier; Mérigot, Quentin; Thibert, Boris: Robust geometry estimation using the generalized Voronoi covariance measure (2015)
  12. Dufourd, Jean-François: Formal study of functional orbits in finite domains (2015)
  13. Durand, Raul; Farias, Márcio M.; Pedroso, Dorival M.: Computing intersections between non-compatible curves and finite elements (2015)
  14. Gameiro, Marcio; Hiraoka, Yasuaki; Izumi, Shunsuke; Kramar, Miroslav; Mischaikow, Konstantin; Nanda, Vidit: A topological measurement of protein compressibility (2015)
  15. Guha, Sumanta: Computer graphics through OpenGL. From theory to experiments (2015)
  16. Hateley, James C.; Wei, Huayi; Chen, Long: Fast methods for computing centroidal Voronoi tessellations (2015)
  17. Kim, Sang-Un; Lee, Chang-Ock: Accurate surface reconstruction in 3D using two-dimensional parallel cross sections (2015)
  18. Kobel, Alexander; Sagraloff, Michael: On the complexity of computing with planar algebraic curves (2015)
  19. Lhuillier, Maxime: 2-manifold tests for 3D Delaunay triangulation-based surface reconstruction (2015)
  20. Lu, Daniel L.: Planar lower envelope of monotone polygonal chains (2015)

1 2 3 ... 9 10 11 next


Further publications can be found at: http://www.cgal.org/Manual/3.2/doc_html/cgal_manual/biblio.html