Dijkstra Algorithm
Instructor: Panagiotis Michalatos
Tools: C# | Grasshopper
Time: 23Fall
Try applying Dijkstra's Algorithm on remeshing / generation effect on mesh
.
Experiment with what outcome it could create
Contour over eometry
A contour is a line formed by equidistant points, but it is difficult to partition a contour uniformly over irregular geometry. By labeling the shortest distance, we can get the contour of a mesh based on a point.
Accurate control
It is also possible to control the contour position more accurately by using the proportional control on the edge.
Contour over irregular eometry
Applied to complex geometries, it allows for a clear analysis of modeling logic and form features.
Connecting contour and endpoints
The generated contour points are then connected to the endpoints with minimal paths to achieve the effect of reconstructing the generation on the existing mesh.
test on geometry
The position of the generated structure can be controlled by endpoints
test on Rabbit