<p>Generating a mesh from a point cloud has always been a complex and tedious task. It requires many guidelines to be followed and geometry specific boundary condition to be taken care of. Mostly we end up writing a new algorithm for each scenario. The existing algorithms like Delaunay triangulation end up taking a lot of time without taking care of the internal holes properly. Also the convergence is not guaranteed. In this paper, we present a recursion free algorithm for triangulating a structured surface with n-vertices with or without holes using Ball trees. The algorithm takes the input in the form of an image, creates a mask for the object to be triangulated and then creates a mesh for it with respect to computed vertices. © 2018, Springer International Publishing AG.</p>
cited By 0
S. Joshi and Vasudevan, S. K., “A novel algorithm for triangulating 2d point clouds using multi-dimensional data structures and nearest neighbour approach”, Lecture Notes in Computational Vision and Biomechanics, vol. 28, pp. 315-323, 2018.