Relevant bibliographies by topics / Curve Approximation

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Curve Approximation'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Curve Approximation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Curve Approximation"

1

Shu, Si Hui, Zi Zhi Lin, and Yun Ding. "B-Spline Curve Approximation with Nearly Arc-Length Parameterization." Applied Mechanics and Materials 513-517 (February 2014): 3372–76. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.3372.

Full text
Abstract:
An algorithm of B-spline curve approximation with the three-dimensional data is presented in this paper. In this algorithm, we will get a smooth curve which is nearly arc-length parameterization. The smoothness and uniform parameterization are key factors of the approximating curve, specifically in skinning surface and surface approximation. Firstly, the data points are fitted using local interpolation, this local fitting algorithm yields n Bezier segments, each segment having speed equal to 1 at their end and midpoints. Then segments are composed of a C1 continuous cubic B-spline curve which named controlling curve. But the controlling curves control points are redundancy, so we find another curve to approximate the controlling curve using least square approximation with smoothness
APA, Harvard, Vancouver, ISO, and other styles
2

Wolters, Hans J., and Gerald Farin. "Geometric curve approximation." Computer Aided Geometric Design 14, no. 6 (1997): 499–513. http://dx.doi.org/10.1016/s0167-8396(96)00042-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gual-Arnau, Ximo, Maria Victoria Ibáñez Gual, and Juan Monterde. "CURVATURE APPROXIMATION FROM PARABOLIC SECTORS." Image Analysis & Stereology 36, no. 3 (2017): 233. http://dx.doi.org/10.5566/ias.1702.

Full text
Abstract:
We propose an invariant three-point curvature approximation for plane curves based on the arc of a parabolic sector, and we analyze how closely this approximation is to the true curvature of the curve. We compare our results with the obtained with other invariant three-point curvature approximations. Finally, an application is discussed.
APA, Harvard, Vancouver, ISO, and other styles
4

Louzazni, Mohamed, and Sameer Al-Dahidi. "Approximation of photovoltaic characteristics curves using Bézier Curve." Renewable Energy 174 (August 2021): 715–32. http://dx.doi.org/10.1016/j.renene.2021.04.103.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lin, Zi Zhi, and Si Hui Shu. "B-Spline Surface Approximation to Scanned Data Using Least Square Approximation." Applied Mechanics and Materials 571-572 (June 2014): 711–16. http://dx.doi.org/10.4028/www.scientific.net/amm.571-572.711.

Full text
Abstract:
Lofting is widely used to approximate the scanned data in row-wise fashion, but this method is prone to result an astonishing number of control points in the process of making the rows curve compatible. A novel algorithm of B-spline surface approximation to the scanned data is presented in this paper to solve this problem. Firstly, the scanned data are interpolated by rows of curves; then these curves are approximated by other curves using least square approximation. In this process, all curves are approximated by a common knot vector, and it is different form the traditional method that each curve is approximated by a different knot vector, so we needn’t insert many knots in each curve to make curves compatible. We also can meet high accuracy without losing the shape of lofting surface because we firstly interpolate the data, the best least square approximation substitute insertion of knots in lofting. Numerical example shows that the proposed method is efficient in reducing control points of the lofting surface.
APA, Harvard, Vancouver, ISO, and other styles
6

Gu, Le Min. "P-Least Squares Method of Curve Fitting." Advanced Materials Research 699 (May 2013): 885–92. http://dx.doi.org/10.4028/www.scientific.net/amr.699.885.

Full text
Abstract:
P-Least Squares (P-LS) method is Least Squares (LS) method promotion, based on the criteria of error -squares minimal to select parameter , namely satisfies following constitute the curve-fitting method. Due to the arbitrariness of the number , P-LS method has a wide field of application, when , P-LS approximation translated Chebyshev optimal approximation. This paper discusses the general principles of P-LS method; provides a way to realize the general solution of P-LS approximation. P-Least Squares method not only has significantly reduces the maximum error, also has solved the problems of Chebyshev approximation non-solution in some complex non-linear approximations，and also has the computation conveniently, can carry on the large-scale multi-data processing ability. This method is introduced by some examples unified in the materials science, the chemical engineering and the life body change.
APA, Harvard, Vancouver, ISO, and other styles
7

CHAN, W. S., and F. CHIN. "APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR." International Journal of Computational Geometry & Applications 06, no. 01 (1996): 59–77. http://dx.doi.org/10.1142/s0218195996000058.

