cture, furniture, sculpture and interactive installations, among others.
Participants will develop designs based on established and invented/experimental rules and methods derived from fields ranging from computational mathematics and biology, to natural/unnatural phenomena. The aim of this workshop is to empower local designers and artists to create designs using powerful tools within the new exciting field of computational design.
Workshop
Dates: 23 Nov –26 Nov 2009,
Location: The City Hall, Level 4, Courtroom 20
Country: Singapore
Email to sdf2009@moonbasebeta.com for more info.…
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…
0;2) n=23 vs (0;2) n=3245 = (0;2;0-23) n=3245 I want the list from the second component of each branch to be ran x times into new branches depending on the first components x=list length Well if world would be simple I would just say graft the first input component right? but after cross-referencing, I get the resulting tree where it runs the longer list once for each branch and keeps on running the n=3245 till the end. What are magnets and how do they work?…
e 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. Verrà rilasciato un attestato finale.
tutor: Arturo Tedeschi - autore di "Progettazione Parametrica", il primo manuale italiano su Grasshopper
luogo: Meeting Center | Hotel Plaza Napoli Best Western
organizzazione: LE PENSEUR (Authorized Rhino Training Center)
info e programma…
3. After that is covered in this video - minute 23:30. You need to use export Ladybug component which will export .py and .userobject to the folder. Then you can use the normal process with github to push it to your fork and send a PR.
Let me know if you have any specific questions.
Mostapha…
e 14h-18h (sessões diárias de 8h)
Grasshopper Nível I 9 e 10 de Abril 2-feira e 3ªfeira
9h-13h e 14h-18h (sessões diárias de 8h)
# ORGANIZAÇÃO Rhino3Dportugal # OBJECTIVOS - Utilizar as ferramentas digitais de forma criativa e rigorosa, para a concepção de modelos 3D – Familiarizar-se com as lógicas de criação de geometrias tridimensionais NURBS. - Desenvolver técnicas de criação de imagens fotorealistas com o motor de render V-Ray - Introduzir as lógicas paramétricas e associativas processo criativo. # INFORMAÇÕES E INSCRIÇÕES Link para inscrições online: http://www.rhino3dportugal.com/website/?page_id=368 info@rhino3dportugal.com Ana Fonseca: 917140716 Mais informações: Calendarização: http://www.rhino3dportugal.com/website/?page_id=186 Conteúdos: http://www.rhino3dportugal.com/website/?page_id=72 Site: www.rhino3dportugal.com…
Added by Brimet Silva at 10:32am on February 27, 2012
the other 23 lists.
Basically just Group up data before CrossRef(coincident)
sadly, if this is what you want, it took 1.5 seconds to solve on my rig :/unless I misunderstood again, in which case its probably not too hard to shuffle things around and hope the solve time goes down.
(or just use the coding solution if you can manage w code)…
You're doing an additional faster Boolean subtraction elsewhere though, for your gem tool. If I stopwatch time your whole new script vs. the old one it's 5 seconds for a full Grasshopper menu Recompute vs. 23 seconds, or a whopping 4.6X faster.
You could hunt down slow components and some of those could indeed be Python parallel processed, such as finding intersection curves since you aren't modifying any single base structure, just creating something new.
Also, much of the time time is now actually in your meshing, smoothing and area calculation steps, which are not needed for creative work as you work. With the meshing disabled to cut the script off there, and low quality preview meshing, it's down to 3 seconds for a full Recompute.
If I find time I can create a Python curve intersections-finding script to turbocharge the slowest step in these "manual" Booleans which overall are taking 1.1 of those 3 seconds, and 4X faster in those steps would bring the overall down to 2 seconds instead of 3.…