Gradient Graphs

A gabriel graph is a special kind of graph in graph theory where an edge can only be formed between two nodes if the circle formed by those two nodes contains no other nodes in the graph. A random geometric graph is a graph where an edge can only be formed between two nodes if they are less than a certain distance away from each other. The Gradient Graphs program generates random gabriel graphs and random geometric graphs, where the graphs have a random number of nodes and each node has a random position and color. Nodes are then connected by lines and circles that have a gradient from one point color to the other. Users can interact with the project to remove the nodes, edge lines, or edge circles, choosing how they would like the graph to be displayed.

Sample Variations

See the Project on fx(hash)

This project was published as a generative NFT collection on May 8, 2022.

On fx(hash), you can explore project variations, mint a new variation token, or explore the variation tokens that have been minted in the past.