cle
the 'Shape' is copied to all points
shapes are rotated randomly, plus or minus 'Angle' maximum
'Shape In Brep (ShapeIn)' is used to cull shapes that aren't within the circle
'Fast Loop' begins using 'MCX' (Multiple Curves Intersection)
first shape is added to 'D1' output and shapes intersecting it are culled
results minus first shape are passed to 'D0' of 'FastLoopEnd'
loop repeats until 'D0' list is empty
'D1' results are scaled down slightly (0.75) to leave more space around them
'Explode' results and return only the curved part, ignoring the base line that closes the shape
…
Added by Joseph Oster at 11:01pm on March 17, 2017
avid--this software is a pleasure to use, and David, you have done an amazing job. I also want to acknowledge it takes a lot of work to edit the software, and I understand that it can take a while before any changes are made.
Okay so here are some ideas:
Subcurve - just like subsurface, but based on 1-dimensional intervals
Map Values to Interval - a single component that could take a list of values, an interval, and would scale the list of values to match the input interval.
A Dispatch component that could dispatch according to a list of output indices. Instead of just True/False, you could output things based on a pattern using 0/1/2/3/4, etc. This component would be the inverse of Weave.
A text object parameter and data type, with some basic ways to edit it.
More string manipulation operations, allowing for easy editing with string subintervals, and character counts, and basic text formatting (line return, etc.).
I really really really wish the List Item component had a default index value of "0". That is what I input into it 80% of the time.
That's all for now. If any of these ideas are already adequately addressed, please let me know. Thanks.
…
ellation tool of GeomGym in Grasshopper.
The design looks for a new brick topology which is in the shape of two generative elements of Weaire-Phelan structure; dodecahedron and tetrakaidecahedron. An innovative approach is taken by applying varying types of solutions and details to the new brick elements.
There are other good examples and winners which are worth looking into. Our sheets can be downloaded from here.
All comments appreciated.
We would like to thank Jon Mirtschin and anyone who contributed to this tool.
Xue Ai and Serdar Aydin…
elivering their latest workstation and graphics technology.
Intensive computing and exceptional graphics technology will deliver generative modeling and computing to its next level.
Participants will learn the ease of use of Grasshopper within Rhinoceros, so they could start creating their own generative design.
Who should attend:
1. Professionals in design and engineering industry who would like to gain more knowledge and productivity
2. Students who would like to extend their knowledge to the next level
3. Supporting IT who would like to provide even more efficient tools for engineers and designers
4. Engineering and Design Enthusiasts
Participants should send an email to fani@m3kom.co.id, to receive an invitation and its detail.
For further technical information about the event, feel free to ask Rendy (tihe.tihe@gmail.com).
This event will consist of the sneak preview of most anticipated real-time rendering for Rhinoceros: V-Ray RT for Rhino.
Hopefully, this will also initiate the establishment of Indonesia's generative modeling designers community in Indonesia.…
this workshop is to materialize a chair designed with help of generative algorithms via robotic fabrication. To design the form of the chair we will go through an intensive course of generative design techniques, k-means clustering, structural analysis and optimization done with the help of Anemone, Galapagos, Millipede and other plugins. Finally we will employ a 6-axis robot with custom tooling to fabricate the chair via robotic rod bending. No prior experience with Grasshopper or robotic fabrication is required, although basic knowledge in 3d modelling would be an asset. // APPLICATION The deadline for application is 13.03.2017 Apply by sending email titled ‘workshop_chair’ to workshops@aan1.net // INFO If you have any more questions check the www.aan1.net website or contact us with email workshops@aan1.net // FEE We have special pricing for students, as well as an early bird offer. Check the Eventbrite list to get more details. Please bear in mind that a limited amount of seats is available (minimum 8 people, maximum 16). ORGANIZERS: Maria Smigielska, Mateusz Zwierzycki, AAn+1 TUTORS: Maria Smigielska, Mateusz Zwierzycki PRICES: Early Bird Student 280 E Early Bird Pro 320 E Regular Student 300 E Regular Pro 350 E…
p 10 "Scripting Reality – Integrating 3D Point Clouds in parametric design workflows".
This research-based workshop will introduce participants to thegeometrical class of point clouds and ways to handle, manipulate, analyse and script with them. Participants will as well have the chance to get first-hand knowledge in the handling of 3d capturing devices and to link their outputs directly into a design environment.
The workshop poses especially the question of how changes on architectural scale can be tracked over time. Related algorithmic concepts and the Volvox plugin, allow for the first time to directly access and manipulate point clouds in a parametric design environment, will be introduced to the workshop participants. A 1:1 experiment on the ETH campus will provide a testbed. Participants will learn point cloud processing and learn to track objects solely on the base of point cloud analysis, find deviations against the planned and visualise the results.
The workshop is led by Mateusz Zwierzycki, Martin Tamke and Henrik Leander Evers. FARO provides several 3d scanners with helical adapters and acccess to the FARO SDK for the workshop. The workshop is modestly priced with 160CHF.
register now.
http://www.aag2016.ch/workshop-10/
…
d object1. Traceback: line 96, in join, "c:\Program Files\Rhinoceros 5 (64-bit)\Plug-ins\IronPython\Lib\ntpath.py" line 102, in openStudioPath, "C:\Users\Jurrijn\AppData\Roaming\McNeel\Rhinoceros\5.0\scripts\honeybee\config.py" line 247, in <module>, "C:\Users\Jurrijn\AppData\Roaming\McNeel\Rhinoceros\5.0\scripts\honeybee\config.py" line 2, in <module>, "C:\Users\Jurrijn\AppData\Roaming\McNeel\Rhinoceros\5.0\scripts\honeybee\radiance\command\_commandbase.py" line 2, in <module>, "C:\Users\Jurrijn\AppData\Roaming\McNeel\Rhinoceros\5.0\scripts\honeybee\radiance\command\gendaymtx.py" line 3, in <module>, "C:\Users\Jurrijn\AppData\Roaming\McNeel\Rhinoceros\5.0\scripts\honeybee\radiance\command\__init__.py" line 7, in <module>, "C:\Users\Jurrijn\AppData\Roaming\McNeel\Rhinoceros\5.0\scripts\honeybee\radiance\__init__.py" line 3, in <module>, "C:\Users\Jurrijn\AppData\Roaming\McNeel\Rhinoceros\5.0\scripts\honeybee\_hbanalysissurface.py" line 1, in <module>, "C:\Users\Jurrijn\AppData\Roaming\McNeel\Rhinoceros\5.0\scripts\honeybee\hbsurface.py" line 1, in <module>, "C:\Users\Jurrijn\AppData\Roaming\McNeel\Rhinoceros\5.0\scripts\honeybee_grasshopper\hbsurface.py" line 44, in script line 53, in __init__, "C:\Users\Jurrijn\AppData\Roaming\McNeel\Rhinoceros\5.0\scripts\honeybee\config.py"
It seems a problem with python.. Thanks in advance for any help.…
(twice the amount of lines, it'll take twice as long).
If you nest two loops you're iterating over each line, and then you iterate again over each line. So when you now have twice as many lines, it takes four times as long O(N*N) or O(N²)
With an octree you can reduce the second iteration from O(N) to O(log N). The reason octrees are fast is because they allow you to quickly reject large amounts of lines in your set. Lines are no longer stored in a list, but rather in recursive spatial buckets. If we determine that a certain bucket is too far away to possibly yield any valid results, we can instantly skip all the lines in that buckets and any sub-buckets. If you're lucky, you can reject ~85% of the local data in every iteration, which means even large collections of lines are reduced to only a few potential candidates very quickly.
Thinking about this I'm actually not sure now whether lookup in my Tree3d class is O(log N) or O(sqrt N), but the basic principle holds. The reason the resulting algorithm is O(N * log N) is because the outer loop is still O(N) but the inner loop is now replaced with an O(log N) searcher, so you end up with O(N) * O(log N) = O(N log N)
At least that's how I think it works, computational theory has never been my strong suit.
--
David Rutten
david@mcneel.com
Poprad, Slovakia…
Added by David Rutten at 4:55pm on November 29, 2012