Sciweavers

9659 search results - page 184 / 1932
» Points on Computable Curves
Sort
View
153
Voted
SIAMIS
2008
124views more  SIAMIS 2008»
15 years 6 months ago
Area Distances of Convex Plane Curves and Improper Affine Spheres
The area distance to a convex plane curve is an important concept in computer vision. In this paper we describe a strong link between area distances and improper affine spheres. Th...
Marcos Craizer, Moacyr Alvim, Ralph Teixeira
GD
2004
Springer
16 years 11 hour ago
On the Realizable Weaving Patterns of Polynomial Curves in R3
We prove that the number of distinct weaving patterns produced by n semi-algebraic curves in R3 defined coordinate-wise by polynomials of degrees bounded by some constant d, is b...
Saugata Basu, Raghavan Dhandapani, Richard Pollack
ISSAC
1992
Springer
109views Mathematics» more  ISSAC 1992»
15 years 10 months ago
Easy Numbers for the Elliptic Curve Primality Proving Algorithm
We present some new classes of numbers that are easier to test for primality with the Elliptic Curve Primality Proving algorithm than average numbers. It is shown that this is the...
François Morain
CAGD
2002
61views more  CAGD 2002»
15 years 6 months ago
Polynomial parametrization of curves without affine singularities
This paper gives an algorithm for computing proper polynomial parametrizations for a particular class of curves. This class is characterized by the existence of a polynomial param...
Jaime Gutierrez, Rosario Rubio, Josef Schicho
CAGD
2002
156views more  CAGD 2002»
15 years 6 months ago
Explicit matrix representation for NURBS curves and surfaces
The matrix forms for curves and surfaces were largely promoted in CAD/CAM. In this paper we have presented two matrix representation formulations for arbitrary degree NURBS curves...
Ligang Liu, Guojin Wang