Sciweavers

121 search results - page 8 / 25
» A bound on the number of points of a plane curve
Sort
View
ECCV
2006
Springer
14 years 9 months ago
Level-Set Curve Particles
In many applications it is necessary to track a moving and deforming boundary on the plane from infrequent, sparse measurements. For instance, each of a set of mobile observers may...
Tingting Jiang, Carlo Tomasi
PAMI
2006
225views more  PAMI 2006»
13 years 7 months ago
Robust Structure and Motion from Outlines of Smooth Curved Surfaces
: This article addresses the problem of estimating the motion of a camera as it observes the outline (or apparent contour) of a solid bounded by a smooth surface in successive imag...
Yasutaka Furukawa, Amit Sethi, Jean Ponce, David J...
STOC
2001
ACM
116views Algorithms» more  STOC 2001»
14 years 7 months ago
One line and n points
: We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes wi...
Bernd Gärtner, József Solymosi, Falk T...
CORR
2010
Springer
110views Education» more  CORR 2010»
13 years 7 months ago
Construction of Rational Surfaces Yielding Good Codes
In the present article, we consider algebraic geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane cu...
Alain Couvreur
JGT
2010
113views more  JGT 2010»
13 years 5 months ago
Crossing numbers of imbalanced graphs
The crossing number, cr(G), of a graph G is the least number of crossing points in any drawing of G in the plane. According to the Crossing Lemma of Ajtai, Chv´atal, Newborn, Sze...
János Pach, József Solymosi, G&aacut...