# Geometry Nodes: How to find the 2 vertices that are furthest apart?

For example on an object like a banana, a snake or a C shaped object.

Is there a way to find the 2 "endpoints" or the 2 vertices that are furthest apart using geometry nodes?

• Important to clarify your metric: furthest apart in 3D space, or the longest route through the geometry? Feb 21 at 8:45
• Preferrably longest route through the geometry. Feb 21 at 11:20
• @muckyu can you make some example meshes, manually position the points that are further apart and explain the algorithm (e.g. draw a path from one to another) on why they are considered to be the furthest apart? That would make it a good question. For example, a "shortest path" could be used to get all possible paths through edges, and then pick the longest, but it's still not really "the longest path", because you could make it shorter by going through diagonals of the faces, and then shorter still by just arbitrarily traveling through the mesh. Feb 21 at 11:34