GABRIELGRAPH  Gabriel Graph of a set of points.

   EDGES = gabrielGraph(PTS)
   Computes the Gabriel graph of the input set of points PTS. The Gabriel
   graph is based on the euclidean Delaunay triangulation, and keeps only
   edges whose circumcircle does not contain any other input point than
   the edge extremities.

   [NODES, EDGES] = gabrielGraph(PTS)
   Also returns the initial set of points;

   Example
     pts = rand(100, 2);
     edges = gabrielGraph(pts);
     figure; drawPoint(pts);
     hold on; axis([0 1 0 1]); axis equal;
     drawGraph(pts, edges);

   See also
     graphs, drawGraph, delaunayGraph

Package: matgeom