Collection: gradient graphs

In graph theory, a gabriel graph is a graph where an edge can only be formed between two nodes if the circle formed by those two nodes does not overlap any other nodes. 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.

gradient graphs is an original code art algorithm; each run of the code produces a random visual output. 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 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.

gradient graphs was created with JavaScript and p5.js.

Copyright (C) 2022-2025 brittni and the polar bear LLC.