hole new realm?
This Parametric Design Workshop will provide you with the necessary knowledge and ability to use Grasshopper, a free visual programming plugin in Rhinoceros. The workshop will also include a hands on parametric project.
If you already know Grasshopper and would like to uplift your parametric knowledge, then you can choose option 2.
Option 1: General Workshop for Beginners - 16 hours: Start 22.06.2019
Option 2: Intensive Workshop for Intermediates - 8 hours: Start 29.06.2019
Kindly reserve your Tickets here:
https://billetto.eu/en/e/parametric-design-workshop-rhino-grasshopper-lava-berlin-tickets-348801/…
hole new realm?
This Parametric Design Workshop will provide you with the necessary knowledge and ability to use Grasshopper, a free visual programming plugin in Rhinoceros. The workshop will also include a hands on parametric project.
If you already know Grasshopper and would like to uplift your parametric knowledge, then you can choose option 2.
Option 1: General Workshop for Beginners - 16 hours: Start 17.08.2019
Option 2: Intensive Workshop for Intermediates - 8 hours: Start 24.08.2019
Kindly reserve your Tickets here:
https://billetto.eu/en/e/parametric-design-workshop-rhino-grasshopper-lava-berlin-tickets-369321…
hole new realm?
This Parametric Design Workshop will provide you with the necessary knowledge and ability to use Grasshopper, a free visual programming plugin in Rhinoceros. The workshop will also include a hands on parametric project.
If you already know Grasshopper and would like to uplift your parametric knowledge, then you can choose option 2.
Option 1: General Workshop for Beginners - 16 hours: Start 16.11.2019
Option 2: Intensive Workshop for Intermediates - 8 hours: Start 23.11.2019
Kindly reserve your Tickets here:
https://billetto.eu/en/e/parametric-design-workshop-rhino-grasshopper-lava-berlin-tickets-385460/…
hole new realm?
This Parametric Design Workshop will provide you with the necessary knowledge and ability to use Grasshopper, a free visual programming plugin in Rhinoceros. The workshop will also include a hands on parametric project.
If you already know Grasshopper and would like to uplift your parametric knowledge, then you can choose option 2.
Option 1: General Workshop for Beginners - 16 hours: Start 18.01.2020
Option 2: Intensive Workshop for Intermediates - 8 hours: Start 25.01.2020
Kindly reserve your Tickets here:
https://billetto.eu/e/parametric-design-workshop-rhino-grasshopper-lava-berlin-Tickets-397133…
hole new realm?
This Parametric Design Workshop will provide you with the necessary knowledge and ability to use Grasshopper, a free visual programming plugin in Rhinoceros. The workshop will also include a hands on parametric project.
If you already know Grasshopper and would like to uplift your parametric knowledge, then you can choose option 2.
Option 1: General Workshop for Beginners - 16 hours: Start 07.03.2020
Option 2: Intensive Workshop for Intermediates - 8 hours: Start 14.03.2020
Kindly reserve your Tickets here:
https://billetto.eu/e/parametric-design-workshop-rhino-grasshopper-lava-berlin-Tickets-409585
…
s with geco stuff but boxCorners is some common starting point)
so
| BoxCorners(*args, **kwargs) | | Extract all 8 corners of a box. | Input: | box [Box] - Base box | Returns: | corner a [Point] - Corner at {x=min, y=min, z=min} | corner b [Point] - Corner at {x=max, y=min, z=min} | corner c [Point] - Corner at {x=max, y=max, z=min} | corner d [Point] - Corner at {x=min, y=max, z=min} | corner e [Point] - Corner at {x=min, y=min, z=max} | corner f [Point] - Corner at {x=max, y=min, z=max} | corner g [Point] - Corner at {x=max, y=max, z=max} | corner h [Point] - Corner at {x=min, y=min, z=max}
import ghpythonlib.components as ghcomp
import ghpythonlib.parallel
a = ghcomp.BoxCorners(x).cornera
#a = ghcomp.BoxCorners(x).corner a
#a = ghcomp.BoxCorners(x).corner_a
None of the above works. Thanks!…
ld work.
For example there's a grid shell and I've got a number of control points (for example 3) that can move up and down.
Depending on the control points I get forms that are structurally good and some that are bad.
In my office we've got a GH-Component, which leads the geometry in structural members and solves the structural forces and so on through an external Software called Sofistik and afterwards gives back to GH some Values, for example maximum bending moments. (Like Karamba)
Now I want to create this optimization component or something like that to minimize e.g. the bending moments in the given geometry.
Let's start with the work of the component.
So when I've three control points that can only move in z-direction.
P1(0,0,Z1), P2(10,0,Z2), P3(5,5,Z3)
They only depend on Z, so everything depends on Z1 to Z3 which have a range between 0 and 10 f.e.
First I want to get some (between 9 and 15) random Particles, one particle consists of this 3 different Z's.
So for example the first particle Part1 is [Z1=10, Z2=5, Z3=7]
and the second particle Part2 is [Z1=7, Z2=1, Z3=9]
and so on.
I created these Start Particles in a Cluster. See attached file.
I also tried this in C#, but thought it is easier in GH.
After I've got the Start Particles I want to give out the first particle and evaluate with its including Z's the target value in GH. Therefore I had to take the first branch and graft this branch (Discussion before)
Afterwards I want to save this Target Value that depends on the first starting Particle. Then I want to give out the second starting Particle to evaluate its target Value and store it. And so on till the last target Value of the last Starting Particle got assigned.
Then I want to assign the particles with its target values. E.g. part1: t=0.9, part2: t=1.8...
Then I want to define neighborhoods or the count of the expected local minima.
These neighborhoods can look like: Each neighborhood has to include not less than 3 particles. And the particles have to be next to each other.
E.g. if there are 12 particles and I want to have a look for 3 local minima, I need 3 or 4 neighborhoods. Then I would take 3 neighborhoods, because the more particles in one neighborhood, the better.
So the Count of the neighborhoods would be N=min{(Count of Part/3)& N_min}
How to define these neighborhoods I don't know at the moment. I think it has to be searched for the distance between the particles. E.g. part1 with (9,9,9) and part2 with (9,9,8) are next to each other but part 3 with(1,1,2) is far away.
Then each StartParticle is set to Partx_localbest.
And in each Neighbourhood the best of these localbeststs is Part_NyBest. (The best ist the one with the smallest target Value)
Loop:
Now I want to create new Particles. These Particles don't change their Z-values randomly. They change their Z-Values depending on Part_NxBest and Part_localBest. Therefore it has to be evaluated a new velocityfactor with v_Partx_new=0,792*v_PartxOld+1,5*random(0,1)*(partx_localbest-partx)+1,5*random(0,1)*(part_NyBest-partx)
The new particles will then be partx_new=partx+v_Partx_new.
The new Particle partx_new will be set to partx and then set in the output.
then there has to be caught the targetValue of part1 afterwards part2 can be put out and its target value caught and so on.
Then it has to be looked for the Partx_localbest through comparing the partx_localbest and its target value with the new part_x and its target value. If the target value of the new partx is smaller than partx_localbest,
then partx_localbest is the new partx.
This has to be done for each partx. Afterwards the same for neighborhoods best (best of all partx_localbest in one neighborhood)
Endloop if velocity gets small.
Output all part_NxBest
Output all targetvalues of the part_NxBests.
So in the Input there have to be:
StartParticles if they are given through the cluster attached.
Device on the target Value like in the attached gh.file from David Rutten I found in the discussions
Count of neighborhoods
And in the output
Output particle for evaluation
Output all part_NxBest
Output all targetvalues of the part_NxBests
Hope didn’t forget anything. And hope it isn’t crushed to badly. Sorry for my bad English by the way ;-)
For more explanation, how the PSO works in other programs. There’s attached a workflow script (is it called like that?) I think for GH it should be a little bit changed like I tried in my explanations.
So if you can help me a in some parts or you have any advices would be great, otherwise thank you nevertheless!!!!
Thankfully there’s no limit for the words in the discussions :-D
Best, Heiko
…
surface between 2 cross-listed series of points which happen to be "Divides" of the edges of the 3D surface (some kind of planar geodesics if you want).
To do so, I am extracting the intersections between the 3D surface and a series of planes that are rotated (with an angular increment defined as precision) around an axis defined by the straight line between the points.
Hence I end up with a bunch of planar curves. I need to extract them and order them into lists (1 list per pair of points) to extract the shortest curve between each pair of points.
If the first list of point is numbered: 1, 2, 3, 4..... & the second list is lablelled a, b, c, d.....
I can't find a way to extract the shortest point curve of the list between
1 and a, and between 1 and b, and between 1 and c, ... and between 2 and a, and between 2 and b, ...
I think the problem would be fairly easy to solve if I could use VB or Python or any code but I dont know how to code and I am in quite a rush to hand the project in..
Also, I have been using a Python component downloaded from this forum which evaluates if a point is on a curve and returns the point. I modified the code so that it returns the Curve instead of the pt.
If you guys have an idea how to solve this, you would clearly be my saviour :)
Here are a 3dm, the gh and the python component. I have also been using the Kangaroo component that kills duplicate curves..
…
e Workshop and Conference will be a gathering of the global community of innovators and pioneers in the fields of architecture, design and engineering.
The event will be in two parts, a four day Workshop 14-17 July, and a public conference beginning with Talkshop 18 July, followed by a Symposium 19 July. The event follows the format of the highly successful preceding events sg2010 Barcelona, sg2011 Copenhagen, sg2012 Troy, and sg2013 London.
sg2014: Hong Kong
Image: Cities without Ground - Adam Frampton, Jonathan D Solomon and Clara Wong
URBAN COMPACTION
Large cities thrive on density and diversity. But beyond the energy and pollution advantages of the elevator over the automobile, complex issues are at play in concentrating population and built infrastructure in contemporary high-rise cities. How do you meet the challenges of system design for high quality compact urban environments?
Designing for high and increasing density in cities is a complex and wicked problem that calls for innovative approaches to modelling in diverse areas of the city’s dynamics.
sg2014 Challenge: Urban Compaction
WORKSHOP
The SG Workshop is a unique creative cauldron attracting attendees from across the world of academia, professional practice as well as many of the brightest students. The Workshop is open to 100 applicants who come together for four intensive days of design and collaboration.
The annual Workshop is organised around Clusters. Clusters are hubs of expertise comprising of people, knowledge, tools, materials and machines. The Clusters provide a focus for Workshop participants working together, within a common framework.
We now have an open call to submit proposals for Workshop Clusters
call for clusters
CONFERENCE
Talkshop Conference Day One
After four intense days of innovative work, the first day of the conference, the Talkshop, offers an opportunity for critical reflection on what has been accomplished in the Workshop. Talkshop will be an opportunity to open debates, pose questions, challenge orthodoxies, and propose new ideas.
Talkshop will feature informal and open discussions between Cluster participants, leading practitioners and emerging talents in digital design, offering inside perspectives on how the landscape of computational design is reshaping built form.
Symposium Conference Day Two
The second day of the conference, the Symposium, will feature invited keynote speakers showcasing major projects and research from around the globe that mark out the territory of the year's Challenge. The Symposium is a unique opportunity to hear insights into the challenges ahead for the discipline.
Interwoven throughout the day will be reports and highlights from each Workshop Cluster, giving an opportunity to view work created during the previous four days of intensive collaboration, design and development.
More information about the conference, including speakers, to be posted soon.
www.Smartgeometry.org…
Added by Shane Burger at 10:51am on February 3, 2014
ome simplified examples together for you.
I have also attached my definition from the second post, which has the DOM component. Just double click the component to see the code.
Scripting is easy, you basically just write VBA code here:
All you need to do is substitute the *****WRITE CODE HERE**** bit with A = X.Domain.Max (note the A and X in place of the origianal C and D). And note the plus/minus symbols on the vb code block? These add or remove variables as required. I have some in my later work which have 4 inputs 6 outputs (See Mondays post).
Will get back to you ASAP with info on excel and how to interpolate data.…