your case you can solve your problem using the flatten on both curves and then loft... and copy/paste for every curve XD (this is a really ugly solution).
The loft component and others components, works in lists, and the input geometry (in this case curves) that you want loft, has to be in the same list. If you use the param viewer component, you can see the data structure (list / paths / branches / etc).
With the flatten component you erase and simplify this data structure and put everything in one simple list, if you merge the two curves, youll put both curves in the same list, so you can loft them.
In resume.... do number 3 in this image :D
…
d-drive or the web or God knows where.
Also, "3 simple spheres" implies that it's possible to determine what "simple" is. Perhaps you really do need 250 components and a runtime of 20 seconds in order to find that single point coordinate that is vital to your design.
An approach which might work but I'm not sure warrants the investment would be to define specific groups of components. Something like "If A is connected to B, then A and B are connected to C and finally C is hooked up to D and E, then you may be able to get the same result using only component X and Y". Not only is this approach free from unknowns it also tries to help the user out. I'd much rather be told "why don't you try using a Key/Value search here?" than "You're a f*cking idiot mate."
--
David Rutten
david@mcneel.com
Poprad, Slovakia…
Added by David Rutten at 4:14pm on January 12, 2012
into a z-coordinate it just takes one of those values. For it to be an attractor you usually measure the distance (D output). If you plug that into the z-coordinate it will change when you move the attractor point around.
Also you had the option "only draw preview geometry for selected objects" enabled (one of the icons in the top right of Grasshopper). I wouldn't recommend that. It gets very confusing then. Just hide stuff you dont want to see, which is usually everything except your final output. Just middle-click on selected components and hide them. I added a custom preview at the end, which looks a lot nicer than the usual red jelly that Grasshopper shows by default.
Hope that helps!…
t, but I want to offset them in a series of six values (lets say 8,4,0,4,8,12 to keep it simple). Essentially I want to create a "domain" that goes from 8 to 12 but by going negative down to 0 first before bouncing back up. I don't think I can use the construct domain component to achieve this and I don't know how to do it.
Thanks in advance!
Ben
EDIT: I know I can easily accomplish this by plugging a multiline panel with the given values into the D input of Offset Surface, but I would like to be able to do it computationally so that if I change an input to 3, for example, it would adjust the series of numbers to be 6,3,0,3,6,9 or if I used 2, the adjustment would be 4,2,0,2,4,6. It doesn't have to be exactly this pattern but I am looking for a "bulge" in my offset surfaces with a 0 value in the middle.
…
ace Syntax." eCAADe 2013 18 (2013): 357.
http://www.sss9.or.kr/paperpdf/mmd/sss9_2013_ref048_p.pdf
The measure Entropy is newer. I hereby explain it (from my PhD dissertation):
Entropy values, as described in (Hillier & Hanson, The Social Logic of Space, 1984) and specified in (Turner A. , “Depthmap: A Program to Perform Visibility Graph Analysis, 2007), intuitively describe the difficulty of getting to other spaces from a certain space. In other words, the higher the entropy value, the more difficult it is to reach other spaces from that space and vice-versa. We compute the spatial entropy of the node as using the point depth set:
(11)
“The term is the maximum depth from vertex and is the frequency of point depth *d* from the vertex” (ibid). Technically, we compute it using the function below, which itself uses some outputs and by-products from previous calculations:
Algorithm 4: Entropy Computation
Given the graph (adjacency lists), Depths as List of List of integer, DepthMap as Dictionary of integer
Initialize Entropies as List(double)
For node as integer in range [0, |V|)
integer How_Many_of_D=0
double S_node=0
For depth as integer in range [1, Depths[node].Max()]
How_Many_of_D=DepthMap.Branch[(node,depth)].Count
double frequency= How_Many_of_D/|V|
S_node = S_node - frequency * Math.Log(frequency, 2)
Next
Entropies [node] = S_node
Next
…
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
…
r the course is conditional on being committed to change : ) We are looking for people who want personal challenges, not massive videos. We believe on individual training to give learning experience to our students that are based on their choices, interest, passions and ambitions, giving them more voice into the learning process.
As first step we create your course with your input and we start with your weekly challenges. Be part of the new wave of online courses : )
info@pazacademy.xyz
…
d the workshop PDF from this link: http://goo.gl/bcvRNH Download event poster from this link: http://goo.gl/Q0KWCM Brief: Cairo is filled with barriers controlling people movements, suppressing them as well as detaining green and public spaces to the extent that most people have been taking these spaces for granted. Public spaces have been for a while the periphery of our daily life. We will explore in this workshop how we can manipulate and alter people’s perception and direct their attention to how these spaces are integral for city life. This exploration will be backed up by intensive technical tutorials introducing computational design and fabrication techniques and tools mainly Rhino, Grasshopper, Geco and Ecotect. Not only will this be the typical technical workshop, but rather you will also have the chance to be guided step by step on how these tools are used through out different design stages in a real world scenario. Design prototypes will be produced through 3D printing, the main workshop output will be a fabricated one to one functional model for one of the designs using our new in-house CNC machine. Tutors (check the PDF for bio): Olga Kovrikova, MArch DIA Alexandr Kalachev, MArch DIA Karim Soliman, MArch DIA Islam Ibrahim, MArch DIA Sherif Tarabishy, B.Sc. AAST Application: Application deadline 1 September 2013 ** For students (undergrad / Master), teachers and PhD proof of status is required (university ID with a date or a certificate of enrollment) to apply for the students package. Packages (choose one of the following in the application form): 1. Standard registration Course fee is 4250 EGP For Students 3500 EGP 2. Early bird registration discounted fee For Professionals 3750 EGP For Students 3000 EGP ** Early bird offer ends on 14 August 2013 3. Group registrations discounted fee (5 or more) For Students 20% off - You will have to fill out an application form here: http://goo.gl/0QxAga - You will need to submit your CV and Short Portfolio (max. 10 MB) to info@morph-d.com, email subject: “Morphing Norms Application” (we will decide if you are eligible for an early bird discount or not based on the date of your email submission) - We will confirm receiving emails from all applicants. Successful applicants will be contacted 5 days after each deadline (early bird/final) and will have to confirm participation within 3 days, if they fail to do so, places will be given to others on the waiting list. - A maximum of 30 applicants will be selected.
…
orkshop will give students a functional understanding of Grasshopper and Parametric design. This will allow them to build on this understanding into more advanced projects of their own including design optimization with RhinoCAM-NEST and creating their models on a laser machine. Basic knowledge of Rhino 5 is required to be able to take this training. Details...
Location: McNeel Miami 1538 NW 89th Court Miami, FL 33172 United States
More Info: e-mail: Jackie Nasser phone: 305 513 4445
Note: The course must reach a minimum of 5 enrolled students. If the course does not meet the minimum, it will be canceled.
*If you live outside the Americas and you wish to purchase this product, you should choose the United States as country of residence. The rest of the information should be correct.
*Si usted vive fuera de las Americas y desea comprar este producto, deberá escoger como país de residencia United States. El resto de la información debe ser la correcta.
McNeel Miami's RhinoFabStudio - Miami, Florida
.
…
st as shown in the image pattern example,and There are 1 component for generate & preview the 1dCA rules.2-Mantis_Geometry A) Mantis_Mathematica Equation which enable writing equations as Mathematica technique and get the result as a string and for using this tool, don't write any equations which has an image result. B) Mantis_Fractal tree which generate a self similarity branches which can be used as a line-length as a numeric order (for example as fibonacci)(iF you saw an error click on don,t show me this massege again"don,t worry) C) Mantis_Nearest Value which gives the list of elements(strings or numbers) to which a value is nearest D) Mantis_Shortest Tour, attempts to find an ordering of points that minimizes the total distance on a tour that visits all of these points once E) 2 Components for creating 3d Polyhedra objects + Unfolding these objects into planar surfaces.you can find it in the download section…