Overview of the GraphTheory[GeometricGraphs] Subpackage
List of GraphTheory[GeometricGraphs] Subpackage Commands
Gallery of GraphTheory[GeometricGraphs]
The GraphTheory[GeometricGraphs] subpackage collects routines for generating graphs from geometric data, typically sets of points in 2 or 3 dimensions.
Some of these geometric graphs have well-known relationships with one another:
The Euclidean minimum spanning tree on P is a subgraph of the relative neighborhood graph on P.
The nearest neighbor graph on P is a subgraph of the Gabriel graph and the sphere of influence graph on P.
The relative neighborhood graph on P is a subgraph of the Urquhart graph on P.
The Urquhart graph on P is a subgraph of the Gabriel graph on P.
The Gabriel graph on P is a subgraph of the Delaunay graph on P.
The following is a list of geometric graphs that can be generated.
The following is a gallery of geometric graphs that can be generated.
Euclidean minimum spanning tree
Farthest neighbor graph
Geometric minimum spanning tree
Nearest neighbor graph
Relative neighborhood graph
Sphere of influence graph
Unit disk graph
Download Help Document
What kind of issue would you like to report? (Optional)