Why are they so difficult? Can someone refer me to a webinar or youtube video explaining the tools for working with trees.
Specifically, I have a definition that makes some sections of a part. There are multiple curves for each section so it makes them in a tree. I just wanted all curves for each section in one list. I’ll attach my definition that I did and it’s working but I assume there has to be a simpler way to do what I did. And I don’t even know why what I did works.
With Path and Branch you can get what you want enough simply.
Path, “Construct Path”, will create a path out of a list of integers, in your case it is a single number 8 > {8} , but in other cases it could build a more complex path like 5 , 3 > {5;3}.
Note that, data-trees structures like {0;0;0;0} and {0} are different.
The resulting data-tree of your BBX is too much complex to be “accessed” with a single-integer path, you need first to simplify it.
Try to not use simplify, Branch will give you an error telling you “1. Path {8} does not exist within this tree”.
Another example:
A data-tree “{x;y;z} N=w” is a country(x) with cities(y) with houses(z) with people inside.
Now it happens that there are only 3 houses, but there is only 1 country and 1 city… the structure is like:
{0;0;0} N=3
{0;0;1} N=11
{0;0;2} N=8
If you ask “Give me the persons of the second house” {1} , the program don’t know what you are talking about! It expected you to also tell on which country and which city (like a {0;0;1} ), even if there is only one of both.
So you tell it to “Simplify”… so the program can forget about the concept of “country” and “city”, and work just with houses.
Stupid example… 03:15 am here…ok i go to sleep now
Flatten does not work to group the curves for each section together.
Well I assumed that is what you wanted because you already have what you described?
You have 99 sections, the result of your intersection is 99 branches each with 3 curves. So they are already grouped that way.
The way google works is it puts the most popular / relevant on top. Obviously I am not suggesting to watch 19k+ videos, probably you can watch the first few. The first result seems promising if you quickly read a few of the comments / reviews / thumbs up to thumbs down ratio.
Hi @fpagel01 don’t worry, I know it can be frustrating but with practice it all makes sense in the end.
What you did sadly does not work, if I understood your question correctly.
The output of the Brep|Brep component already organizes data the way you want it: Each branch/list is a section, and inside there is all the curves that correspond to that section.
As a side note: Why are you not using the Contour component? Or in any case, if you want to make your custom contour with native components, it is better to use Brep|Plane component instead of Brep|Brep for computation purposes. An intersection between a plane and a brep is lighter than between two breps.
I feel you, still trying to wrap my head around data trees myself.
I’ve recently started to follow along with MODE LAB’s tutorial series. It’s slow going, but I guess thats needed for a topic as complex as this. Though I do not yet fully understand data trees, I’ve definately picked up some useful tricks from it.
I’ve seen so many attempts to explain Trees, and all of them makes me wonder if I missed something (I always perceived them as camouflaged “Lists of Lists”). So I wonder
#1. What are Tree’s if not equivalents to “Lists of Lists” (meaning, dynamic length of the “paths”, or indexes)
#2. If Tree’s cannot directly be copied into the following Lists of Lists, what are they then?
Fig. Array’s of Arrays, or Lists of Lists (which can be essentially the same thing under the hood) of char. Indexes are grey
I never use Surify, I’ve always wondered why it’s necessary. I don’t mix trees of different path lengths, and if I do, I simplify the inputs. Really, I’ve never used it.
There are some cases when the zeros don’t get simplified down further, Suirify just ensures that no matter what, the paths are single number addresses in all cases. Honestly, I don’t use either much as I don’t find myself splitting out branches manually in many cases.
Suirify is beginner’s best friend. I always use it when there are operations involved two tree structures. It helps to understand better on what is happening.
