49 search results - page 8 / 10 » The Registration Problem Revisited: Optimal Solutions From P... |
SODA
2004
ACM
13 years 8 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
ICRA
2003
IEEE
14 years 22 days ago
2003
IEEE
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
CAD
2007
Springer
13 years 7 months ago
2007
Springer
In this paper, we present a BPM (Bézier Patch Mapping) algorithm which generates a strictly non-self-overlapping structured quadrilateral grid in a given four-sided planar region...
INFORMS
1998
13 years 7 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
Mobile sensors cover more area over a period of time than the same number of stationary sensors. However, the quality of coverage achieved by mobile sensors depends on the velocit...