Some properties of higher order delaunay and gabriel graphs

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/9119

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II
dc.contributor	Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
dc.contributor.author	Bose, Prosenjit
dc.contributor.author	Collette, Sébastien
dc.contributor.author	Hurtado Díaz, Fernando Alfredo
dc.contributor.author	Korman, Matias
dc.contributor.author	Langerman, Stefan
dc.contributor.author	Sacristán Adinolfi, Vera
dc.contributor.author	Saumell Mendiola, Maria
dc.date	2010
dc.identifier.citation	Bose, P. [et al.]. Some properties of higher order delaunay and gabriel graphs. A: Canadian Conference on Computational Geometry. "22nd Canadian Conference on Computational Geometry". Winnipeg: 2010, p. 13-16.
dc.identifier.uri	http://hdl.handle.net/2117/9119
dc.language.iso	eng
dc.relation	http://cccg.ca/proceedings/2010/paper06.pdf
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
dc.subject	Graph theory
dc.subject	Combinatorial analysis
dc.subject	Geometric analysis
dc.subject	Diameter (Geometry)
dc.subject	Grafs, Teoria de
dc.subject	Anàlisi combinatòria
dc.subject	Geometria analítica
dc.title	Some properties of higher order delaunay and gabriel graphs
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/conferenceObject
dc.description.abstract	We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the following combinatorial and geometric properties of these graphs: spanning ratio, diameter, chromatic number, and minimum number of layers necessary to partition the edges of the graphs so that no two edges of the same layer cross.

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author