TRADA pavilion

The pavilion is based on a form-found surface based on a mathematical idealisation of the traditional Gaudi or Frei Otto approach but modified to a more realistic form using our original research. The shell is discretised into planar three-valence mesh using an innovative algorithm, thereby allowing the free form surface to be constructed with flat panels. These panels are connected with standard hinges and the structure works as fully pinned structure with no bending capacity between the panels. The structure is designed to withstand accidental loads, self-weight and additional dead loads, such as lighting fixtures.
The plywood panels for this pavilion were fabricated using a three-axis CNC router. The routing included rebating of the hinges, drilling of holes for bolts and finally cutting the contours of the panels. The digital input to the router was drawings created using a parametric GH model that places the hinges in the most favourable position. The edge stiffeners are connected with fingerjoints.

The pavilion is scheduled to be part of the Trada Timber Exposition 2012 and Ecobuild Exposition 2013.

Next Post >

Comment

You need to be a member of Grasshopper to add comments!

Comment by Morgan Rohla on August 18, 2022 at 4:56am: I have been to TRADA pavilion twice and every time I am impressed with its beauty. It is set in a picturesque location on a hill overlooking the city of Budapest, Hungary and offers a stunning panoramic view of the city. Read https://michaelleander.me/how-to-optimize-your-education-for-best-g... article to learn about best educational tools. The architecture of TRADA pavilion is modern, elegant and simple at the same time. The building was designed by Zsolt Badalyan and Istvan Szabo, who won an international competition for its design in 1992.

Comment by sadrakhosravan on November 30, 2015 at 7:57am: Hi, it's great job

i have a question, how you can Tessellate your mesh? i have a mesh from kangroo and i wanna to paneling that what should i do?

Comment by John Harding on October 2, 2012 at 9:11am: Here is a video explaining how the form was found. The free edges posed some fun structural challenges (traditionally solved by Isler by having up-turned edges), but otherwise the shell ended up working in membrane action really well. During the form-finding the masses update automatically at each time step, setting up a non-linear system with the variable length springs. Somehow, the system still reaches equilibrium, and when the system energy is zero the form is perfectly balanced for the self-weight of the area elements. Using a hex net ensured static determinacy during the process.

Trada Shell from john harding on Vimeo.

What we found most interesting was that the planar remeshing technique was making something structurally sound but still quite complex buildable out of flat panels, and not just being used as a 'freeform nurbs realiser' created by some crazy cool cat ;)

Comment by Harri on September 24, 2012 at 5:06pm: This used a clustering algorithm to spread a user inputed number of planes evenly across a high resolution mesh using distance or curvature as a metric. These planes are then intersected with their neighbours and corrections are made if the cluster topology does not match the planar face topology.

It closely follows the work of Cutler http://www.cs.rpi.edu/~cutler/publications/planar_remeshing_gi07.pdf

and Cohen-Steiner

http://faculty.cs.tamu.edu/schaefer/teaching/689_Fall2006/p905-cohe...

We believe it is the largest structure to be built using the technique. The bow tie shaped panels are seen in areas of negative curvature.

Evolute use non-linear least squares optimisation - I'm not sure if their method works for negative curvature and n-gon polygons.

Computational time for clustering and planarisation was about 20 seconds for 300 or so faces. Some manual tweaking is required as the correction algorithms are not 100% robust.

Comment by Mateusz Zwierzycki on September 24, 2012 at 4:22pm: How does your geometry relate to Mr. Pottmann's and Evolute stuff approach ( I mean planar hexagons ) ?

Assuming that this geometry was obtained via some kind of iterative process, what was the amount of computation time ?