9659 search results - page 14 / 1932 » Points on Computable Curves |
COMGEO
2007
ACM
13 years 8 months ago
2007
ACM
Given two points on a closed planar curve, C, we can divide the length of a shortest connecting path in C by their Euclidean distance. The supremum of these ratios, taken over all...
ANTS
2008
Springer
13 years 10 months ago
2008
Springer
Let K be a p-adic local field and E an elliptic curve defined over K. The component group of E is the group E(K)/E0(K), where E0(K) denotes the subgroup of points of good reduction...
COMPGEOM
1989
ACM
14 years 23 days ago
1989
ACM
We present algorithms that decompose an algebraic curve with rational coefficients in its defining bivariate equation into its irreducible real factors and its non-empty irreducib...
ECCV
2004
Springer
14 years 10 months ago
2004
Springer
Abstract. The shapes of many natural and man-made objects have curved contours. The images of such contours usually do not have sufficient distinctive features to apply conventiona...
SMA
2009
ACM
14 years 3 months ago
2009
ACM
The behavior of Catmull-Rom curves heavily depends on the choice of parameter values at the control points. We analyze a class of parameterizations ranging from uniform to chordal...