implement a n-dimension mesh skeleting algorithm

[jimy-byerley]

skeletting a mesh helps in

• finding the closest edge to any arbitrary point in a surface or volume
• getting high quality triangulations
• generating or placing structures or holes between functional surfaces

It seems to be possible to compute such skelete for closed meshes in $$O(n \log(n))$$ where n is the number of simplices with a divide-and-conquer algorithm. Maybe this could be extended to non closed and non convex meshes