Full text
Abstract:
We improve the time complexities for solving the polygonal curve approximation problems formulated by Imai and Iri. The time complexity for approximating any polygonal curve of n vertices with minimum number of line segments can be improved from O(n2 log n) to O(n2). The time complexity for approximating any polygonal curve with minimum error can also be improved from O(n2 log 2n) to O(n2 log n). We further show that if the curve to be approximated forms part of a convex polygon, the two problems can be solved in O(n) and O(n2) time respectively for both open and closed polygonal curves.
APA, Harvard, Vancouver, ISO, and other styles
8

Ge, Q. Jeffrey, and P. M. Larochelle. "Algebraic Motion Approximation With NURBS Motions and Its Application to Spherical Mechanism Synthesis." Journal of Mechanical Design 121, no. 4 (1999): 529–32. http://dx.doi.org/10.1115/1.2829493.

Full text
Abstract:
In this work we bring together classical mechanism theory with recent works in the area of Computer Aided Geometric Design (CAGD) of rational motions as well as curve approximation techniques in CAGD to study the problem of mechanism motion approximation from a computational geometric viewpoint. We present a framework for approximating algebraic motions of spherical mechanisms with rational B-Spline spherical motions. Algebraic spherical motions and rational B-spline spherical motions are represented as algebraic curves and rational B-Spline curves in the space of quaternions (or the image space). Thus the problem of motion approximation is transformed into a curve approximation problem, where concepts and techniques in the field of Computer Aided Geometric Design and Computational Geometry may be applied. An example is included at the end to show how a NURBS motion can be used for synthesizing spherical four-bar linkages.
APA, Harvard, Vancouver, ISO, and other styles
9

RAY, KUMAR S., and BIMAL KUMAR RAY. "POLYGONAL APPROXIMATION OF DIGITAL CURVE BASED ON REVERSE ENGINEERING CONCEPT." International Journal of Image and Graphics 13, no. 04 (2013): 1350017. http://dx.doi.org/10.1142/s0219467813500174.

Full text
Abstract:
This paper applies reverse engineering on the Bresenham's line drawing algorithm [J. E. Bresenham, IBM System Journal, 4, 106–111 (1965)] for polygonal approximation of digital curve. The proposed method has a number of features, namely, it is sequential and runs in linear time, produces symmetric approximation from symmetric digital curve, is an automatic algorithm and the approximating polygon has the least non-zero approximation error as compared to other algorithms.
APA, Harvard, Vancouver, ISO, and other styles
10

CHEN, Xiao. "Disk Bézier Curve Approximation of the Offset Curve." Journal of Software 16, no. 4 (2005): 616. http://dx.doi.org/10.1360/jos160616.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Curve Approximation"

1

Eu, David. "Polygonal curve approximation." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=56992.

Full text
Abstract:
Given a polygonal curve $P = lbrack p sb1,p sb2 ... p sb{n} rbrack$, the polygonal approximation problem considered in this thesis calls for determining a new curve $P sp prime = lbrack p sbsp{1}{ prime}, p sbsp{2}{ prime}, ..., p sbsp{m}{ prime} rbrack$ such that (i) m is significantly smaller than n, (ii) the vertices of $P sp prime$ are a subset of the vertices of P and (iii) any line segment $ lbrack p sbsp{A}{ prime}, p sbsp{A+1}{ prime} rbrack$ of $P sp prime$ that substitutes a chain $ lbrack p sb B, ...,p sb C rbrack$ in P is such that for all i where $B le i le C$, the approximation error of $p sb{i}$ with respect to $ lbrack p sbsp{A}{ prime}, p sbsp{A+1}{ prime} rbrack$, according to some specified criterion and metric, is less than a predetermined error tolerance. Using a popular error criterion, we study the following problems for a curve P in $R sp{d}$, where $d ge 2$: (i) minimize m for a given error tolerance and (ii) given m, find the curve $P sp prime$ that has the minmum approximation error over all curves that have at most m vertices. These problems are called the min-# and min-$ varepsilon$ problems, respectively. For R$ sp2$ and with any one of the L$ sb1$, L$ sb2$ or L$ sb{ infty}$ distance metrics, we give algorithms to solve the min-# problem in $O(n sp2)$ time and the min-$ varepsilon$ problem in $O(n sp2 log n)$ time. When P is a polygonal curve in $R sp3$ that is strictly monotone with respect to one of the three axes, we show that if the $L sb1$ and $L sb infty$ metrics are used then the min-# problem can be solved in $O(n sp2)$ time and the min-$ varepsilon$ problem can be solved in $O(n sp3)$ time. If distances are computed using the $L sb2$ metric then the min-# and min-$ varepsilon$ problems can be solved in $O(n sp3)$ and $O(n sp3 log n)$ time respectively. All of our algorithms exhibit $O(n sp2)$ space complexity.
APA, Harvard, Vancouver, ISO, and other styles
2

