C# Merge List in a foreach loop?

Hi all,

i found some lines in a discussion and rebuilt it. its making a delaunay Mesh with an optional Plane. Now i would like to be able when having varoius curves that i have one mesh as output. Basically its unioning the lists inside a foreach loop i imagine but i dobt have any clue how to do it.

One reason i am doing this is simply to practice other is i have the hope to get a fster result once i compiled it in vs. You think it could run faster? I have a very big file to mesh(terrain).

Heres the discussion i grabbed the code from

http://www.grasshopper3d.com/forum/topics/c-delaunay-mesh-syntax-wi...

Heres a screencap of what ive done with it:

Ahh, also dont know where to put in tht it still works, when no plane is provided.

Thanks a lot to everybody whos taking a look into and a nice weekend!

Attachments:

MegeList_DelMesh.gh, 9 KB
Crvs.3dm, 152 KB

Replies to This Discussion

Permalink Reply by peter fotiadis on April 28, 2017 at 9:14am

Get the Delaney with plane thingy and we talk later.

Attachments:

Delauney_with_plane_V1.gh, 3 KB

Permalink Reply by Chapulin Colorado on April 28, 2017 at 9:20am

Thanks Peter,

with we talk later you mean youll post how to union the lists inside?(hehe)

i supposed doing it with creating the points outside will be easier,(just flatten the list input)but for me it is interessting to know how to do this inside a code.

best

Permalink Reply by peter fotiadis on April 28, 2017 at 9:26am

Well .. that's roughly the plan, he he.

Note: many think that the Dark Side is just an alternative. But if you count the real-life apps used in a contemporary AEC practice ... plus what really means "communication" from/to all that (Karma is a must) ... and take also into account this, this, this (and that) ... the Dark Side is the only side.

Permalink Reply by peter fotiadis on April 29, 2017 at 7:34am

Well ...

1. First the UGLY news: see where Lewis is (qualifying in Russia) > ^@%$^%@ + @$%^%$ (excuse my language but things are critical).

2. Then the BAD news: this has nothing to do with merging Lists (I'll advise David to ban you [min: 5 years]: you must pay the penalty for a wrong thread title, he he).

3. Then the GOOD news: If Ferrari breaks tomorrow ... then ...

Attachments:

Lists-merge_V1.gh, 16 KB

Permalink Reply by peter fotiadis on April 29, 2017 at 8:01am

BTW: Whilst the whole situation (with Lewis not C#) is disgusting get this that can safely guide you to Heaven (Hint: make a good life insurance > %$%@ happens).

Attachments:

Lists-combine_14_V2.gh, 115 KB

Permalink Reply by Chapulin Colorado on May 1, 2017 at 12:10pm

Hi Peter,

sorry for the f1 thing-and the C#. I explained myself really bad also title was bad choosen.Also thanks for the listMerge example.

Was trying today get it solved.

Is it possible with a list action(join it in one(flatten it))?

or do i have to do it in a tree

in this case there this as error message:how do i get it public?is it this { get; set; } thing?

also change it from divideByLength to divideByCount to get the endpoints, just if you wonder about this strange move int he first line(probably you dont -so many strange moves,hehe)

also found this one:

do you have connections to papa noel or just went far away to get bestest sardines?

regards

Attachments:

FlattenTree.gh, 7 KB

Permalink Reply by peter fotiadis on May 1, 2017 at 12:56pm

Well ...

1. UGLY news: Lewis finished a pathetic 4th, his ball boy won the race (!) and both Ferraris worked (!!!!!!!!!).

2. BAD news: If your scope is to get a curve and create a kind of mesh out of it ... this is not the way by any means. Solution is "simple" or complex depending mostly on Karma matters.

3. GOOD news: You tell me.

BTW: Indeed you can find the best stuff in NP thus I took the opportunity to make a smallish cottage there.

Permalink Reply by Chapulin Colorado on May 1, 2017 at 1:11pm

So one thing would be to learn how sardines are getting canned(delaunaything) other would be to know how to cut the mustard instead.

BTW:Nice igloo

Permalink Reply by peter fotiadis on May 2, 2017 at 12:11am

For what (I assume) are you after:

1. Divide by count having into mind the lengths:

Sort: crvList = crvList.OrderBy(x=> x.GetLength(tol)).ToList();

Proportionally divide: If div refers to divisions for the minimum curve:

currentDiv = (int)Math.Round(currentLength * minCurveLength/(double)div, 0);

2. Do the same along a line from curve start to curve end. If the shape is like S etc ... spend some time to figure out what to do (tricky).

3. Spread evenly random points using some region that "represents" the interior (that's very tricky).

4. For flattish curves do a Delauney for the rest a Ball Pivot (very tricky). Or attempt a Patch (ultra tricky).

Are all the above OK for a novice? No

Permalink Reply by Chapulin Colorado on May 2, 2017 at 5:31am

interesseting stuff, the ballpivot etc. and intereting to see how it would be done better, but for me to tricky, so i jut try to get this with a delmesh done.Think will open a thread with correct name -or what i think it is.Or maybe can i flatten the lists or is the way doing it with trees?

Also, you are normally writing directlty in gh right?Never inside vs? I was trying a little bit in vs but debugging was to molesting unload and load gh evertime, or am i missing something.

regards

Permalink Reply by peter fotiadis on May 2, 2017 at 8:14am

Well ... no new thread is required (besides it's characteristic for a thread worth the name to start east and going north [where the best sardines are]).

And yes for the simple stuff that I post from time to time I write always "inside" GH (the editor is a bit crap but so what?).

But still I haven't got the gist of what you are after. Some sketch maybe?

PS: Make a short break (about 1- 5 years) and try to fully master the essence of Trees ... but if on the other hand your future dream is to write "portable" (kinda) code targeting other AEC applications as well (as found in any contemporary practice these days) ... er ... hmm ...

Permalink Reply by Chapulin Colorado on May 2, 2017 at 9:18am

in lunchtime i send a description, also a question about tree/list when to use/difference (hehe).