Parametrization of approximate algebraic curves by lines

Theoretical Computer Science

Volumn 315, Issue 2-3, 2004, Pages 627-650

  Pérez Díaz, Sonia ^a   Sendra, Juana ^b   Sendra, J Rafael ^a  

^a UNIVERSITY OF ALCALÁ   (Spain)

^b UNIVERSIDAD CARLOS III DE MADRID   (Spain)

Author keywords

Approximate algebraic curves; Hibrid symbolic numeric methods; Rational parametrization

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CURVE FITTING; NUMERICAL METHODS; THEOREM PROVING; VECTORS;

APPROXIMATE ALGEBRAIC CURVES; HIBRID SYMBOLIC-NUMERIC METHODS; RATIONAL PARAMETRIZATION;

POLYNOMIAL APPROXIMATION;

EID: 18844466453     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.01.010     Document Type: Article

References (36)

1. Abhyankar S., Bajaj C. Automatic parametrization of rational curves and surfaces III. algebraic plane curves Comput. Aided Geom. Des. 5:1988;321-390.
2. Arrondo E., Sendra J., Sendra J.R. Parametric generalized offsets to hypersurfaces. J. Simbolic Comput. 23:1997;267-285.
3. Bajaj C., Hoffmann C.M., Hopcroft J.E., Lynch R.E. Tracing surface intersections. Comput. Aided Geom. Des. 5:1988;285-307.
4. Bajaj C., Royappa A. Parameterization in finite precision. Algorithmica. 27(1):2000;100-114.
5. Bajaj C., Xu G. Piecewise approximations of real algebraic curves. J. Comput. Math. 15(1):1997;55-71.
6. Beckermann B., Labahn G. When are two polynomials relatively prime? J. Symbolic Comput. 26:1998;677-689.
7. Bulirsch R., Stoer J. Introduction to Numerical Analysis. 1993;Springer, New York.
8. J. Canny, The complexity of robot motion planning, ACM Doctoral Dissertation Award, The MIT Press, Cambridge, MA, 1987.
9. R.M. Corless, P.M. Gianni, B.M. Trager, S.M. Watt, The singular value decomposition for polynomial systems, Proceedings of the ISSAC 1995, ACM Press, New York, 1995, pp. 195-207.
10. R.M. Corless, M.W. Giesbrecht, D.J. Jeffrey, S.M. Watt, Approximate polynomial decomposition, in: S.S. Dooley (Ed.), Proceedings of the ISSAC 1999, Vancouver, Canada, ACM Press, New York, 1999, pp. 213-220.
11. R.M. Corless, M.W. Giesbrecht, I.S. Kotsireas, M. van Hoeij, S.M. Watt, Towards factoring bivariate approximate polynomials, Proceedings of the ISSAC 2001, Bernard Mourrain, London, 2001, pp. 85-92.
12. R.M. Corless, M.W. Giesbrecht, I. Kotsireas, S.M. Watt, Numerical implicitization of parametric hypersurfaces with linear algebra. Proceedings of the Artificial Intelligence with Symbolic Computation (AISC 2000), Lecture Notes in Artifical Intelligence, Springer, Berlin, 1930, pp. 174-183.
13. Demmel J., Manocha D. Algorithms for intersecting parametric and algebraic curves II. multiple intersections Graphical Models and Image Processing: GMIP. 57(2):1995;81-100.
14. T. Dokken, Approximate implicitization, in: T. Lyche, L.L. Schumakes (Eds.), Mathematical Methods for Curves and Surfaces in GAGD, Oslo 2000, Innovations in Applied Mathematical Series, Vanderbilt University Press, 2001, pp. 81-102.
15. Emiris I.Z., Galligo A., Lombardi H. Certified approximate univariate GCDs. J. Pure Appl. Algebra. 117 and 118:1997;229-251.
16. I.Z. Emiris, Pan, Y. Victor, Symbolic and numeric methods for exploiting structure in constructing resultant matrices, J. Symbolic Comput. 33(4) 2002 393-413.
17. Farouki R.T., Rajan V.T. On the numerical condition of algebraic curves and surfaces. 1. Implicit equations Comput. Aided Geom. Des. 5:1988;215-252.
18. Fortune, Polynomial root-finding using iterated eigenvalue computation, Proceedings of the ISSAC 2001, ACM Press, New York, pp. 121-128.
19. J. Gahleitner, B. Jüttler, J. Schicho, Approximate parameterization of planar cubic curve segments, Proceedings of the Fifth International Conference on Curves and Surfaces, Saint-Malo, 2002, Nashboro Press, Nashville, TN, 2002, pp. 1-13.
20. Galligo A., Rupprech D. Irreducible decomposition of curves. J. Symbolic Comput. 33:2002;661-677.
21. A. Galligo, S.M. Watt, in: W. Kuchlin (Ed.), A Numerical Absolute Primality test for Bivariate Polynomials, ISSAC 1997, Maui, USA, ACM, New York, 1997, pp. 217-224.
22. Golub G.H., Van Loan C.F. Matrix Computations. 1989;The Johns Hopkins University Press, Baltimore and London.
23. Hartmann E. Numerical parameterization of curves and surfaces. Comput. Aided Geom. Des. 17:2000;251-266.
24. M. van Hoeij, Computing parametrizations of rational algebraic curves, in: J. von zur Gathen (Ed.), Proceedings of the ISSAC94, ACM Press, New York, pp. 187-190.
25. van Hoeij M. Rational parametrizations of curves using canonical divisors. J. Symbolic Comput. 23:1997;209-227.
26. Hoffmann C.M. Geometric and Solid Modeling. 1993;Morgan Kaufmann Publ., Inc. Los Altos, CA.
27. Krishnan S., Manocha D. Solving algebraic systems using matrix computations. Sigsam Bull. ACM. 30(4):1996;4-21.
28. Möller H.M. Gröbner bases and numerical analysis. Buchberger B., Winkler F. Gröbner Bases and Applications. Lecture Notes in Statistics. Vol. 251:1998;159-178 Springer, Berlin.
29. V.Y. Pan, Numerical computation of a polynomial GCD and extensions, Tech. report, N. 2969, Sophia-Antipolis, France, 1996.
30. V.Y. Pan, Univariate polynomials: nearly optimal algorithms for factorization and rootfinding, ISSAC 2001, London, Ont., Canada, ACM Press, New York, NY, USA, 2001, pp. 253-267.
31. T. Sasaki, Approximate multivariate polynomial factorization based on zero-sum relations, Proceedings of the ISSAC 2001, ACM Press, New York, NY, USA, 2001, pp. 284-291.
32. Schicho J. Rational parametrization of surfaces. J. Symbolic Comput. 26:1998;1-9.
33. Sendra J.R., Winkler F. Symbolic parametrization of curves. J. Symbolic Comput. 12:1991;607-631.
34. Sendra J.R., Winkler F. Parametrization of algebraic curves over optimal field extension. J. Symbolic Comput. 23:1997;191-207.
35. Sendra J.R., Winkler F. Algorithms for rational real algebraic curves. Fund. Inform. 39:1999;211-228.
36. H. Stetter, Stabilization of polynomial systems solving with Groebner bases, Proceedings of ISSAC 97, 1997, pp. 117-124.