9659 search results - page 90 / 1932 » Points on Computable Curves |
167
click to vote
ASIACRYPT
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
196
click to vote
HPCC
2005
Springer
15 years 12 months ago
2005
Springer
This paper reports the results of SIMD implementation of a number of interpolation algorithms on common personal computers. These methods fit a curve on some given input points for...
165
click to vote
WADS
2005
Springer
15 years 12 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
206
click to vote
SMI
2010
IEEE
15 years 4 months ago
2010
IEEE
—We present an algorithm for curve skeleton extraction via Laplacian-based contraction. Our algorithm can be applied to surfaces with boundaries, polygon soups, and point clouds....
199
click to vote
CGF
2006
15 years 6 months ago
2006
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...