Sciweavers

5019 search results - page 19 / 1004
» On the Reflexivity of Point Sets
Sort
View
COMPGEOM
2007
ACM
14 years 11 days ago
Traversing a set of points with a minimum number of turns
Given a finite set of points S in Rd , consider visiting the points in S with a polygonal path which makes a minimum number of turns, or equivalently, has the the minimum number o...
Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, F...
STACS
2010
Springer
14 years 3 months ago
The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets
Using ε-bias spaces over F2, we show that the Remote Point Problem (RPP), introduced by Alon et al [APY09], has an NC2 algorithm (achieving the same parameters as [APY09]). We stu...
Vikraman Arvind, Srikanth Srinivasan
BMVC
2001
13 years 10 months ago
Robust Registration of 2D and 3D Point Sets
This paper introduces a new method of registering point sets. The registration error is directly minimized using general-purpose non-linear optimization (the Levenberg–Marquardt...
Andrew W. Fitzgibbon
PSIVT
2007
Springer
110views Multimedia» more  PSIVT 2007»
14 years 2 months ago
Measuring Linearity of Ordered Point Sets
It is often practical to measure how linear a certain ordered set of points is. We are interested in linearity measures which are invariant to rotation, scaling, and translation. T...
Milos Stojmenovic, Amiya Nayak
ICCTA
2007
IEEE
14 years 2 months ago
Covering a Set of Points in a Plane Using Two Parallel Rectangles
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...
Chandan Saha, Sandip Das