Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time
Jean-Gabriel KammererReynald LercierGuénaël RenaultPublished in: CoRR (2010)
Keyphrases
- endpoints
- unit length
- closed curves
- polygonal approximation
- special case
- finite automata
- computational complexity
- computer vision
- digital curves
- multiscale
- deterministic domains
- space curves
- anchor points
- finite sets
- straight line segments
- differential geometry
- worst case
- encoding scheme
- approximation algorithms
- point sets
- convex hull
- b spline
- feature points