Sezgin, Tevfik Metin 1978. "Feature point detection and curve approximation for early processing of free-hand sketches." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/86765.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Belinga-Hill, Nelly E. "Empirical Likelihood Confidence Intervals for Generalized Lorenz Curve." Digital Archive @ GSU, 2007. http://digitalarchive.gsu.edu/math_theses/38.

Full text
Abstract:
Lorenz curves are extensively used in economics to analyze income inequality metrics. In this thesis, we discuss confidence interval estimation methods for generalized Lorenz curve. We first obtain normal approximation (NA) and empirical likelihood (EL) based confidence intervals for generalized Lorenz curves. Then we perform simulation studies to compare coverage probabilities and lengths of the proposed EL-based confidence interval with the NA-based confidence interval for generalized Lorenz curve. Simulation results show that the EL-based confidence intervals have better coverage probabilities and shorter lengths than the NA-based intervals at 100p-th percentiles when p is greater than 0.50. Finally, two real examples on income are used to evaluate the applicability of these methods: the first example is the 2001 income data from the Panel Study of Income Dynamics (PSID) and the second example makes use of households’ median income for the USA by counties for the years 1999 and 2006
APA, Harvard, Vancouver, ISO, and other styles
4

Hauser, James William. "Approximation of Nonlinear Functions for Fixed-Point and ASIC Applications Using a Genetic Algorithm." University of Cincinnati / OhioLINK, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=ucin997989329.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Brunner, David, and Guido Brunnett. "High Quality Force Field Approximation in Linear Time and its Application to Skeletonization." Universitätsbibliothek Chemnitz, 2007. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200700556.

Full text
Abstract:
Force fields of 3d objects are used for different purposes in computer graphics as skeletonization and collision detection. In this paper we present a novel method to approximate the force field of a discrete 3d object in linear time. Similar to the distance transformation we define a rule that describe how the forces associated with boundary points are propagated into the interior of the object. The result of this propagation depends on the order in which the points of the object are processed. Therefore we analyze how to obtain an order-invariant approximation formula. For a chosen iteration order (i, j, k) the set of boundary points that influence the force of a particular point p of the object can be described by a spatial region Rijk. The geometries of these regions are characterized both for the Cartesian and the body-centered cubic grid (bcc grid). We show that in the case of the bcc grid these regions can be combined in such a way that E3 is uniformly covered which basically means that each boundary point is contained in the same number of regions. Based on the covering an approximation formula for the force field is proposed that has linear complexity and gives good results for standard objects. We also show that such a uniform covering can not be built from the regions of influence of the Cartesian grid. With our method it becomes possible to use features of the force field for a fast and topology preserving skeletonization. We use a thinning strategy on the bcc grid to compute the skeleton and ensure that critical points of the force field are not removed. This leads to improved skeletons with respect to the properties of centeredness and rotational invariance.
APA, Harvard, Vancouver, ISO, and other styles
6

Porto, Iury Bertollo Gomes 1986. "Approximation and higher order Statistics for the Kappa-Mu phase fading model = Aproximação e estatísticas de ordem superior para a fase do modelo de desvanecimento Kappa-Mu." [s.n.], 2012. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259664.

