cotains 5 data. if the "y" is 3, the a is 34 branch ,the branch in 1 to 33,contains 3 data,and the 34th branch contains 1 data.. i dont know how to write the python code.…
op van maximaal 1000 iteraties
3) Offset de polyline en maak een nieuwe Brep van alle curven
4) Bepaal de Area-centroid van de Brep
5) Bepaal het verschil tussen de huidige centroid en de gezochte centroid
6) Als dit verschil minder is dan 1e-12 breken we af
7) Vermenigvuldig het verschil met vier en pas de polyline aan
8) herhaal (3 - 7)
Is dit min of meer wat je wilde? Het lijkt dat er ~50 iteraties nodig zijn voor een antwoord dat accuraat is binnen de 1e-12 eenheden.
--
David Rutten
david@mcneel.com
Poprad, Slovakia…
Added by David Rutten at 5:26am on August 24, 2010
do i get them to be in one list...
Example:
List 1:
1
2
3
4
5
etc....
List 2:
10.1
11.1
34.5
40
50
etc...
Merged List
1, 10.1
2,11,1
3,34.5
4,40
5,50
etc... …
Added by Eric Galipo at 3:10pm on January 13, 2016
and Ronnie of StudioMode and David Fano of DesignReform will also be attending.
RSVP has been closed on this event. Space is limited to 50 people. Please attend if you do RSVP.
Agenda -
12:00-1:00 Arrival, informal discussion
1:00 - 1:15 Introductions
1:15 - 2:00 Project presentation 1 (30 minutes + 15 min QA) - David Lee - Clemson - 3D pattern environments using volumetric proxies.
2:00 - 2:45 Project Presentation 2 (30 minutes + 15 min QA) - P. Casey Mahon - Organic Abstractions (30 minutes + 15 min QA)
2:45 - 3:45 David Rutten - New work in GH (30 min QA)
3:45 - 4:30 Sameer Kumar AIA - KPF - Project presentation 3 (30 minutes + 15 min QA)
4:30 - 5:15 Chris Wilkins - Clemson - Urban Renewal and parametric urban development studies in Grasshopper.
5:15 - 6:00 David Rutten - Scripting in GH (15 min QA)
After 6:00 conversations may move down the street for more discussion.
If you would like to present your project at the Cloud please email: scottd@mcneel.com…
ll to one end of the field.
Here's another, slightly more involved way to approach it:
1. create an even, random field of points
2. sort them in the direction of the gradient (decompose the points into xyz and sort by z value, for instance)
3. plug the sorted points into the jitter component and use a slider to control the amount of jitter
4. use "split list" to extract one half of the list (use list length/2 as the index)
5. adjust the jitter amount - at 0 you'll get a solid block of the top half of the random points, at 1 you'll get a random set of 50% of the points, but somewhere in between you'll get the appearance of a gradient.
Let me know if any of this is unclear... hope this gets you started.
Andrew…
0;0} (N=50)
will probably Graft as
(Paths = 50)
{0;0;0} (N=1)
{0;0;1} (N=1)
and so on ...
A set of data with multiple lists with a structure like
(Paths = 5)
{0;0} (N=10)
and so on ...
will also Graft as
(Paths = 50)
{0;0;0} (N=1)
{0;0;1} (N=1)
and so on ...
Given this example, you should be able to match up values from list one to list two.
Keep in mind, with the above example there are the same number items in each (50).
If you want to restructure a flat list of values (50) into a structure with, say, 10 paths with 5 items each, that is a different story and a good question. Perhaps someone else can chime in on that ...…