• Citer

Empty region graphs

par Cardinal, Jean ;Collette, Sébastien ;Langerman, Stefan
Référence Computational geometry, 42, 3, page (183-195)
Publication Publié, 2009-04

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

A family of proximity graphs, called Empty Region Graphs (ERG) is presented. The vertices of an ERG are points in the plane, and two points are connected if their neighborhood, defined by a region, does not contain any other point. The region defining the neighborhood of two points is a parameter of the graph. This way of defining graphs is not new, and ERGs include several known proximity graphs such as Nearest Neighbor Graphs, β-Skeletons or Θ-Graphs. The main contribution is to provide insight and connections between the definition of ERG and the properties of the corresponding graphs. We give conditions on the region defining an ERG to ensure a number of properties that might be desirable in applications, such as planarity, connectivity, triangle-freeness, cycle-freeness, bipartiteness and bounded degree. These conditions take the form of what we call tight regions: maximal or minimal regions that a region must contain or be contained in to make the graph satisfy a given property. We show that every monotone property has at least one corresponding tight region; we discuss possibilities and limitations of this general model for constructing a graph from a point set. © 2008 Elsevier B.V. All rights reserved.