Full text
Abstract:
Orientador: Michel Daoud Yacoub<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação<br>Made available in DSpace on 2018-08-21T10:53:47Z (GMT). No. of bitstreams: 1 Porto_IuryBertolloGomes_M.pdf: 2176563 bytes, checksum: 657761eeebab35f7888762aa91c017cd (MD5) Previous issue date: 2012<br>Resumo: Esta tese apresenta alguns resultados importantes das estatísticas de fase do modelo de desvanecimento kappa-mu. Em particular, a taxa de cruzamento de fase é obtida de maneira exata. Adicionalmente, para evitar a complexidade das formulações exatas, foram propostas soluções aproximadas para as seguintes estatísticas: taxa de cruzamento de fase e função densidade de probabilidade de fase. Além disso, uma metodologia de simulação foi desenvolvida para validar as formulações. Finalmente, dados de campo obtidos através de medidas conduzidas por outros pesquisadores foram usados para adequar às estatísticas de fase, tanto para o modelo kappa-mu quanto para Nakagami-m generalizado<br>Abstract: This thesis concerns some important results regarding the phase statistics of the kappa-mu fading model. In particular, the phase crossing rate is obtained in an exact manner. In addition, in order to circumvent the intricacy of the exact formulations, approximate solutions for the following statistics are proposed: phase crossing rate and probability density function of the phase. Furthermore, a simulation methodology is developed so as to validate the formulations. Finally, field data obtained by measurements conducted elsewhere are used to fit the phase statistics for both kappa-mu and generalized Nakagami-m models<br>Mestrado<br>Telecomunicações e Telemática<br>Mestre em Engenharia Elétrica
APA, Harvard, Vancouver, ISO, and other styles
7

Calcoen, Emmanuelle. "Approximation polygonales d'objets convexes du plan pour la geometrie algorythmique." Université Joseph Fourier (Grenoble), 1996. http://www.theses.fr/1996GRE10025.

Full text
Abstract:
La geometrie algorithmique a resolu de tres nombreux problemes sur des structures lineaires: ensembles de points, polygones dans cette these, nous nous interessons a des problemes de geometrie algorithmique concernant des objets non lineaires. Pour cela, nous introduisons la notion de convexe-f b, objet convexe du plan dont la frontiere est une union convexe de courbes de bezier dont les polygones de controle sont convexes. Nous sommes naturellement amenes a etudier les relations entre une courbe de bezier convexe et la convexite des polygones obtenus par subdivision. Pour tout convexe-f b, par cette subdivision, on construit deux suites de polygones convexes qui convergent vers le convexe-f b au sens de la distance de hausdorff, et ce de facon optimale. Ces deux suites satisfont une notion de hierarchie par inclusion et donnent deux approximations de l'objet: l'une interne et l'autre externe. A l'aide de ces suites, les solutions de certains problemes geometriques concernant des objets non lineaires sont obtenues comme limites de solutions de ces memes problemes appliques a des objets lineaires et l'on peut donner un sens precis a la notion de solution a -pres. Cette approche donne des algorithmes stables et robustes, avec des couts interessants en temps et place memoire. Quelques applications sont presentees
APA, Harvard, Vancouver, ISO, and other styles
8

Neagu, Manuela. "Courbes de Bézier en géométrie algorithmique : approximation et cohérence topologique." Phd thesis, Université Joseph Fourier (Grenoble), 1998. http://tel.archives-ouvertes.fr/tel-00004897.

Full text
Abstract:
Dans cette thèse, nous proposons une méthode de résolution des problèmes de la géométrie algorithmique posés pour des objets courbes (par opposition aux objets "linéaires" : ensembles de points, segments, polygones ...). Les objets que nous étudions sont des courbes de Bézier composites, choisies, d'une part, pour le réalisme qu'elles assurent dans la modélisation géométrique, et d'autre part, pour la facilité du traitement algorithmique que leurs propriétés offrent. Notre approche met l'accent sur les aspects topologiques des problèmes abordés, en évitant les incohérences que la résolution en arithmétique flottante d'équations algébriques de degré élevé (générées par le traitement direct des courbes) peut le plus souvent introduire. Cet objectif est atteint par l'utilisation d'approximations polygonales convergentes, qui dans le cas des courbes de Bézier sont naturellement fournies par les polygones de controle par l'intermédiaire de la subdivision de de Casteljau. Deux des problèmes fondamentaux de la géométrie algorithmique sont traités ici, l'enveloppe convexe et les arrangements, les deux en dimension 2. Dans le cas des arrangements, la notion de topologie (combinatoire) est bien connue ; dans celui de l'enveloppe convexe, nous la définissons rigoureusement. Pour les deux problèmes, nous montrons qu'il est possible d'obtenir toute l'information topologique définissant (de manière, il est vrai, implicite, mais correcte et complète) la solution exacte en travaillant exclusivement sur les approximations polygonales des objets donnés. Les résultats théoriques obtenus sont concrétisés par des algorithmes dont la convergence et la correction sont démontrées et pour lesquels des études de cout sont réalisées. Des exemples illustrent le fonctionnement de ces algorithmes, validant la méthode proposée.
APA, Harvard, Vancouver, ISO, and other styles
9

