CGAL
- CGAL
-
Computational Geometry Algorithms Library
CGAL (Computational Geometry Algorithms Library) est une Bibliothèque logicielle de calcul géométrique. Elle est développée par plusieurs instituts de recherche et entreprises, principalement Européens: l'INRIA, le Max-Plack Institute für Informatik à Sarrebruck, l'Université de Tel Aviv, GeometryFactory, l'ETH Zurich, l'Université d'Utrecht...
CGAL fournit par exemple les fonctionnalités suivantes :
- Calcul de l'enveloppe convexe d'un ensemble de points en 2D, 3D ou dD
- Partitionnement 2D en polygones et 3D en polyèdres
- Triangulations de Delaunay 2D et 3D
- Diagrammes de Voronoï
- Génération de maillages 2D et 3D
- Recherche des k voisins les plus proches
- Recherche par intervalles, dans un espace dD (2D, 3D...), par range et segment trees
- Calcul des Bounding Volumes
- Calcul des distances optimales
- ACP
- Structures de données cinétiques
- Solveur de programmation linéaire et quadratique (QP Solver)
- et bien d'autres...
CGAL est sous une double licence libre (GNU LGPL et QPL)
Lien externe
Portail des logiciels libres
Catégories : CAO | Calcul numérique | Logiciel scientifique libre | Bibliothèque logicielle libre
Wikimedia Foundation.
2010.
Contenu soumis à la licence CC-BY-SA. Source : Article CGAL de Wikipédia en français (auteurs)
Regardez d'autres dictionnaires:
CGAL — Developer(s) CGAL Open Source Project Stable release 3.8 / April 19, 2011 Written in C++ Operating system Multi platform … Wikipedia
Computational Geometry Algorithms Library — CGAL Développeur CGAL Open Source Project Dernière version … Wikipédia en Français
Delaunay triangulation — A Delaunay triangulation in the plane with circumcircles shown In mathematics and computational geometry, a Delaunay triangulation for a set P of points in the plane is a triangulation DT(P) such that no point in P is inside the circumcircle of… … Wikipedia
Institut national de recherche en informatique et en automatique — Création 3 … Wikipédia en Français
Quadratic programming — (QP) is a special type of mathematical optimization problem. It is the problem of optimizing (minimizing or maximizing) a quadratic function of several variables subject to linear constraints on these variables.The quadratic programming problem… … Wikipedia
Point location — The point location problem is a fundamental topic of computational geometry. It finds applications in areas that deal with processing geometrical data: computer graphics, geographic information systems (GIS), motion planning, and computer aided… … Wikipedia
Subdivision surface — A subdivision surface, in the field of 3D computer graphics, is a method of representing a smooth surface via the specification of a coarser piecewise linear polygon mesh. The smooth surface can be calculated from the coarse mesh as the limit of… … Wikipedia
Mesh generation — is the practice of generating a polygonal or polyhedral mesh that approximates a geometric domain. The term grid generation is often used interchangeably. Typical uses are for rendering to a computer screen or for physical simulation such as… … Wikipedia
Line segment intersection — In computational geometry, the line segment intersection problem supplies a list of line segments in the plane and asks us to determine whether any two of them intersect, or cross.Naive algorithms examine each pair of segments, but this is highly … Wikipedia
Kd-trie — A k d trie is a spatial data structure for indexing points in k dimensional space. It is a variation on the k d tree that only stores points in the leaf nodes, sometimes in small collections called bins or buckets. Internal nodes only store the… … Wikipedia
