Year: 2010
Type: article
Abstract: We present a method of automatic alignment of two partially matching 3D shapes. The algorithm selects large fat\ntetrahedrons (LFT) composed of 4 vertices in one shape and exhaustively searches in the other shape for sets of 4\nvertices being compatible with the tetrahedron. By selecting such salient tetrahedrons that are relatively wide and\nfat, although also being not too unlikely to be contained in the overlap region, the cost of search can be reduced.\nThe method is relatively insensitive to noise and not depending on the existence of local shape features nor on\nfeature correspondences. When implemented on a GPU in Cuda, two point sets of 40,000 each can be aligned\nwithin seconds. The method is intended to support interactive 3D scan registration applications.
Authors: Joris S. M. Vergeest, A. C. Kooijman, Yu Song
Institution: Delft University of Technology
Language: English
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2400029806