Grasshopper

algorithmic modeling for Rhino

Hello everyone,

 

I created a geodesic dome using delauney edges and everything works fine.

I would like to export this file to dxf. The problem is that if I bake the different lines (from different line lists), some of the lines are baked double or triple...

 

The origin lies in the line lists. Every list contains a number of lines. But list A contains some of the lines of list B and this is the case for all of the lists.

I would like to merge all these lists in one big list, where every line is only presented one time.

Is there an option te remove the overlapped data in order to construct a clean dxf file with no hidden lines?

 

Thank You!

 

Lara

Views: 11035

Replies to This Discussion

Hello,

I have problems to save/open grasshopper with the Kangaroo tool.
As you mentioned I save the attachment under \Rhinoceros 4.0\Plug-ins\Grasshopper\Components..

If I open Rhino and then Grasshopper, there's an error that occurs:

"An error occured during Assembly Parsing. Plugin may not function as expected.
mscorlib:Could not load type 'Grasshopper.Kernel.GH_Component' from assembly'Grasshopper, Version=1.0.0.0, Culture=neutral, PublicKeyToken=null'."

What to do?

Thanks
Thanks for letting me know. Good to get these bugs ironed out early.
I'm not sure yet what the problem is but I'll figure it out.
Which versions of Rhino and Grasshopper are you on ?

Did anyone else try running this successfully or unsuccessfully yet ?
I have tried it with Rhino 4 SR6 and GH 0.6.0059. No problems running the components.

Thanks a lot for these!
I am on Rhino 4 SR5 (educational lab license) and GH 0.6.0019.
Perhaps I have to update these versions..
I'll try..
I've downloaded GH 0.6.0059 and know it works!

Thanks a lot!!
Baller!
Hi Daniel,

I am new in Grasshopper and in my first day, I am bit frustrated to find out how to remove duplicate points. I've spent all day to sort and use Boolean operation. Thanks to you, this very simple problem now solved. However, I am very glad if you share procedure to get there. Maybe I miss something or my algorithm is not quite right.

Thank you in advance,

Regards,
Aswin.
Are you asking how to use the component I posted (by the way, the current version can be downloaded here), or about what are the internal workings of that component ?
Thank you for your quick reply.

I need to learn internal working.
I am not succeeded on sorting and filtering duplicate data.
Again, thank you.

Regards,
Aswin.
Glad it's helpful.

Ryles - yes, if exploding your rectangles and rejoining them after isn't a problem you can use this. Otherwise the same approach used in this script could theoretically be extended to deal with polylines. It's just a question of comparing the lists of vertices against each other in either direction (closed polygons such as rectangles would also be possible, but a little more work because of the possibility of rotational symmetry).

Jon - I'm probably not the best one to try and explain making plugins as I'm still new to it myself, but I think there might hopefully be some sort of reference soon.

Making that interconnect points got me thinking - maybe it would be nice to have this 4th type of data matching for other components such as intersections:


The first 3 should be recognisable as longest list, shortest list and cross reference. The 4th 'strictly upper triangular' form would be useful whenever you want to have each item in a list interact with every other item in the list apart from itself exactly once.
thanks, i'm going to give it a go later this afternoon. i hope i can get it to work right, not being able to delete duplicates has been an issue in one of my definitions for a while now.
Hi Daniel,

noted. Data Matching needs to be seriously rethought now that Trees are in the picture anyway.

--
David Rutten
david@mcneel.com
Poprad, Slovakia

RSS

About

Translate

Search

Photos

  • Add Photos
  • View All

Videos

  • Add Videos
  • View All

© 2024   Created by Scott Davidson.   Powered by

Badges  |  Report an Issue  |  Terms of Service