par Bose, Prosenjit 
;Collette, Sébastien ;Hurtado, Ferran ;Korman, Matias ;Langerman, Stefan ;Sacristán, Vera;Saumell Mendiola, Maria
Référence Computational geometry, 46, 2, page (131-139)
Publication Publié, 2013-02
;Collette, Sébastien ;Hurtado, Ferran ;Korman, Matias ;Langerman, Stefan ;Sacristán, Vera;Saumell Mendiola, Maria Référence Computational geometry, 46, 2, page (131-139)
Publication Publié, 2013-02
Article révisé par les pairs
| Résumé : | 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. |
