Sciweavers

1261 search results - page 79 / 253
» Approximation algorithms for aligning points
Sort
View
COMGEO
2008
ACM
14 years 10 months ago
Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...
Robert L. Scot Drysdale, Günter Rote, Astrid ...
SIGGRAPH
1998
ACM
15 years 2 months ago
A New Voronoi-based Surface Reconstruction Algorithm
We describe our experience with a new algorithm for the reconstruction of surfaces from unorganized sample points in IR 3. The algorithm is the first for this problem with provab...
Nina Amenta, Marshall W. Bern, Manolis Kamvysselis
IROS
2009
IEEE
229views Robotics» more  IROS 2009»
15 years 4 months ago
3D mapping for urban service robots
— We present an approach to the problem of 3D map building in urban settings for service robots, using threedimensional laser range scans as the main data input. Our system is ba...
Rafael Valencia, Ernesto Homar Teniente Avil&eacut...
CIVR
2007
Springer
173views Image Analysis» more  CIVR 2007»
15 years 4 months ago
Fast and cheap object recognition by linear combination of views
In this paper, we present a real-time algorithm for 3D object detection in images. Our method relies on the Ullman and Basri [13] theory which claims that the same object under di...
Jérome Revaud, Guillaume Lavoué, Yas...
ICASSP
2009
IEEE
14 years 7 months ago
Ensembles of landmark multidimensional scalings
Landmark multidimensional scaling (LMDS) uses a subset of data (landmark points) to solve classical MDS, where the scalability is increased but the approximation is noise-sensitiv...
Seunghak Lee, Seungjin Choi