Year: 2011
Type: conference-paper
Abstract: The LFT algorithm (Large Fat Tetrahedron) is used to detect congruent subsets amongst unordered point sets and\nforms the kernel of a partial shape matching method. Although the method yields several advantages and is\nrelatively efficient, its performance depends highly on the choice of various geometrical threshold parameters, as\ne.g., for the length difference of two edges. We present an overview of the key parameters of the algorithm and\ntheir influence on the computation, a guide line to provide an initial value for the parameters and we propose an\napproach to their automatic adjustment.
Authors: Joris S. M. Vergeest, A. C. Kooijman, Yu Song
Language: English
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W3029025837