.0001, the functionality is been put into dedicated components (see this post for further details).
Different branches are always combined using Longest List logic. I'm unhappy about this as well, I need to give more control over how different branches are combined, but I haven't figured out yet how to expose such functionality without it being utterly incomprehensible to 99% of the users.
If you want to ignore the data inside the fourth branch, you'll need to remove that branch before the data goes into the Line component. It's easy to remove a specific branch, somewhat trickier to make this removal dependant on variables elsewhere in the network.
You can use the Split Tree component to achieve this either way. Using a fixed mask (like in the image below) may be sufficient.
The !3 means that any branch is allowed except when it has a 3 in that location. The [0-2] means that only branches which have a number in between and including 0 and 2 will be allowed.
--
David Rutten
david@mcneel.com
Poprad, Slovakia…
d" floor side).
Rails are obviously defined with slope adjustments at start/end: Imagine a rail ramp curve made via, say, 20 control points: at start p0 is not moved, p1 is moved half the step .... p19 is moved half the step*17 and p20 is moved the full distance. Thus we have what is called "slope adjustment" in our trade.
a myriad of options controls where the spaghetti starts (curve.PoitAt(userControllableT)) what is the continuity mode (sequential or steady[shown]) and what type of profile is used for the sweep.
…
that ... blah, blah) but each of those cores will be running at lower speeds because of the thermal restrictions.
For instance, a dual core may have base clock speeds of 3.5 GHz for each processor while a quad core processor may only run at 3.0GHz. Focusing to single core (on each of them) the dual core processor will be able to about fourteen percent faster than on the quad core. Thus, if you have a program/app that is only single threaded (99% of what's available for AEC puproses to be honest), the dual core processor is actually better. Then again, if you have something that can (?) use (??) all (???) four processors such as the notorious Nexus rendering engine (Modo/Microstation/AECOSim), then the quad core processor will actually be about seventy percent faster than that dual core processor.
But no AEC engineer worth his name cares about rendering stuff, he he.
AMD and Intel have introduced technologies that can dynamically increase the speed of a processor core to help offset these differences between the dual and quad/octa core products. For instance, Intel may have the quad core processor with a base clock speed be 3.0GHz but when only a single processor core is in use at full load, that processor core will be boosted up to 3.4GHz. This would then make the quad core processor just three percent slower than a dual core processor that runs at 3.5GHz.
In general and theoretically, a multiple core processor is a "better" choice but that does not necessarily mean that you will better overall performance.…
switch this talking off-line if you are interested to know the real reasons in depth.
What is the pro way? Well ... imagine objects (blobs et all) that are placed in 3d space by some per object policy whilst their "property" (bend,repulse) is user controlled on a per object basis. Then imagine variants of all that spaghetti yielded (the rays, that is) stored in parameters in order to do the obvious : take control of all your previous attempts (replace, remove, swap, reset etc etc).
Get a 10-- minute thingy (straight out of my head: NO checks OF ANY kind performed [bugs possible], just a grid that shoots rays and a single blob (a sphere) that does the job). Not even a decent random policy is applied in order to have some nice looking rays (not to mention their directions).
Now ... imagine any collection of breps distorting the ray chaos: i.e. a ray meets a blob > is distorted (or not) > then meets another > ... > blah, blah (plus some policy for killing rays heading to Sahara instead of Vienna - but that's elementary).
This requires at least 2 hours of coding to do it properly (+ the variants "management" C#).
But ... well ... it could be a good real-life case when Solaronix "sponge" type of U/V collectors could be available (rather soon) > I'll do it > the future > the glory > the cash > the polar bears.…
gain profits falls in the latter category.
The challenge here is to do the job (up to a point) using "anodyne" ways at the cost of providing slow, incomplete and quite inefficient solutions.
That said this specific vault case requires addressing 4 "classes" of problems (for instance: regions due to ccx events or alternatively circuits in graphs etc etc).
Back to business:
Creating a realistic "random" W truss of that type is one of the most challenging tasks in parametric adventures (in fact ... is the top dog by some miles). One of the many issues is an approach to manage "on-the-fly" clash situations by individually modifying nodes (without been sure that you can arrive to an all overall valid solution). Since one "path" tried may yield dead-end(s) this means keeping track of your corrective actions in a hierarchical manner and been able to follow a different "path". Another (obvious) issue is to use instance definitions for all the "components" thus achieving almost real-time response (try to manage 100K++ "solids" [sleeves, cones etc etc] to see what I mean) ... etc etc.
The big thing is: what are you going to tell to your instructors about the required code part? (that 99% mentioned) And if a "complete" solution is primarily based on "black boxes" could - in the instructor's eyes - your Master Thesis qualify as yours?
That said Vaults_V1 is achievable solely via components.…
ng (It's a bit similar to the Knapsack problem):
I have a Variable --> XandI Have fix numbers (can we call "pieces") 9,12,15,18
I'd like to reach the X, with the summing of these numbers and using the minimum pieces ,it can't be lower than X, but it can be higher, maximum with 3.After this it has to found the most optimal combination which mostly use the same pieces
E.G.
X=98
The wrong solution is like = 1pcs of 18 = 9pcs of 9
Sum of pieces are 10
OR
= 3pcs of 18 = 1pcs of 15 = 1pcs of 12 = 2pcs of 9
Sum of pieces are 7
The right solution in this case = 5pcs of 18 = 1pcs of 9
(5*18)+(1*9)=99 it's good beacuse it's over with maximum 3 and uses the minimum pieces
Then it sends to a list like18 : 5pcs15 : 0pcs12 : 0pcs9 : 1pcsCan somebody help me ? Or is it possible to make this ?
Thank you…
Added by Petrik Kollár at 1:09am on November 10, 2017
egin working on a design, we first have to systematically examine the resources and restrictions which, on the one hand, make every design project possible and, on the other hand, also define and delimit it. Knowing what we have to work with enables us to explore its boundaries and at the same time to venture beyond those boundaries. This is our studio’s sphere of action; our projects emerge as a critical reflection of the discipline of architecture, in its essence, on fundamental concepts, their general form, and their underlying media and processes. The goal of our work is to master a variety of forms of the architectural repertoire of the 20th century, but especially to develop and expand this repertoire, as has been happening in the past 20 years. The goal of this workshop is to introduce a series of these techniques and expertises and to apply the knowledge transfer on a given site in Timisoara. GUESTS: STUDIO ZAHA HADID VIENNA: http://www1.uni-ak.ac.at/architektur/ https://www.facebook.com/StudioHadidVienna Ass. Dipl.-Ing.MArch. AA Dist. Robert NEUMAYR-BEELITZ - lecturer/critic http://www.unsquare.at/ AProf. Mag.arch. Mag.theol. Johannes TRAUPMANN - critic http://www.pxt.at/ Univ.-Ass. Dipl.-Ing. Jens Erik MEHLAN - critic http://moh-architecture.com/ Univ.Stud.Ass. Daniel BOLOJAN - tutor - Grasshopper http://nonstandardstudio.wordpress.com/ Univ.Stud.Ass. Bogdan ZAHA - tutor - Maya http://bogdanzaha.tumblr.com/ LOCAL: Prof.Dr.Arh.Urb.Conf. Florin MACHEDON - critic (BUC)
more information on https://encodedfields.wordpress.com/…
(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
p; 3D Urban ModelingOn the topography subject I get the next message: "One or more boundaries may be outside the bounds of the topo dataset" I'm not sure if it's the .IMG file I'm loading since I found so many IMG files nearing my polyline area (Miami Lat:26 Lon:-81 aprox.) or maybe my polygon doesn't match the topo area? I have no idea why it isn't working :(On the Shapefile subject, haven't been able to find a Building Height SHP File, so far have downloaded around 8 SHP files which only contain Polylines, my solution is to meanwhile randomize Z heights, but of course this data is not "technically" correct.P.S.: I've already tried all example links and also the ones posted by you and Benjamin in this video.Been strugling last few days, hope you can help me, thanks in advance!!…