49 search results - page 3 / 10 » The Registration Problem Revisited: Optimal Solutions From P... |
SCIA
2007
Springer
14 years 1 months ago
2007
Springer
The problem of reconstructing 3D scene features from multiple views with known camera motion and given image correspondences is considered. This is a classical and one of the most...
CCCG
2010
13 years 9 months ago
2010
The Polar Diagram [1] of a set of points (i.e. sites) is a partition of the plane. It is a locus approach for problems processing angles. Also, Dynamic Polar Diagram problem is a ...
JOTA
2011
13 years 2 months ago
2011
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
JCDCG
2004
Springer
14 years 25 days ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...