Grasshopper

algorithmic modeling for Rhino

Hello

I'm new to Grasshopper and I'm trying to generate a perforated panel.

I wont likely be fetched. listen to advice

I can not get in the end I left a unique perforated surface to run the Bake. On the contrary there are many surfaces with a single perforation.

 

Views: 3371

Attachments:

Replies to This Discussion

any splitting, trimming or boolean operation takes ages to calculate - be careful with this ;]

 

Dont even ask how long it took to get this : http://www.mateuszzwierzycki.jupe.pl/blog/wp-content/uploads/2011/0...

Attachments:

Hi Mateusz

Here I go again with the theme of the perforated panel. In this case a more complex drillinggeometry.

Um I have problems in making the "Bake" I do not understand because it causes a volumeremains below the perforated surface.

Attachments:
Thanks Mateusz

Your algorithm is very efficient

just that for me is less intuitive. I do not understand the logic of its operation. will have to study.

Future management of the lists will be a powerful tool.

If you do not mind, I would be very useful a brief explanation of its operation.

I am grateful for your help.

Ahhhhhhh something I understand ... In the first part when you use the delete lists of contourpoints.

I understand what you do is end

Hi Mateusz

Here I go again with the theme of the perforated panel. In this case a more complex drillinggeometry.

Um I have problems in making the "Bake" I do not understand because it causes a volumeremains below the perforated surface.

Attachments:

First, draw sawded previous geometry and will see that something happens when you intersect two breps , a point is stangely created, but its not the bug, if you bake and try solid difference it works except some pieces that contact with the boundary of the surface, not all just some of them, i think this is a bug or just the way boolean works? hope someone could explain us...

Attachments:


Thanks Lucas for the attempt. I do not understand where is the error.

I think the problem may be split surface function ... not

I hope someone give us a hand

regards

Hey fernando:

This is what i came up with

 

Attachments:

Hola mario

 

Genial tu solucion !!

me gusto mucho como dejaste organizado tu algoritmo y ademas le agregaste la posibilidad de escalar.

 

Soy muy nuevo en esto y la verdad que gente como tu nos permiten seguir aprendiendo.

 

Al ver las diferentes soluciones que se pueden dar para un mismo problema me apareció la siguiente inquietud.

No todas las soluciones son igualmente eficientes desde el punto de vista de ahorro computacional verdad?

 

Bueno saludos y gracias de nuevo.

 

 

Gracias Mario. La posibilidad de escalar se ve que se introduce para evitar los contactos del elemento a popular en la superficie con las aristas de ésta, entonces no encuentra "puntos extraños" en las intersecciones...Mucho más claro ahora, gracias a los dos.

fernando:

yes, there are multiple solutions for the same problem.

there are components that require more calculations than others.

trying to keep the number of components as low as possible always helps.

i´m glad the definition was helpfull.

Best

Mario

No forum if they did, but it would be interesting to solve a particular problem with differentalgorithms and select the most efficient or the most ingenious. It can be a good way to learn from others.

regards

 

RSS

About

Translate

Search

© 2024   Created by Scott Davidson.   Powered by

Badges  |  Report an Issue  |  Terms of Service