124 search results - page 6 / 25 » On the Computability of Rectifiable Simple Curve (Extended A... |
GMP
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract. This paper presents the mathematical framework, and develops algorithms accordingly, to continuously and robustly track the intersection curves of two deforming parametri...
EUROCRYPT
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. We show that finding an efficiently computable injective homomorphism from the XTR subgroup into the group of points over GF(p2 ) of a particular type of supersingular e...
ICCS
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Conceptual graphs (CGs) share with FOL a fundamental expressiveness limitation: only higher-order logics allow assertions of properties on predicates. This paper intends ...
MICS
2007
13 years 7 months ago
2007
Abstract. We show that the complexity of a parabolic or conic spline approximating a sufficiently smooth curve with non-vanishing curvature to within Hausdorff distance ε is c1ε...
GMP
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract. We present an efficient and robust algorithm for computing continuous visibility for two- or three-dimensional shapes whose boundaries are NURBS curves or surfaces by li...