DEpthLAUNAY:   C++ program using CGAL. by Alfredo de las Vegas.  It computes Delaunay layers and many other structures for a set of points.	BIGDELONE   It computes Delaunay triangulations of big sets of points. Developped using CGAL  by Ismael Hidalgo
VorExpand (Expanding circles give rise to Voronoi diagrams) by Fernando Mena. DEMO	VOREST   (Growing forest modeller using generalized Voronoi diagrams) by Carlos Vilas
RATM: Mobile phone base stations relocation by Miguel Ángel López Martínez	Curve reconstruction: Crust and anti-crust (Gold's one step algorithm) by  Jose Luis González Guerrero
Packingcircles (Packing circles in a rectangle), by Enrique Bañales Martinez.	Packing circles in non convex polygons by Carlos Massó
Fortune's algorithm by Juan Carlos Ferreras Ferreras. (Fortune's sweep-line algorithm for computing Voronoi diagrams)	Delaunay triangulation and its proximity subgraphs (Gabriel graph, nearest neigbour graph, relative neighbourhood graph, closest pair) by Rubén Naranjo and Damián Serrano
FLIPS   (Edge flipping in geometric graphs)  by Jorge de Diego Cubas and Ulises Berzal Tarín   (Shows how to get one triangulation from another by flipping edges).	Point  set triangulaion algorithms.  By Luis Manuel Arteaga Moreno (Delaunay, incremental, recursive, ...)
Terrain modelling using Delaunay triangulations  by  Juan Antonio Hortigüela	Delaunay triangulations with several metrics by David Iscar Bautista. Delaunay triangulation with several metrics by Gustavo Sevillano.
Delaunay triangulation of polygons by Laura Blazquez	Furthest Voronoi diagram  by Paul Herron Furthest Voronoi diagram  by Manuel Romero
	Curve reconstruction: Crust y  anti-crust by  Adrián Gómez-España y Jorge Peña  Two steps algorithm by Amenta et al.

    Home

---

Webmanagers:           Manuel Abellanas           Gregorio Hernández

---