9659 search results - page 3 / 1932 » Points on Computable Curves |
ICRA
2002
IEEE
14 years 13 days ago
2002
IEEE
It is well known that antipodal grasps can be achieved on curved objects in the presence of friction. This paper presents an efficient algorithm that finds, up to numerical reso...
WAE
2000
13 years 8 months ago
2000
Given a collection C of curves in the plane, the arrangement of C is the subdivision of the plane into vertices, edges and faces induced by the curves in C. Constructing arrangemen...
ANTS
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an elliptic curve over a finite field, given a Weierstrass equation for the...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
We investigate the automated reconstruction of piecewise smooth 3D curves, using subdivision curves as a simple but flexible curve representation. This representation allows taggin...
ASIACRYPT
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. A prohibitive barrier faced by elliptic curve users is the difficulty of computing the curves’ cardinalities. Despite recent theoretical breakthroughs, point counting ...