Is there an efficient way in JME to find all neighbouring vertices?
As far as I can see there is no real data structure behind the meshes. It is really very inefficient to operate on the vertex buffer directly! Is there a plan to implement something like a half edge data structure, wish would be very efficient.
Why would you want to do that? How is it inefficient to operate on the vertex buffer? Those kind of features are rarely required in a game engine so there's not much reason for them to be implemented.
Maybe I looked it up wrong, but don't half edge structures require storing like at least 3 times as much data, since every edge has to remember the index of it's source and it's destination? I mean the triangles are already indexed out for you and if you look at how the object your modifying is constructed you probably can even develop a quicker function to find adjacent vertexes, but since this is a function that's handy for 3D modeling, but not efficient rendering in real time gameplay I would be surprised if resources were allocated to store more data than the renderer needs.