KANSARA, SHARAD MAHENDRA. "AN EFFICIENT SEQUENTIAL INTEGER OPTIMIZATION TECHNIQUE FOR PROCESS PLANNING AND TOLERANCE ALLOCATION." University of Cincinnati / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1069798466.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bothenna, Hasitha Imantha. "Approximation of Information Rates in Non-Coherent MISO wireless channels with finite input signals." University of Akron / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=akron1516369758012866.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Curve Approximation"

1

Ogwang, Tomson. A new functional form for approximating the Lorenz Curve. Economics Programme, University of Northern British Columbia, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

K, Ray Bimal, ed. Polygonal approximation and scale-space analysis. Apple Academic Press, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tschinkel, Yuri, Carlo Gasbarri, Steven Lu, and Mike Roth. Rational points, rational curves, and entire holomorphic curves on projective varieties: CRM short thematic program, June 3-28, 2013, Centre de Recherches Mathematiques, Universite de Montreal, Quebec, Canada. American Mathematical Society, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

1928-, Boehm Wolfgang, and Paluszny Marco 1950-, eds. Bézier and B-spline techniques. Springer, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Cojocaru, Alina Carmen, Chantal David, and F. Pappalardi. Scholar, a scientific celebration highlighting open lines of arithmetic research: Conference in honour of M. Ram Murty's mathematical legacy on his 60th birthday, October 15-17, 2013, Centre de Recherches Mathematiques, Universite de Montreal, Quebec, Canada. Edited by Murty Maruti Ram editor. American Mathematical Society, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bingi, Kishore, Rosdiazli Ibrahim, Mohd Noh Karsiti, Sabo Miya Hassan, and Vivekananda Rajah Harindran. Fractional-order Systems and PID Controllers: Using Scilab and Curve Fitting Based Approximation Techniques. Springer, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Eynard, Bertrand. Random matrices and loop equations. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198797319.003.0007.

Full text
Abstract:
This chapter is an introduction to algebraic methods in random matrix theory (RMT). In the first section, the random matrix ensembles are introduced and it is shown that going beyond the usual Wigner ensembles can be very useful, in particular by allowing eigenvalues to lie on some paths in the complex plane rather than on the real axis. As a detailed example, the Plancherel model is considered from the point of RMT. The second section is devoted to the saddle-point approximation, also called the Coulomb gas method. This leads to a system of algebraic equations, the solution of which leads to an algebraic curve called the ‘spectral curve’ which determines the large N expansion of all observables in a geometric way. Finally, the third section introduces the ‘loop equations’ (i.e., Schwinger–Dyson equations associated with matrix models), which can be solved recursively (i.e., order by order in a semi-classical expansion) by a universal recursion: the ‘topological recursion’.
APA, Harvard, Vancouver, ISO, and other styles
8

Integer Approximation of Real Valued Preference Curves. Storming Media, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Methods of Shape-Preserving Spline Approximation. World Scientific Publishing Company, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wootton, J. G. Be zier curve approximations of sweeps and circular arcs. 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Curve Approximation"

1

Cohen, Harold. "Interpolation and Curve fitting." In Numerical Approximation Methods. Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4419-9837-8_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sun, Zhengxing, Wei Wang, Lisha Zhang, and Jing Liu. "Sketch Parameterization Using Curve Approximation." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11767978_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Potier, C., and C. Vercken. "Spline curve fitting of digitized contours." In Algorithms for Approximation II. Springer US, 1990. http://dx.doi.org/10.1007/978-1-4899-3442-0_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Guo, Zeyu. "Randomness-Efficient Curve Samplers." In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40328-6_40.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Shou, Huahao, Wen Shi, and Yongwei Miao. "Biarc Approximation of Planar Algebraic Curve." In Communications in Computer and Information Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24999-0_63.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Laube, Pascal. "Parametrization in Curve and Surface Approximation." In Machine Learning Methods for Reverse Engineering of Defective Structured Surfaces. Springer Fachmedien Wiesbaden, 2020. http://dx.doi.org/10.1007/978-3-658-29017-7_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Schaback, Robert. "Geometrical Differentiation and High—Accuracy Curve Interpolation." In Approximation Theory, Spline Functions and Applications. Springer Netherlands, 1992. http://dx.doi.org/10.1007/978-94-011-2634-2_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Guerra, Valia, and Victoria Hernández. "Numerical Aspects in Locating the Corner of the L-curve." In Approximation, Optimization and Mathematical Economics. Physica-Verlag HD, 2001. http://dx.doi.org/10.1007/978-3-642-57592-1_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Mokhtari, Marielle, and Robert Bergevin. "Generic Multi-scale Segmentation and Curve Approximation Method." In Scale-Space and Morphology in Computer Vision. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-47778-0_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Agarwal, Pankaj K., Sariel Har-Peled, Nabil H. Mustafa, and Yusu Wang. "Near-Linear Time Approximation Algorithms for Curve Simplification." In Algorithms — ESA 2002. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45749-6_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Curve Approximation"

