CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Molecular graphs of a finite points set : a generalization of the Delaunay triangulation M. Melkemi LIRIS, Universit´e Claude Bernard Lyon 1, - Proximity problems - Document - PDFSEARCH.IO

First Page	Meta Content
	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Molecular graphs of a finite points set : a generalization of the Delaunay triangulation M. Melkemi LIRIS, Universit´e Claude Bernard Lyon 1, Add to Reading List Document Date: 2004-01-08 18:44:36 Open Document File Size: 110,54 KB Share Result on Facebook City Halifax / / Company Cambridge University Press / John Wiley and Sons / / Country United Kingdom / / / IndustryTerm eﬃcient algorithm / storage applications / versatile tools / α-shape algorithm / eﬃcient algorithms / / Organization Cambridge University / / Person Claude Bernard Lyon / / ProvinceOrState Nova Scotia / / PublishedMedium Computer Graphics / / Technology alpha / eﬃcient algorithms / α-shape algorithm / eﬃcient algorithm / / SocialTag Graph theory Computational geometry Voronoi diagram Delaunay triangulation Alpha shape Godfried Toussaint Proximity problems Molecular graph Convex hull Geometry

CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Molecular graphs of a finite points set : a generalization of the Delaunay triangulation M. Melkemi LIRIS, Universit´e Claude Bernard Lyon 1,Add to Reading List