ing to download your examples but it sends me to the code instead ( I only able to download the rhino files but not the gh) , I just installed the plug in and have been playing with vortex component but not enough control yet, I would like to have water velocity continuity along the river and generate vortex when the field find and obstacle such a pier attach to the river bank.
1.-I am thinking on having 2 lines ( river banks) as input and generator the vector field
2.-Different curves ( polygons) along the river attach to the river bank that create the vortex ( this ones could also be define by the centre of the actual pier as point with certain radius of action.
3.-And finally the z value of the vortex should decrease along the z axis ( surface water vortex bigger,) as tornado
I would like to be able to set points and create or modify the vector field positioning this vortex that its position also should be related with its strength ( as closer to river bank as bigger the force of rotation)
I would appreciate if you can address me to some tutorials related or suggest the workflow
many thanks! …
nually.
Now when I see how short and easy are the codes I want to propose you a wish list of "AA SED programme" so that later students would be able to use your honeybee tool more intensively.
First of all, I want to clarify, what are the pressures when we specify the infiltration. That was still unclear for me as a beginner. Is it m3/m2s at 50Pa or at actual Pascal? If it is at actual Pascal, does that mean we should specify the concext somehow by the input of coefficients or by the actual bRep context or input it from some CFD? What do we do? What do you typically do?
Secondly, I found an idf example which works with material substitution in energy plus example folders. I think this is something what Chris was trying to propose. The code seems short. Can we expect that this feature of material replacement according to the schedule would appear later?
Other passive elements like trombe wall for instance would be appreciated as well.
I see you are now focused more on high/light tech tools, but don't forget about low tech vernacular strategies.
Many thanks again.
…
ino Mc Neel, autore di "Architettura Parametrica - Introduzione a Grasshopper", il primo manuale su Grasshopper. I corsi PLUG IT nascono dalla volontà di promuovere le nuove tecnologie digitali di supporto alla progettazione e condividere il know-how maturato attraverso ricerca, collaborazione con i più importanti studi di architettura e pubblicazioni internazionali. Verranno introdotte le nozioni base di Grasshopper approfondendo le metodologie della progettazione parametrica e le tecniche di modellazione algoritmica per la generazione di forme complesse. Il corso è rivolto a studenti e professionisti con esperienza minima nella modellazione 3D e si articolerà in lezioni teoriche ed esercitazioni. Argomenti trattati: - Introduzione alla progettazione parametrica: teoria, esempi, casi studio - Grasshopper: concetti base, logica algoritmica, interfaccia grafica - Nozioni fondamentali: componenti, connessioni, data flow - Funzioni matematiche e logiche, serie, gestione dei dati - Analisi e definizione di curve e superfici - Definizione di griglie e pattern complessi - Trasformazioni geometriche, paneling - Attrattori, image sampler - Data tree: gestione di dati complessi - Digital fabrication: teoria ed esempi - Nesting: scomposizione di oggetti tridimensionali in sezioni piane per macchine CNC Verrà rilasciato un attestato finale. INFO E PRENOTAZIONI: http://www.arturotedeschi.com/wordpress/?p=2888…
rld.wolfram.com/EnnepersMinimalSurface.html
when i type the equations for z,y,z it says a syntax error so i obviously do not understand how to construct an expression. (screen capture attached)
Any help/explanation of using this function would be greatly appreciated
thanks so much
Capture.JPG…
r-School/
Registration deadline is 4th of March 2016
Official language: English with Italian and Arabic supportsTotal training hours: 120 hoursPlace: Sapienza University of Rome - Faculty of Architecture Final exhibition: Sapienza University of Rome - Rome - Italy4 professors and 8 tutors from University of Pennsylvania- USA, AA - London,politecnico di Milano- Italy, SAS-UNICAM-Italy, BAU - Lebanon , MSA, AAST and Cairo University - Egypt
final outcomes: scale 1 to 1 responsive façade; kinetic and optimized regarding to environment and users interaction. An official research will take in advance of how people interact with the kinetic Architectural object through the final exhibition survey .
to register …
rking at CITA http://petrasvestartas.com/Inflated-Restraint . Then I wrote my graph library in C# that has graph algorithms such as shortest paths(dijktra's, bfs, dfs), minimum spanning trees and etc. for Fox. It is not so difficult to read this book and implement graph methods in C# from pseudo-code: https://www.amazon.co.uk/Introduction-Algorithms-Thomas-H-Cormen-eb... The method that you pointing at is using multiple dijkstras for striping.
The thing with tiling use simple loop no recursion, at least this is more readable for me. Isosurface is also part of the Fox add-on. But as you know iso surface is just display thing, field value is what you checking at. Also colliding thing is faster if you do not check edge edge collision.
Another thing is you do those "aggregations" in 3D and you do not evaluate material properties of the real object, be it plywood, plexiglass or 3D print powder. It seems , if you make a physical prototype it will be strong as 3D, but it bends as tree branches because it holds only to one element. There are different way how to overcome that and make structure stable/lock it and branch back. Also take into account torsion forces of the connection.…
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
…
t the maximum potential with the bridge BIM+PARAMETRIC DESIGN ;D
During this Intense Week, we will learn about the power of Rhino + Grasshopper + ArchiCAD with Professional and Useful examples for our Normal Working day :D
You will get Advanced Library Files + Personal Web + Knowledge and Skills to start using this incredible Methodology ;D
Also, the week is having Lectures from different Experts sharing their Computational Working Experiences ;D And Jam Sessions! opening the door to 5 interesting topics to research, learn and experiment together :D
2020 is your YEAR ;D !!!
Complete details and registration……