Grasshopper

algorithmic modeling for Rhino

Ivy

ADDON

Component Index > Ivy

0|Param
1|Create Graph
1|Mesh Graph
2|Weight Graph
3|Primary Segmentation
3|Tree Graph
4|Tools Graph
5|Iterative Segmentation
5|Split Graph
6|Special Segmentation
6|Use Graph
7|Agent Graph
7|Fabrication
8|Mesh Info
8|Visualize Graph
9|Other Tools

3|Tree Graph

DFS Edge Weight
Compute the a tree from the graph using a Depth first search based on edge weight
MST with concavity detect
Compute the minimum spanning tree for the mesh graph including convex, concave and flat region detection. This uses a modified Kruskal algorithm with weight limits
MST Kruskal
Compute the minimum spanning tree for the mesh graph using a modified Kruskal's algorithm
MST Djikstra
Compute the minimum spanning tree for the mesh graph using Djikstra's algorithm
MST Prim
Compute the minimum spanning tree for the mesh graph using Prim's algorithm
Multi Root MST edge weight
Constructs a set of trees based on the given graph
Multi Root MST node weight
Constructs a set of trees based on the given graph
Multi Root MST concavity
Constructs a set of trees based on the given graph
Shortest Paths in a weighted mesh graph
Compute the shortest (Cheapest) path between 2 nodes in a mesh graph using Djikstra's algorithm. Calculation uses edge weight.

2|Weight Graph

Color Edge Weight
Assign a weight value to graph edges based on the color averaged for an edge. Values will be normalized to the 0...1 interval
Custom Edge Weight
Assign a custom weight to graph edges - Warning ! If you reference mesh edges, naked edges will not be considered. Values are normalized in the 0..1 interval
Face Angle Edge Weight
Assign a weight value to graph edges based on the agle between the faces conected by an edge. Values will be normalized to the 0...1 interval
Custom Face Weight
Assign a custom weight to graph nodes (mesh Faces). Values are normalized in the 0..1 interval
Face Size Node(mesh face) Weight
Assign weight to graph nodes based on the area of the mesh faces. Largest faces will have the smallest values.
Face Midpoint Distance Edge Weight
Assign a weight value to graph edges based on the distance between the midpoints of the faces the edge conects. Values will be normalized to the 0...1 interval

9|Other Tools

NodeGeo to Graph
Insert the node geometry into a MeshGraph
GraphStructure
Create a set of lines that approximate the graph and have different offsets from the base mesh according to the number of steps from the root
Set Node Geometry
Assign geometry (flat curves) to nodes
ThinMesh
Create a thiner mesh based on the connections in the MeshGraph
Weave MGraphs
Weave two MeshGraph segmentations

4|Tools Graph

Cull Graph Duplicates
Cull graph duplicates from a graph list. Equality is based on topology
Get deepest nodes
Retrieves the deepest nodes in a tree graph. Here the deepest node/nodes are considered the ones that have the longest traceable route to a leaf(edge node)
Graph Equality
Test equality between two mesh graphs. Only topological equality is tested
Set Tree Root
Set the root of the graph to the specified mesh node

7|Fabrication

CustomFlap
Create a custom data flap to use for the unroll component
Flat Fabrication
Takes care of the fabrication preparation for the parts
SimpleFlap
Create a standard simple data flap to use for the unroll component
Flat Fabrication Multi
Takes care of the fabrication preparation for the parts.
Special version for dealing with complex data structures. Use especially in conjunction with multiple weaved strands

8|Mesh Info

EdgeAngle
Extracts the dihedral angle of an edge. Only the edges in the graph are used
EdgeTraversal
Calculates the traversal distance for an edge of the graph. Here it is the lenght of the polyline connecting the face centers and edge midpoint
EdgeTypes
Extracts the edges of the base mesh for the graph based on their use in the graph. Graph Edge or Cut Edge
Orange PEEL Edges
Gets a set of edges in the MeshGraph that separate peel layers

1|Create Graph

Decompose Graph
Outputs the relevant information (geometric and numeric) stored in the MeshGraph object
Graph from Mesh
Creates the graph correspondence of a mesh. Faces will be nodes in graph and the mesh topological edges will be the edges in the graph
Graph to Mesh
Creates the mesh from the graph nodes(faces) and edges. Only the nodes still present in the graph will be referenced back into mesh faces.

6|Use Graph

MeshGraph Unroll
Unroll the underlying mesh of a tree graph.
MG_Structure
Create a set of lines that approximate the graph and have different offsets from the base mesh according to the number of steps from the root
CreaseMesh
Create a set of creases in the faces of the mesh along the edges of the Mesh Graph

5|Split Graph

Weight Deviation Split Graph
Splits a mesh graph in subgraphs based on whether edge weight is larger than next edge in tree hierarchy
Weight Partition Graph
Parts a mesh graph in subgraphs based on whether edge weight falls in the supplied interval
Weight Split Graph
Splits a mesh graph in subgraphs based on whether edge weight falls in the supplied interval

3|Primary Segmentation

MST Kruskal concavity
Compute the minimum spanning tree for the mesh graph including convex, concave and flat region detection. This uses a modified Kruskal algorithm with weight limits
MST Kruskal Valence
Compute the minimum spanning tree for the mesh graph using a modified Kruskal's algorithm with max valence preference

7|Agent Graph

Agents Programmed Behavior
Create a series of trees on the given graph that spread out based on the limits imposed and a programed behavior that switches between two characters Explore and Consume
Agents Control Random
Create a series of trees on the given graph that spread out based on the limits imposed and the behavior given as a chance pick between two characters Explore and Consume

1|Mesh Graph

Graph Edges
Outputs the relevant information (geometric and numeric) stored in the MeshGraph object edges
Graph Nodes
Outputs the relevant information (geometric and numeric) stored in the MeshGraph object nodes

5|Iterative Segmentation

K-Means Clustering
Splits a mesh graph (not a tree) in an iterative fashion based on a number of parts specified by the user

8|Visualize Graph

Visualize_Graph
Create a visualization of the graph using the base mesh

0|Param

Mesh Graph
Parameter for storing a collection of mesh graphs

6|Special Segmentation

MeshGraph Visual Unroll
Unroll the underlying mesh of a tree graph on the object itself as a from finding technique.

© 2018   Created by Robin Rodricks and Andrew Heumann.   Hosted by

Badges  |  Report an Issue  |  Terms of Service