pen Brep"; I didn't know it worked on flat surfaces. And I think it's only fair to include in your benchmark the considerable time 'SUnion' takes in this example: 21.9 seconds for 121 rings and likely much more with 400 or 1,000+ rings.
Then I noticed the pattern doesn't match. Checked the circles and they are the same. The distance between them, however, is different: 7 instead of 6. When I change that value to 6, the Python fails badly. All the holes and gaps are gone, which destroys the pattern:
I can't do the "two phase" approach on an 11 X 11 grid, but I can do 6 X 6 and 2 X 2 to get a 12 X 12 grid (40 'SUnion' operations) in 28 seconds total. That beats your benchmark of ~37 seconds for an 11 X 11 grid, if you include the 'SUnion' in your code.
…
where each branch contains all the points generated by dividing each curve, so if you divide into 10 segments, you'll get:
{0;0}(N = 11)
{0;1}(N = 11)
{0;2}(N = 11)
{0;3}(N = 11)
{0;4}(N = 11)
Where the second integer in the curly brackets refers back to the index of the curve in the original list.
Another way to look at this data is to see it as a table. It's got 5 rows (one for each original curve) and 11 columns, where every column contains a specific division point.
--
David Rutten
david@mcneel.com
Poprad, Slovakia…
tName_FinalProject_PartD.pdf
Below is the desk crit list, please sign up for a spot in the comments below:
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
See you Monday!…
erations, is not it?
This is what I finally want and how I plan to do it:
In the starting tree, points are listed accordingly to the (11) 4-side-panels they belong to. I need to do a tree where each of the 11 lists contains not the points composing the panels but the points code of the points composing the panels. the point code is the number in the flattened list that refers to the points (like, panel 1 is made of points n 0,1,4,18, and so on). To do this, I suppose that I will use my tree of 11 lists of 33 true-false values, and apply it to cull 11 times a series of numbers from 0 to 32. I ll post it if it works!…
main attention is set on easy to handle interface , which should be used at a early stage of conceptual design to respond to external and internal influences in a intelligent and sustainable way.
Participants will use the software Grasshopper as a parametric modeling plug-in for Rhino. The usage of this graphical algorithm editor tightly integrated with Rhino’s 3-D modeling tools open up the possibility to construct highly parametrical complex models. To generate this complexity we will use live linkages to several programs listed below:
• Autodesk Ecotect Analysis and Radiance via GECO
• Processing, Excel or Open Office via gHowl
• FEA software GSA via SSI
In this 3 intense days, the participants should learn the workflow of the plug-ins with the help of examples and get an overview of the different software’s, there possibilities for evaluating the performance of a design or the usage of additional tools to be not chained to a single system .
(e.g. parametrical accentuation, parametrical formation, parametrical reaction)
TIME AND LOCATION
27th – 29th September 2010Leopold-Franzens university innsbruck/austria
Technik Campus | ICT - building
Technikerstraße 21a
A - 6020 Innsbruck | Austria
47°15’50.71”N 11°20’43.45”E
detailed program as pdf-version
FOR WHOM
All levels are welcome (students & professionals)
The only requirement is knowledge of Rhino and Basic Grasshopper.
You will need a level which corresponds to the Grasshopper Primer course outline.
FEES
21 hours
professionals: 395€
students (bachelor/master): 250€.
REGISTRATION
please send a email to to.from.uto@gmail.com attached with following information :
Last Name
First Name
Date of Birth
Nationality
Email Address
Current Address
Profession or proof of student status
After submitting you will receive an email with a PayPal link to complete registration.…