In this paper we describe an algorithm for computing the dual of a projective plane curve. The algorithm requires no extension of the field of coefficients of the curve and runs in polynomial time.
The definition and computation of a metric on plane curves
โ Scribed by James D Emery
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 252 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0010-4485
No coin nor oath required. For personal study only.
โฆ Synopsis
A n algorithm is given for computing a metric on piecewise linear curves. A bound for the distance between a piecewise linear approximation and a general curve alia ws the approximate computation of the metric on general curves. The algorithm has been successfully implemented in Fortran. geometry~ metric, distencej piecewise linear curve
๐ SIMILAR VOLUMES
Elliptic curves over finite fields have found applications in many areas including cryptography. In the current work we define a metric on the set of elliptic curves defined over a prime field F p , p > 3. Computing this metric requires us to solve an instance of a discrete log problem in F \* p . T
## Abstract In this paper, we estimate an upper bound of the number of the cusps of a cuspidal plane curve. We prove that a cuspidal plane curve of genus __g__ has no more than (21__g__ +17)/2 cusps. For example, a rational cuspidal plane curve has no more than 8 cusps and an elliptic one has no mo
GrundWen a. Yath.