9659 search results - page 81 / 1932 » Points on Computable Curves |
115
click to vote
IJISEC
2008
14 years 12 months ago
2008
The Ate pairing has been suggested since it can be computed efficiently on ordinary elliptic curves with small values of the traces of Frobenius t. However, not all pairing-friendl...
102
click to vote
ICCV
2003
IEEE
16 years 1 months ago
2003
IEEE
In this paper, we propose a novel method to recover the surface shape of transparent objects. The degree of polarization of the light reflected from the object surface depends on ...
GD
2009
Springer
15 years 4 months ago
2009
Springer
Let n ≥ 4 be even. It is shown that every set S of n points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of n str...
288
click to vote
Publication
In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is
selected aut...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...