9659 search results - page 28 / 1932 » Points on Computable Curves |
CVGIP
2002
13 years 8 months ago
2002
Computing the intersection curve of two quadrics is a fundamental problem in computer graphics and solid modeling. We present an algebraic method for classifying and parameterizin...
SIGGRAPH
1993
ACM
14 years 24 days ago
1993
ACM
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
EUROCRYPT
2001
Springer
14 years 1 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...
TCS
2008
13 years 8 months ago
2008
This paper studies shapes (curves and surfaces) which can be described by (piecewise) polynomial support functions. The class of these shapes is closed under convolutions, offsett...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
A method is proposed for performing shape analysis of m-surfaces, e.g. planar curves and surfaces, with a geometric interpretation. The analysis uses an implicit surface represent...