asured to a boundary curve (black):
I am looking for the result below (blue curve):
I divide the green curve into the number of sides that the boundary has (4 in this case), so a segment of the green curve is offset according to the closest segment of the boundary curve(black). However, when I have done that, of course the curves are too long and they interesect each other and even some of them become redundant. See the image below:
Does anyone have a good suggestion how I can trim the redundant curves and redundant parts of the curves and get a closed offset polysurface (see 2nd image)?
Thanks!
…
closed polysurfaces that have no object names
I now need a way to transfer the lot ID's of the 2D curves to the 3D polysurfaces. I've already gotten very close to a solution by using Curve CP to find the closest cuve to the center point of each polysurface. Unfortunately, I've now discovered that my lot curves aren't perfectly clean and this solution fails whenever one of the lot curves slightly overlaps into an adjacent lot because it then becomes the closest curve.
The simplest solution I can think of would be to offset all of the curves by a small margin inward so that there is no longer any overlap, but I would need to do this in a way that preserves the object name of the original curve, so that the offset can then pass the name on to the polysurface. I imagine this is possible, but I am relatively new to grasshopper and so I am hitting a wall here.
If anyone knows an existing offset component out there that can do this on a large set of curves, or if there is an even easier solution to my original problem, I would be very grateful-- thanks!…
accept untrimmed surfaces, only Open Brep, but sometimes, seemingly out of the blue, the Open Brep changes into Untrimmed Surfaces and vice versa. I've already checked the unit tolerance in Rhino, that made no difference. Any ideas about where I could be going wrong?
--
Second issue is that some of the geometries should 'curl' outside their grid boundaries. I need to be able to play with the grid size while the geometry maintains its position.
Also, the first set of these geometries (bottom of image) should translate as a flat surface. But the points 1 and 3 tend to stick to the 2nd Grid - creating openings on the side. How could I fix that?
--
Third issue is that the geometries seem to be a little 'squished' at their plane normal (right until where the 2nd Grid offsets). I tried adding a number slider between the [z-vector] in the ptCoordinates and the [translation vector] in the Move component.. but that isn't working. Ideally I wouldn't need to control the offset distance, the shapes would retain proportion automatically. Any ideas?
Thanks so much in advance! :)
…
surfaces in different way, much more schematic, in this way you could increase the speed of the calculation.
If you want take a look here:
http://nrel.github.io/EnergyPlus/Tips_and_Tricks_Using_EnergyPlus/Tips_and_Tricks_Using_EnergyPlus/
Best
Antonello
…
3
but I cant make it work with the Hinge tool.
Could anybody tell me how to make this 2 triangles fold as I show in this screenshot?
Below are the grasshopper definition I've been trying to do following the Kangaroo basics video, and the two triangles 3dm file.
Thanks…
ed various mesh and surface intersect components, but figured I may as well ask if someone can point me in the right direction. Thanks in advance.
The image below attempts to illustrate my goal:
…
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…