Publication Type:

Journal Article

Source:

Lecture Notes in Computational Vision and Biomechanics, Springer Netherlands, Volume 28, p.315-323 (2018)

URL:

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85042423266&doi=10.1007%2f978-3-319-71767-8_27&partnerID=40&md5=cf1c1fa3c0e207956962d42ff1d4d776

Abstract:

<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>

Notes:

cited By 0

Cite this Research Publication

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.

207
PROGRAMS
OFFERED
6
AMRITA
CAMPUSES
15
CONSTITUENT
SCHOOLS
A
GRADE BY
NAAC, MHRD
8th
RANK(INDIA):
NIRF 2018
150+
INTERNATIONAL
PARTNERS