standard preview color for selection is green).
3. Right-click component which contains data you don't want to see and select "Preview" option.
4. Now you should see only transformed geometry.…
Hello,
I have a basic question about Grasshopper. How do you divide a list of data into different branches? I would like to divide the list of 7 items into groups of 2 items.
For example, prepare 2 points at first and draw a line from point_0 to point_1
then I want to get 0 and 1 number which compose line from "line" component but how ?!?!?!
Somebody plz help me!!!
Somehow I`ve made them fly and pull to surfaces. Each time I achieve different result. I have an idea to divide on two groups and than one group of points pull to one mesh, other group to another mesh. But I don`t have criterions to find what result is better. Can somebody explain what am I doing wrong?
…
Added by Uliana to Kangaroo at 2:38am on November 13, 2015
through the grid points. They are only in rows (Figure 01) and when I try to use the RANDOM function, it generates the error "impossible to convert number to points". (Figure 02)How can I fix this?Thank you for your help!Figure 1: The two objects in rows
Figure 2: the message
…
yes, your explanation sounds a bit freaky.
I post a a sample of a wheel arch (in attachment).
Would be great to see an example of your methods on this surfaces.
A pattern like the BMW Vision would be fine, don't take it to litterally but something like in the image below:
I know that the Trezor's hexagons can be done easily on a single surface like in this tutorial.
But trust me, in the real world that front panel would be at least made from 2 slabs surfaces and one fillet surface.
This rear is probably a better example (is fully covered from hexagons too):
Maybe again the best solution is just to do it on a plane and then morph it on the Brep like this guy does:
https://www.youtube.com/watch?v=WjC6ZGP6OSM
Also for the BMW Vision it does not really look like made from one surface, the more so that there is a feature line passign through.
Would you suggest me any resource where to learn bits of the process that you explained in your previous post?
@Erick: Thanks, it was really interesting to go throught your GH definition, but I don't think it solves my issues. In your example if you had any definition inside your surfaces it would have been gone lost. And if you did not have any definition, I don't see any point in having a Brep representing that topology, a 1 surface would be fine so the problem would not exist.
…
making a cluster (image 3) )Also here is what I get when I double left click on that newly created cluster:
There is not input/output parameters inside that window.Just information about Name, description, author, icon...…
ge curves. The source code is available as usual on GitHub, https://github.com/mcneeleurope/ShortestWalk.
Here some examples of walks on predefined and custom grids.
With equilateral grids (1, 2, 3), the shortest walk on the network is the same both counting the edge length and the number of links. With these types of grids, there are often several solutions, one of which is selected by the ShortestWalk component. If the automatic search is used (no lengths are specified), then the A* algorithm is used and this will result in a path that departs "not much" (there are more rigorous definitions) from the straight path.
With the square grid (2), the geometry is called taxicab or Manhattan, and results in the total distance being the sum between the number of vertical steps and the number of horizontal steps.
The circular grid (4, 6) shows a case in which curve distance and "link distance" (number of edges that are walked, uses Dijkstra's algorithm) results is completely different paths. This example here selects the tangential road (4) or the "city center" (6).
Finally, Voronoi diagrams (5), Delauney triangulations (7) and random mazes or labyrinths (8) can be walked, searched and solved quickly, if a solution is possible, now even if there are multiple overlapping curves.
These examples show two-dimensional grids, but it is possible to also compute (weighted) walks on three-dimensional networks.
The compiled Grasshopper assembly (.gha) and the examples can be downloaded from Food4Rhino. Join the group if you want to get updates for new releases.
- Giulio________________
giulio@mcneel.comMcNeel Europe, Barcelona…