C# point bewtween lines/Problem converting datatypes?/Looping through two sets of points

Replies to This Discussion

Permalink Reply by Chapulin Colorado on March 13, 2017 at 9:54am

Hi Peter,

would be nice to do something a little bit crazy, i was thinking about how to give it a little bit more control.

The shortest walk plugin has the possibility to give some wanted paths.assigns mor than 1 start,- and endpoint.

Or for example the Menges spider stuff:

http://www.arch2o.com/elytra-filament-pavilion-unveiling-achim-menges/

or this:

http://icd.uni-stuttgart.de/?p=12965

i really like this kind of experimental architecture.

I am still far away to can produce this. Would just do.My future goal would be doing somthing similiar with the use of millipede or similiar to make it not just random.

BUt maybe its the next step applying some recusrion on the lines. This weekend i had no time to think more in this direction. Hope afterworks these days i can dig a little bit deeper in this themes.

That what i tried friday night:

Maybe you have an idea and are interested in help pointing in a direction.

If not i can understand dont want anybody to do my work. maybe i need to declare better what i want.

regards

Permalink Reply by peter fotiadis on March 13, 2017 at 11:37am

Try the attached (it's just a starting point (one out of many directions) NOT a solution by any means).

PS: If you have aspirations to become a pro in our trade (AEC) ...  coding is the only way to cut the mustard. People who claim the opposite are just amateurs (or "pros").

Attachments:

• ShortPath_entryLevel_V1.gh, 118 KB

Permalink Reply by Chapulin Colorado on March 13, 2017 at 7:22pm

Thanks Peter,

like that you kept it simple.

Trying get better in C# to get more opportunities within GH and later maybe some solid modeller.

Permalink Reply by peter fotiadis on March 14, 2017 at 1:38am

BTW: That's another far more efficient approach (but requires "slightly" more lines of code).

1. Divide randomly (or not) a circle.

2. Connect points (randomly or all).

3. Find all ccx events and make the regions.

4. "Radially" project the resulting region nodes to some target surface (Morph Methods are NOT the way to do this). Filter regions with more than 4 nodes (for obvious reasons).

5. Do something like this or that:

Permalink Reply by peter fotiadis on March 14, 2017 at 3:19am

And this attached (minus the internal thingy) is a good point to start for similar things (about a million times faster than the ShortPath approach: i.e do business in a flat mode and then "map" things to some target surface or use a physics engine the likes of Kangaroo2): The challenge is to mastermind a very fast way to do the resulting regions/polylines/point Trees (and thus having on hand stuff to proceed to the next steps):

That said: I've seen some suggestions in Code Project to do it ... that ...are ... a bit optimistic (they require a year and a half for finishing the job).

Attachments:

• Curves_or_lines_intersect_V3Demo.gh, 137 KB

Permalink Reply by peter fotiadis on March 14, 2017 at 10:31am

BTW: In the mean time and back (kinda) to your initial thread  ... here's what happened if you add some lines of code more just for fun:

From this:

To that:

PS: In fact recursion is widely used in most AEC cases ... thus this entry level thingy may shed some light on that matter.

Attachments:

• Divide_recursively_V1.gh, 134 KB

Permalink Reply by Chapulin Colorado on March 9, 2017 at 12:27pm

thanks Daniel and Peter, will have a look at lunchtime!

Permalink Reply by Chapulin Colorado on March 14, 2017 at 9:30pm

Hi Peter,

cant answer anymore so i am answering here. The projected one looks really neat!Also the Maelstroem one. Need some time to read all the code and try to understand it. Also doing some visual-studio tutorials to get a better c# understanding.Monday is holiday here so i will have some time look closer on your codes.

thanks one time more for the inspiration!

• ‹ Previous
• 1
• 2
• Next ›
• Page