Sciweavers

9659 search results - page 45 / 1932
» Points on Computable Curves
Sort
View
CGF
2010
198views more  CGF 2010»
13 years 9 months ago
Feature Preserving Mesh Generation from 3D Point Clouds
We address the problem of generating quality surface triangle meshes from 3D point clouds sampled on piecewise smooth surfaces. Using a feature detection process based on the cova...
Nader Salman, Mariette Yvinec, Quentin Méri...
ICPR
2000
IEEE
14 years 10 months ago
Piecewise Linear Skeletonization Using Principal Curves
We propose an algorithm to find piecewise linear skeletons of hand-written characters by using principal curves. The development of the method was inspired by the apparent similar...
Adam Krzyzak, Balázs Kégl
ICPR
2000
IEEE
14 years 10 months ago
3D Curve Reconstruction by Biplane Snakes
Stent implantation for coronary disease treatment is a highly important minimally invasive technique that avoids surgery interventions. In order to assure the success of such an i...
Cristina Cañero Morales, Petia Radeva, Rica...
DCC
2001
IEEE
14 years 9 months ago
Weierstrass Pairs and Minimum Distance of Goppa Codes
We prove that elements of the Weierstrass gap set of a pair of points may be used to define a geometric Goppa code which has minimum distance greater than the usual lower bound. We...
Gretchen L. Matthews
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
13 years 9 months ago
On the low hamming weight discrete logarithm problem for nonadjacent representations
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
James A. Muir, Douglas R. Stinson