
Diagram de voronoi
Get flash to fully experience Pearltrees
Diagramme de Voronoï - Wikipédia
File:Fortunes-algorithm.gif - Wikipedia, the free encyclopedia
Triangulation de Delaunay - Wikipédia
Fichier:Delaunay geometry.png - Wikipédia
Could not save your note (edit conflict or other problem).Un exemple de creation d'un diagramme de Voronoi
This is a fairly widely-used 2D code for Voronoi diagrams and Delauney triangulations, written in C by Steve Fortune of Bell Laboratories. It is based on Fortune's sweepline algorithm for Voronoi diagrams, and is likely to be the right code to try first.
Fortune's 2D Voronoi diagram code
Main Page - VoroWiki
While the generation of models of complex surfaces is sufficient for many applications, true 3D (volumetric) application require a true 3D data structure. The 3D Voronoi diagram, and dual tetrahedralization, has only rarely been implemented. Two adjacent Voronoi cells.
Three-dimensional Voronoi Diagram - VoroWiki
Since the Voronoi diagram (VD) and the Delaunay triangulation (DT) are dual structures , the knowledge of one implies the knowledge of the other one; in other words, if one has only one structure, he can always extract the other one. Because it is easier, from an algorithmic and data structure point of view, to manage tetrahedra over arbitrary polyhedra (they have a constant number of vertices and adjacent cells), we can construct and manipulate a VD by working only on its dual structure. When the VD is needed, it is extracted from the DT.


Hum, j'ai failli faire mon TIPE sur ce sujet l'an dernier. by zrk Nov 1