Some properties of k-Delaunay and k-Gabriel graphs

Prosenjit Bose; Sébastien Collette; Ferran Hurtado; Matias Korman; Stefan Langerman; Vera Sacristán; Maria Saumell

doi:10.1016/j.comgeo.2012.04.006

Some properties of k-Delaunay and k-Gabriel graphs

Prosenjit Bose, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Vera Sacristán, Maria Saumell

INF - System Information Sciences

Research output: Contribution to journal › Article › peer-review

10 Citations (Scopus)

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, connectivity, 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.

Original language	English
Pages (from-to)	131-139
Number of pages	9
Journal	Computational Geometry: Theory and Applications
Volume	46
Issue number	2
DOIs	https://doi.org/10.1016/j.comgeo.2012.04.006
Publication status	Published - 2013 Feb

Keywords

Geometric graphs
Proximity graphs

ASJC Scopus subject areas

Computer Science Applications
Geometry and Topology
Control and Optimization
Computational Theory and Mathematics
Computational Mathematics

Access to Document

10.1016/j.comgeo.2012.04.006

Fingerprint Dive into the research topics of 'Some properties of k-Delaunay and k-Gabriel graphs'. Together they form a unique fingerprint.

Cite this

@article{076e99d808354a4d8583f45ae53addc3,

title = "Some properties of k-Delaunay and k-Gabriel graphs",

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, connectivity, 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.",

keywords = "Geometric graphs, Proximity graphs",

author = "Prosenjit Bose and S{\'e}bastien Collette and Ferran Hurtado and Matias Korman and Stefan Langerman and Vera Sacrist{\'a}n and Maria Saumell",

year = "2013",

month = feb,

doi = "10.1016/j.comgeo.2012.04.006",

language = "English",

volume = "46",

pages = "131--139",

journal = "Computational Geometry: Theory and Applications",

issn = "0925-7721",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Some properties of k-Delaunay and k-Gabriel graphs

AU - Bose, Prosenjit

AU - Collette, Sébastien

AU - Hurtado, Ferran

AU - Korman, Matias

AU - Langerman, Stefan

AU - Sacristán, Vera

AU - Saumell, Maria

PY - 2013/2

Y1 - 2013/2

N2 - 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, connectivity, 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.

AB - 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, connectivity, 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.

KW - Geometric graphs

KW - Proximity graphs

UR - http://www.scopus.com/inward/record.url?scp=84867572151&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867572151&partnerID=8YFLogxK

U2 - 10.1016/j.comgeo.2012.04.006

DO - 10.1016/j.comgeo.2012.04.006

M3 - Article

AN - SCOPUS:84867572151

VL - 46

SP - 131

EP - 139

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

SN - 0925-7721

IS - 2

ER -

Some properties of k-Delaunay and k-Gabriel graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this