Sphere-of-Influence Graphs

Let be a set of vertices chosen from a grid. Given a vertex in , let be the closest neighbor to in and draw a circle with center and radius . Draw an edge between two vertices and if their circles intersect. In other words, connect and if . This gives the sphere-of-influence graph for the given set of vertices.


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


G. T. Toussaint, "A Graph-Theoretic Primal Sketch," Computational Morphology (G. T. Toussaint, ed.), Amsterdam: Elsevier, 1988 pp. 220–260.
M. J. Lipman, "Integer Realizations of Sphere-of-Influence Graphs," Congr. Numer., 91, 1991 pp. 63–70.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.