Computational Geometry Algorithms Library

Computational Geometry Algorithms Library
CGAL
Importez le logo de ce logiciel
Développeur CGAL Open Source Project
Dernière version 3.8 (19 avril 2011) [+/−]
Environnement Multiplate-forme
Licence GNU LGPL et QPL
Site web www.cgal.org

CGAL (Computational Geometry Algorithms Library) est une bibliothèque logicielle de calcul géométrique écrite en C++. Elle est développée par plusieurs instituts de recherche et entreprises, principalement européens : l'INRIA, le Max-Planck-Institut für Informatik à Sarrebruck, l'université de Tel Aviv, GeometryFactory, l'École polytechnique fédérale de 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
  • Analyse en composantes principales
  • 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


Wikimedia Foundation. 2010.

Contenu soumis à la licence CC-BY-SA. Source : Article Computational Geometry Algorithms Library de Wikipédia en français (auteurs)

Игры ⚽ Поможем написать реферат

Regardez d'autres dictionnaires:

  • Computational — may refer to: Computer Computational algebra Computational Aeroacoustics Computational and Information Systems Laboratory Computational and Systems Neuroscience Computational archaeology Computational auditory scene analysis Computational biology …   Wikipedia

  • Convex hull algorithms — Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science, see Convex hull applications . In computational geometry, numerous algorithms are proposed for computing the convex… …   Wikipedia

  • Constructive Solid Geometry — Mit CSG erstelltes Venn Diagramm Der POV Ray Quellcode ist auf der Beschreibungsseite. Constructive Solid Geometry (CSG) oder Konstruktive Festkörpergeometrie ist eine Technik zum Modellieren von …   Deutsch Wikipedia

  • Computational human phantom — Computational human phantoms are models of the human body used in computerized analysis. Since the 1960s, the radiological science community has developed and applied these models for ionizing radiation dosimetry studies. These models have become …   Wikipedia

  • Computational number theory — In mathematics, computational number theory, also known as algorithmic number theory, is the study of algorithms for performing number theoretic computations. The best known problem in the field is integer factorization. See also Computational… …   Wikipedia

  • History of geometry — Geometry (Greek γεωμετρία ; geo = earth, metria = measure) arose as the field of knowledge dealing with spatial relationships. Geometry was one of the two fields of pre modern mathematics, the other being the study of numbers. Classic geometry… …   Wikipedia

  • Digital geometry — deals with discrete sets (usually discrete point sets) considered to be digitized models or images of objects of the 2D or 3D Euclidean space. Simply put, digitizing is replacing an object by a discrete set of its points. The images we see on the …   Wikipedia

  • Visibility (geometry) — Visibility is a mathematical abstraction of the real life notion of visibility.Given a set of obstacles in the Euclidean space, two points in the space are said to be visible to each other, if the line segment that joins them does not intersect… …   Wikipedia

  • GPC General Polygon Clipper Library — The University of Manchester GPC library is a software library providing an API for computing the results of clipping operations on sets of polygons. It generalises the computer graphics clipping problem of intersecting polygons with polygons.The …   Wikipedia

  • List of algorithms — The following is a list of the algorithms described in Wikipedia. See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures.If you intend to describe a new algorithm,… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”