I have some imported stl objects in my scene. They are looking quite different, but for example i will talk about the orange one in this example https://threejs.org/examples/?q=stl#webgl_loader_stl.
At the moment im able to click on the object with the mouse, object gets selected and i can do whatever i want. Now i want to click on the object and select only a part/area of the object f.e. in case of the orange object i click on the gap of the disk and i want to highlight that. (I want/need the positions of the gaps vertices)
The idea is: go through the geometry.attributes.positions and get somehow the correct surface.
Im not sure, how this surface looks like (how many vertices) and compute a sphere or mesh around it and make it visible.
Iâm a bit stuck because for me itâs a very complex issue and maybe somebody can push me in the right direction.
Very interesting for solving the problem are the posts: #2#15#21
Youâll need to use the triangle information to know which triangles are neighbours of which ones, and also know the angles between them, to separate the boundary that forms the feature you want.
I will write you an algorithm in pseudocode (which means it is not written in any programming language, but more like english). You can ask later how to implement specific algorithm lines.
The algorithm starts with the selected triangle and basically grows the set of processed triangles by finding the neighbours to active triangles. A neighbour is added only if the angle between the selected triangle and the new one is less than a threshold. When no more triangles can be added, the algorithm stops and returns the set of triangles which form the selected mesh feature.
Let angleThreshold = 35 degrees
Let T = the set of triangles of the object.
Let t be the selected triangle in T
Let U be a set, initially equal to T. It is the set of unprocessed triangles.
Let A be a set, which initially contains only the triangle t. It is the set of active triangles.
Let R be the result triangle set, initially empty.
While A is not empty do:
Take out the triangle t from A.
Take out the triangle t from U.
Put the triangle t into R.
Let N be the set of triangles from U which are neighbours of t and its normal form an angle less than angleThreshold degrees whith the normal of t.
If N is not empty:
Add the triangles in N to the set A, if they are not already.
End If
Let t be a triangle of A, if A is not empty.
End While
Return R.
Hello yombo,
First i want to thank you very much. Its awesome that ppl like you are so kind and take their time to help others.
Iâve been analysing your code and except a little thing i think it should work.
After: if N is not empty:
Add N to A, if they are not already in AND if they are in U.
So thank you very much, i have no an idea of what i want to dođ. A few questions in my mind right now are:
All these vectors are stored in geometry.attributes.position.array. When i now click on the object, i have to somehow get nearest triangle. I have to think about it tomorrow again, but right now (at midnight) i dont know how
(I think the solution of this question should be easy)
When i have a triangle (3 vectors in my array), where are my x neighbors? How can i know how many i have? This questions seems kind of hard⌠maybe some vector dimensions have to be similar⌠but the search algorithm would take quite alot of time to go through every triangle, wouldnt it?
I wrote âLet N be the set of triangles from UâŚâ, so no need to check if they are in U, we took them from U already.
1 . The THREE.Raycaster gives you information on the intersection point, the face intersected and more.
2 . For this to work it is much more useful to work with an indexed mesh. Look at examples/BufferGeometryUtils on how to convert between indexed and non-indexed.
Once you have an indexed mesh, it means you not only have geometry.attributes.position, but also geometry.attributes.index. Now the main array is the index, which tells you (with every three numbers) the indices of the triangle vectors in the position.array.
To know the neighbours you compare indices of triangles. For example given the triangle with vertex indices (a, b, c), you search other triangles with indices (b, a, ?), (?, a, b), (a, ?, b) (This would be neighbours in the first segment, a-b) and so on.
Yes, it can be slow depending on the triangle count and how it is programmed.
Thank you very much again.
On monday i am going to start implementing this. Is it necessary to convert to an indexed array? when i have to search for these 6 combinations (a,b,?),(b,a,?),(a,?,b),(b,?,a),(?,a,b),(?,b,a) by going through the whole array, it doesnt matter if its sorted, except i donât have to search through everything:).
What changes with an indexed array?
Im excited for monday:)
Yes, there are lots of possible optimizations, as that one.
About using indexed mesh: Without it you have only vertex positions, so to find neighbours you need to compare positions instead of just integer indices. That is commonly called âtriangle soupâ. With indices you have the common vertices joined already and it is much faster, as I say, to compare two indices than two vectors.
In the example segments is set to 10 and the object has a geometry.position.length of 363 and count of 121 and a index.length and count of 600.
So my first question is:
How can i calculate the segments variable for my object? my object has f.e. a position.length of 5568 and a count of 1856.
I watched the index array of the example object and the first values look like this:
0: 1
1: 0
2: 12
3: 0
4: 11
5: 12
6: 2
7: 1
8: 13
9: 1
So my goal is to get neighbours and the angle to each others areas out of this data.
My second question is: How can i get neighbours and angles out of these numbers?
i understand how i can get the information out of the position.array (by finding other combinations (a,b,?), (b,a,?) ⌠but i donât understand the princip of the indices)
EDIT: I think i can get angles by â.computeVertexNormalsâ. But i still donât know how to find neighbours. I also donât understand why the indices are much more values then the geometry.position ones.
For Raycaster i use this codeline: intersects = raycaster.intersectObjects( scene.children, true );
All my objects are stored in scene.children, which i want to select.
By selecting an object, i get back âFaceâ and âFaceindexâ (see https://threejs.org/docs/#api/en/core/Raycaster).
So my third question is: do i have to compare these indicices with the ones reated?
Hey i have some new knowledge:
Finding neighbours should probably be done by comparing vectors. So you canât compare indices and find out neighbours because they are not sorted like that in the array. So you have to search them in the position array. The problem is now, i want f.e. to splice out a triangle from the array, i canât do that because i would have to splice out vertices which make other triangles work (and i would destroy other triangles). So to make this work i would have to make a hybrid⌠I think i need to save three vertices and a index so im able to say something like: âindex 123 processed, so splice itâ
The (a,b,?), (b,a,?) thing is with indices. The indices array works 3 by 3, with each three indices forming a triangle. For example:
If you have triangle (15, 16, 30) and find a triangle (112, 16, 15), you know the two triangles are neighbours. (Concretely, the first one shares the first side or segment, while the second one shares the second segment)
The indices of those triangles could be:
[ a, b, c, âŚ, 15, 16, 30, ⌠112, 16, 15, ⌠]
So each triangle have an index. The triangle with index 0 in this example is (a, b, c). The faceIndex that the raycaster gives to you should be the selected triangle index.
Yes, you can store a list of triangles to delete afterwards, as you say.
About the angle and normals, yes, you can compute the face normals. But for this application they are not useful, is is better to use the face normals. See how to compute it in THREE.Face3.
Once you have the normals of two triangles, you just make if ( normal1.angleTo( normal2 ) < threshold) { and so on.
Thank you, you are right. But do you know how to index a complex object? In the three.js âindexedâ example it looks pretty easy because the triangles are all known, but how can i generate an indexed buffergeometry, by not knowing, which vertices in geometry.attributes.positions are building a triangle? I understand that all vertices in a non-indexed geometry are represented once, so i donât understand, which vertices are building a triangle.
Then the âBufferGeometry, Indexedâ - example in three.js confuses me. It has 121 vertices (plane of 11 x 11), but if your right, vertices should be represented more often in the array because they are used for multiple triangles, or what am i missing hereâŚ
In an indexed buffer geometry faces are defined with indices of vertices in its .index property.
The simplest thing - quad:
Non-indexed buffer geometry: .index is null, position attribute contains information for 6 vertices (3 vertices per face, as a quad is built with 2 faces)
Indexed buffer geometry: position attribute contains information about 4 vertices and index has 6 indices (3 indices of vertices for each of 2 faces)
Okay thank you very much. So i have my non-indexed mesh and want to compute the facenormals now (i read that attributes.normal of a non-indexed mesh are usually vertexnormals https://github.com/mrdoob/three.js/issues/12559). But thereâs sadly no function for that. Do i have to filter out the vertex normals manually and compute face normals myself?
Edit. copied this from THREE.Geometry, so i should have my facenormals
cb.subVectors( vC, vB );
ab.subVectors( vA, vB );
cb.cross( ab );
