Sciweavers

371 search results - page 27 / 75
» Algorithms for the transportation problem in geometric setti...
Sort
View
IJIG
2008
222views more  IJIG 2008»
13 years 7 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
IWPEC
2004
Springer
14 years 1 months ago
The Minimum Weight Triangulation Problem with Few Inner Points
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
Michael Hoffmann, Yoshio Okamoto
ISAAC
2005
Springer
100views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Separability with Outliers
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
Sariel Har-Peled, Vladlen Koltun
COCOA
2008
Springer
13 years 9 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
CCCG
2009
13 years 8 months ago
Clarkson's Algorithm for Violator Spaces
Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
Yves Brise, Bernd Gärtner