Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.
Triangulation of 3D surfaces
I have a series of data points which describe a surface, i.e. in 3 dimensions. I understand that there is an algorithm, the Delaunay three dimensional algorithm for triangulating the surface. Now it comes down to the question of generating tetrahedrals and a circumscribing sphere where none of the other data points are contained within the sphere.
However whilst I can determine whether points exist or not within the sphere. I have no clear algorithm for determination of a contiguous surface. I don't care about efficiency. Does anyone have any idea about how to proceed??
0 · ·