Finding Line Segments with Tabu Search
Concettina Guerra, Valerio Pascucci · 2001
this paper we consider a direct 3D line detection problem stated asf#[B) ws. Given a set # n points in 3D space and a non-negative constant #, determine the line that is at a distance at most #f#(A the maximal numberof pointsof #. The above problem is solved repeatedlyf#t the extractionof multiple lines af#es the removal of the points that aref#e[( close to the best line. For line detection in range images, the input set # is chosen as the setof edge points