On Locally Gabriel Geometric Graphs

@article{Govindarajan2015OnLG,
  title={On Locally Gabriel Geometric Graphs},
  author={Sathish Govindarajan and A. Khopkar},
  journal={Graphs and Combinatorics},
  year={2015},
  volume={31},
  pages={1437-1452}
}
Let $$P$$P be a set of $$n$$n points in the plane. A geometric graph $$G$$G on $$P$$P is said to be locally Gabriel if for every edge $$(u,v)$$(u,v) in $$G$$G, the Euclidean disk with the segment joining $$u$$u and $$v$$v as diameter does not contain any points of $$P$$P that are neighbors of $$u$$u or $$v$$v in $$G$$G. A locally Gabriel graph(LGG) is a generalization of Gabriel graph and is motivated by applications in wireless networks. Unlike a Gabriel graph, there is no unique LGG on a… Expand

Figures and Topics from this paper

Edge complexity of geometric graphs on convex independent point sets

References

SHOWING 1-10 OF 27 REFERENCES
Independence numbers of locally sparse graphs and a Ramsey type problem
  • N. Alon
  • Computer Science
  • Random Struct. Algorithms
  • 1996
Independence numbers of locally sparse graphs and a Ramsey type problem
On locally Delaunay geometric graphs
Proximity Structures for Geometric Graphs
Distributed construction of a planar spanner and routing for ad hoc wireless networks
  • Xiangyang Li, G. Calinescu, P. Wan
  • Computer Science
  • Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
  • 2002
Local solutions for global problems in wireless networks
  • J. Urrutia
  • Computer Science, Mathematics
  • J. Discrete Algorithms
  • 2007
Extremal problems in discrete geometry
The Unit Distance Problem for Centrally Symmetric Convex Polygons
On Sets of Distances of n Points
...
1
2
3
...