𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalized conic curves and their applications in curve approximation

✍ Scribed by Ruibin Qu

Publisher
Springer
Year
1997
Tongue
English
Weight
645 KB
Volume
13
Category
Article
ISSN
1573-8175

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Chain Codes and Their Application in Cur
Chain Codes and Their Application in Curve Design
✍ Huub van de Wetering; Kees van Overveld πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 255 KB

representation of a curve that matters. Most of the theoreti-A representation for discrete curves based on the notion of cal results that have been achieved on, e.g., Bezier curves chain codes is defined; the parameterization of these curves is or B-spline curves heavily depend on algebraic properti

Universal periods of hyperelliptic curve
Universal periods of hyperelliptic curves and their applications
✍ Takashi Ichikawa πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 128 KB

We construct universal power series for di erential 1-forms and period integrals of Schottky-Mumford uniformized hyperelliptic curves over local ΓΏelds. Using these universal 1-forms and periods, we characterize Siegel modular forms vanishing on the hyperelliptic Jacobian locus, and construct univers

Approximating curves and their offsets u
Approximating curves and their offsets using biarcs and Pythagorean hodograph quintics
✍ ZbynΔ›k Ε Γ­r; Robert Feichtinger; Bert JΓΌttler πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 371 KB

This paper compares two techniques for the approximation of the offsets to a given planar curve. The two methods are based on approximate conversion of the planar curve into circular splines and Pythagorean hodograph (PH) splines, respectively. The circular splines are obtained using a novel variant

Approximating Polygonal Curves in Two an
Approximating Polygonal Curves in Two and Three Dimensions
✍ Kento Miyaoku; Koichi Harada πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 134 KB

We discuss the weighted minimum number polygonal approximation problem. Eu and Toussaint (1994, CVGIP: Graphical Models Image Process. 56, 231-246) considered this problem subject to the parallel-strip error criterion in R 2 with L q distance metrics, and they concluded that it can be solved in O(n