I’m trying to identify the vertex/vertices in a 3D dataset which are at the zmin.
The task is very easy but I’m trying to figure out the fastest/cleanest way to do this. The dataset could be quite big and the geometry could be any type (not point cloud or raster).
Solved
Fastest was to extract vertex with zmin?
+43- Celebrity
Best answer by ebygomm
If you don’t want to go down the python route, then I would think that getting the vertices as a list, using a list range extractor to find the min z and then a listsearcher to find that coordinate would be more efficient than chopping to points?
This post is closed to further activity.
It may be an old question, an answered question, an implemented idea, or a notification-only post.
Please check post dates before relying on any information in a question or answer.
For follow-up or related questions, please post a new question or idea.
If there is a genuine update to be made, please contact us and request that the post is reopened.
It may be an old question, an answered question, an implemented idea, or a notification-only post.
Please check post dates before relying on any information in a question or answer.
For follow-up or related questions, please post a new question or idea.
If there is a genuine update to be made, please contact us and request that the post is reopened.
+43- Influencer
Are you looking to identify vertices at the zmin which is already known, or find the vertex with the lowest z value which is not yet known?
+43- Celebrity
The zmin is unknown
My current approach is to use:
Aggregator>BoundsExtractor>GeometryPartExtractor(lines)>Chopper(to points)>Tester(z = zmin)
Is just seems I could skip the last few steps and just extract the lowest point directly from the geometry e.g., An “ExtremeVertexExtractor”
+43- Influencer
- Best Answer
If you don’t want to go down the python route, then I would think that getting the vertices as a list, using a list range extractor to find the min z and then a listsearcher to find that coordinate would be more efficient than chopping to points?
1 person upvoted this
+43- Celebrity
ebygomm wrote:
If you don’t want to go down the python route, then I would think that getting the vertices as a list, using a list range extractor to find the min z and then a listsearcher to find that coordinate would be more efficient than chopping to points?
Ah nice the ListSearcher - yeah with a list of coordinates and a known z this works well.
Thanks
Helpful Members This Week
Enter your E-mail address. We'll send you an e-mail with instructions to reset your password.