Witness Gabriel Graphs

@article{Aronov2009WitnessGG,
  title={Witness Gabriel Graphs},
  author={Boris Aronov and Muriel Dulieu and Ferran Hurtado},
  journal={Comput. Geom.},
  year={2009},
  volume={46},
  pages={894-908}
}
We consider a generalization of the Gabriel graph, the witness Gabriel graph. Given a set of vertices P and a set of witness points W in the plane, there is an edge ab between two points of P in the witness Gabriel graph GG−(P,W ) if and only if the closed disk with diameter ab does not contain any witness point (besides possibly a and/or b). We study several properties of the witness Gabriel graph, both as a proximity graph and as a new tool in graph drawing. 

Citations

Publications citing this paper.
SHOWING 1-10 OF 14 CITATIONS

Algorithms and Discrete Applied Mathematics

  • Lecture Notes in Computer Science
  • 2015
VIEW 10 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED

Matchings in higher-order Gabriel graphs

VIEW 2 EXCERPTS
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 17 REFERENCES

Witness (Delaunay) Graphs

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Proximity Drawings

  • Handbook of Graph Drawing and Visualization
  • 2013

Peter Eades

G. Di Battista
  • and R. Tamassia an I. G. Tollis. Graph Drawing. Algorithms for the Visualization of Graphs. Prentice Hall
  • 1999
VIEW 1 EXCERPT

The strength of weak proximity

G. Di Battista, G. Liotta
  • Journal of Discrete Algorithms
  • 1992

and S

G. Di Battista, G. Liotta
  • Whitesides:. The strength of weak proximity. Journal of Discrete Algorithms, 4(3):384–400
  • 1992
VIEW 1 EXCERPT

Similar Papers

Loading similar papers…