1

Nuntawisuttiwong, Taweechai, and Natasha Dejdumrong. "Approximating Handwritten Curve by Using Progressive-Iterative Approximation." In 2013 10th International Conference Computer Graphics, Imaging and Visualization (CGIV). IEEE, 2013. http://dx.doi.org/10.1109/cgiv.2013.15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Xia, J., and Q. J. Ge. "Approximating Polynomial Bézier Curves Using Harmonic Rational Bézier Curves." In ASME 1999 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1999. http://dx.doi.org/10.1115/detc99/dac-8655.

Full text
Abstract:
Abstract This paper deals with the problem of approximating polynomial Bézier curves with low-harmonic rational Bézier curves. It is shown that a polynomial Bézier curve is representable as a hybrid curve consisting of a low-harmonic curve with a moving control point. This hybrid representation leads directly to a low-harmonic approximation of a given polynomial curve. The approximation error is also analyzed. The result can be used to fine tune a polynomial trajectory for high-speed machinery to remove high harmonics from the trajectory.
APA, Harvard, Vancouver, ISO, and other styles
3

Fisher, John, John Lowther, and Ching-Kuang Shene. "Curve and surface interpolation and approximation." In the 9th annual SIGCSE conference. ACM Press, 2004. http://dx.doi.org/10.1145/1007996.1008036.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Galvez, Akemi, and Andres Iglesias. "Firefly Algorithm for Bezier Curve Approximation." In 2013 13th International Conference on Computational Science and Its Applications (ICCSA). IEEE, 2013. http://dx.doi.org/10.1109/iccsa.2013.21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Xiao, Yijun, Mingyue Ding, and Jiaxiong Peng. "Parametric curve approximation using ICP reparametrization." In Multispectral Image Processing and Pattern Recognition, edited by Yair Censor and Mingyue Ding. SPIE, 2001. http://dx.doi.org/10.1117/12.441590.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Jaroensawad, Rattikarn, Natasha Dejdumrong, and Somchai Prakancharoen. "Efficient Handwritten Curve Approximation by a Bezier Curve Using Chebyshev Polynomials." In 2013 10th International Conference Computer Graphics, Imaging and Visualization (CGIV). IEEE, 2013. http://dx.doi.org/10.1109/cgiv.2013.22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Peng Zhang, Esra Ataer-Cansizoglu, and Deniz Erdogmus. "Local linear approximation of principal curve projections." In 2012 IEEE International Workshop on Machine Learning for Signal Processing (MLSP). IEEE, 2012. http://dx.doi.org/10.1109/mlsp.2012.6349764.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Adi, Delint Ira Setyo, Siti Mariyam bt Shamsuddin, and Siti Zaiton Mohd Hashim. "NURBS Curve Approximation Using Particle Swarm Optimization." In 2010 Seventh International Conference on Computer Graphics, Imaging and Visualization (CGIV). IEEE, 2010. http://dx.doi.org/10.1109/cgiv.2010.19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Loucera, Carlos, Akemi Galvez, and Andres Iglesias. "Simulated Annealing Algorithm for Bezier Curve Approximation." In 2014 International Conference on Cyberworlds (CW). IEEE, 2014. http://dx.doi.org/10.1109/cw.2014.33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Goncharova, Marina, Alexei Uteshev, and Arthur Lazdin. "Evaluating Distance Approximation for Implicit Curve Fitting." In 2020 26th Conference of Open Innovations Association (FRUCT). IEEE, 2020. http://dx.doi.org/10.23919/fruct48808.2020.9087461.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Curve Approximation"

1

Jain, Anand. Neural ODEs for Light Curves Classifying and Approximating Light Curves. Office of Scientific and Technical Information (OSTI), 2019. http://dx.doi.org/10.2172/1614721.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography