Sciweavers

110 search results - page 2 / 22
» Measuring linearity of planar point sets
Sort
View
CORR
2002
Springer
93views Education» more  CORR 2002»
13 years 6 months ago
On the Reflexivity of Point Sets
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity (S) of S is given by the smallest numb...
Esther M. Arkin, Sándor P. Fekete, Ferran H...
IJIG
2008
222views more  IJIG 2008»
13 years 6 months ago
An Analytical Solution to the Perspective-n-Point Problem for Common Planar Camera and for Catadioptric Sensor
The Perspective-N-Point problem (PNP) is a notable problem in computer vision. It consists in, given N points known in an object coordinate space and their projection onto the ima...
Jonathan Fabrizio, Jean Devars
ICRA
2002
IEEE
116views Robotics» more  ICRA 2002»
13 years 11 months ago
Linear 2D Localization and Mapping for Single and Multiple Robot Scenarios
We show how to recover 2D structure and motion linearly in order to initialize Simultaneous Mapping and Localization (SLAM) for bearings-only measurements and planar motion. The m...
Frank Dellaert, Ashley W. Stroupe
ISAAC
2004
Springer
125views Algorithms» more  ISAAC 2004»
13 years 11 months ago
Polyline Fitting of Planar Points Under Min-sum Criteria
Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statistics and has numerous applications. We consider fitting a polyline with k join...
Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehl...
SODA
2000
ACM
99views Algorithms» more  SODA 2000»
13 years 7 months ago
A point-placement strategy for conforming Delaunay tetrahedralization
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
Michael Murphy, David M. Mount, Carl W. Gable