Dear, forum friends,
Now I need to modify my design:
In the array hexagon, a certain number of consecutive three hexagons are connected, but they are not adjacent.
Friends, is this problem too difficult to achieve?
Hello
this doesn’t seem too difficult to achieve, but it also depends on the rules you have.
For me the problem is that you send what’s look like a school problem, you want others to solve your problem. With this method you will not learn and the helper could eventually learn.
For your problem you could look at components like Proximity 2D Populate 2D to make groups of cells. You will need also some test to suppress groups of cells that are touching …
Try to make some tests and come back with YOUR script!
2 Likes
No it’s not hard to achieve. I narrowed myself every time a saw a new post of you, but I’m sorry, I have to get rid of it now. You got so much help of this community and I’m really sorry for all the people who have invested their time. Even if often people told you not to create duplicated posts, you still continue. For me it looks like you put 0 effort in the script yourself. You just post pictures and tell people to do the work for you:
7. This is not a do-my-work-for-me group
You won’t learn anything if you continue to behave like this, and that’s why you have to ask over and over again.
1 Like
I am from a university. I have wanted to ask questions in the forum many times. In fact, I also have worked hard, but I am a beginner. The progress of the project does not allow me to have too much time to learn and improve the grasshopper, so I will need the help of forum friends.
Still thank the friends for your patience.
If possible, my research team needs one or two Grasshopper professionals to work together to solve a scientific problem. do you think it’s okay?
So are you hiring? You can always post in the jobs category https://discourse.mcneel.com/t/about-the-jobs-portfolios-category/11264
1 Like
Dear forum friend
Regarding my hollow hexagonal materialization: the red box as shown below, since it is a random parameter control generation, this will happen if two consecutive ones are made, so it is foreseeable to do 4, and 5 will have more of this.
Because the number of hexagonal matrices is limited, the more physicalized sampling, the easier it is to cause interlacing.
My thoughts first through a series of random points, and then find the closest point to the random point, sorting and filtering
Than try it yourself first …
2 Likes
dear friend
I’ll try again.
But, I’m still worried that there will be multiple adjacent problems in four consecutive hollow hexagonal grids or five consecutive hollow hexagonal grids.
I first use Random to take out the center point of the hexagon and then use Anemone to perform the loop operation. I still can’t achieve the result I want: a hollow hexagon is solid part surrounded by hollow; two continuous hollow hexagonal entities surrounded by hollow; in turn, three or four continuous hollow hexagons are materialized, and the hexagons around them are hollow.
It is better to use populate than random as populate try to put enough place between points.
Putting more point along could be done searching proximity points near a line of desired length … There are many ways. Withouth coding I don’t know a simple way to be 100 % exact.
Dear laurent
For populate 2D, I’ve tried, but I still can’t get what I want.
Also, using a line of desired length was my original design. Now I just want to find the center point and then randomly materialize a hollow grid, but it can not appear two consecutive. If two consecutive hollow hexagons are materialized, three consecutive hollow hexagons cannot appear.
Please check the following website
You better learn C# or Python with some simple rules.
My friend, your suggestion is very good, but I don’t understand C # and Python at all.