A Gabriel graph is one where the vertices are points and there
is an edge between two points if the maximal ball between the points
contains no other points.
Usage
gg(x, r = 1, method = NULL, usedeldir = TRUE, open = TRUE,
k = NA, algorithm = 'cover_tree')
logical. Whether to use the deldir package or not.
open
logical. If TRUE, open balls are used in the definition.
k
If given, get.knn is used from FNN to approximate
the Gabriel graph. Only the k nearest neighbors to
the points are used to determine whether an edge should be made or not.
This will be much faster and use less memory for large data sets, but
is an approximation unless k is sufficiently large.