Eggs In a Basket



Balancing Toy
Balancing Toy
Balancing Toy
Year
2019
MIT SA+P
Year
2019
MIT SA+P
Year
2019
MIT SA+P
This balancing toy was designed with recursive algorithms, where a specific sequence is required to perfectly balance the objects.
This balancing toy was designed with recursive algorithms, where a specific sequence is required to perfectly balance the objects.
This balancing toy was designed with recursive algorithms, where a specific sequence is required to perfectly balance the objects.









Course
Creative Computing, MIT SA+P, 2019. Instructor: Brandon Clifford
Project Description
This balancing toy was designed with recursive algorithms, where a specific sequence is required to perfectly balance the objects. As a personal goal, all the geometries and computing for this were completed parametrically and with an early build for SubD geometries. This approach means that the Grasshopper definition could solve for a series of iterations on the same toy.
Course
Creative Computing, MIT SA+P, 2019. Instructor: Brandon Clifford
Project Description
This balancing toy was designed with recursive algorithms, where a specific sequence is required to perfectly balance the objects. As a personal goal, all the geometries and computing for this were completed parametrically and with an early build for SubD geometries. This approach means that the Grasshopper definition could solve for a series of iterations on the same toy.
Course
Creative Computing, MIT SA+P, 2019. Instructor: Brandon Clifford
Project Description
This balancing toy was designed with recursive algorithms, where a specific sequence is required to perfectly balance the objects. As a personal goal, all the geometries and computing for this were completed parametrically and with an early build for SubD geometries. This approach means that the Grasshopper definition could solve for a series of iterations on the same toy.
Dominant Void
Everything
Dominant Void
Everything
Dominant Void
Everything