A predictor–corrector-type technique for the approximate parameterization of intersection curves

Article
First Online:
Received:
Revised:

Abstract

We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial solution, the method applies predictor and corrector steps in order to obtain the result. Based on a preconditioning of the two given surfaces, the corrector step is formulated as an optimization problem, where the objective function approximates the integral of the squared Euclidean distance of the curve to the intersection curve. An SQP-type method is used to solve the optimization problem numerically. Two different predictor steps, which are based on simple extrapolation and on a differential equation, are formulated. Error bounds are needed in order to certify the accuracy of the result. In the case of the intersection of two algebraic surfaces, we show how to bound the Hausdorff distance between the intersection curve (an algebraic space curve) and its rational approximation.

Keywords

Singular Point Control Point Hausdorff Distance Algebraic Curf Rational Curf 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aigner, M., Szilágyi, I., Jüttler, B., Schicho, J.: Implicitization and distance bounds. In: Mourrain, B., Elkadi, M., Piene, R., (eds) Algebraic Geometry and Geometric Modelling. Springer, Berlin Heidelberg New York, pp. 71–86 (2006)Google Scholar
  2. 2.
    Alcazar, J.G., Schicho, J., Sendra, J.R.: Computation of the topological types of the level curves of an algebraic surface (2005, submitted)Google Scholar
  3. 3.
    Alcazar J.G. and Sendra J.R. (2005). Computation of the topology of real algebraic space, curves. J. Symb. Comp. 39(6): 719–744 CrossRefMathSciNetGoogle Scholar
  4. 4.
    Aruliah, D.A., Corless, R.M.: Numerical parameterization of affine varieties using ODEs. In: Gutierrez, J. (ed.) Proceedings of ISSAC. ACM Press, New York pp. 12–18 (2004)Google Scholar
  5. 5.
    Bajaj C.L. and Royappa A.V. (2000). Parameterization in finite precision. Algorithmica 27(1): 100–114 CrossRefMathSciNetGoogle Scholar
  6. 6.
    Bajaj C.L. and Xu G.L. (1997). Piecewise rational approximations of real algebraic curves. J. Comput. Math. 15(1): 55–71 MathSciNetGoogle Scholar
  7. 7.
    Berry, T.G.: Parameterization of algebraic space curves. J. Pure Appl. Algebra 117–118, 81–95 (1997)Google Scholar
  8. 8.
    Gao, X.-S., Li, M.: Rational quadratic approximation to real algebraic curves, Comput. Aided Geom. Des. 21(8), 805–828 (2004)Google Scholar
  9. 9.
    Gatellier, G., Labrouzy, A., Mourrain, B., Técourt, J.P.: Computing the topology of three-dimensional algebraic curves. In: Dokken, T., Jüttler, B., (eds.) Computational Methods for Algebraic Spline Surfaces, pp. 27–43 Springer, Berlin Heidelberg New York (2005)Google Scholar
  10. 10.
    Hartmann E. (2000). Numerical parameterization of curves and surfaces. Comput. Aided Geom. Des. 17(3): 251–266 CrossRefMathSciNetGoogle Scholar
  11. 11.
    Hartshorne. R. (1983). Algebraic geometry. Springer, Berlin Heidelberg New York MATHGoogle Scholar
  12. 12.
    Hoschek J. and Lasser. D. (1993). Fundamentals of computer aided geometric design. A.K. Peters, Wellesley MATHGoogle Scholar
  13. 13.
    Patrikalakis, N.M., Maekawa, T.: Chapter 25: intersection problems. In: Farin, G., Hoschek, J., Kim, M.-S., (eds.) Handbook of Computer Aided Geometric Design. Elsevier Amsterdam (2002)Google Scholar
  14. 14.
    Sampson P.D. (1982). Fitting conic sections to very scattered data: an iterative refinement of the Bookstein algorithm. Comput. Graph. Image Process. 18: 97–108 CrossRefGoogle Scholar
  15. 15.
    Schicho J. (1992). On the choice of pencils in the parametrization of curves. J. Symb. Comp. 14(6): 557–576 MathSciNetGoogle Scholar
  16. 16.
    Sendra J.R. (2002). Normal parametrizations of algebraic plane curves. J. Symb. Comp. 33(6): 863–885 CrossRefMathSciNetGoogle Scholar
  17. 17.
    Sendra J.R. and Winkler F. (1997). Parametrization of algebraic curves over optimal field extensions. J. Symb. Comp. 23(2/3): 191–208 CrossRefMathSciNetGoogle Scholar
  18. 18.
    Sendra J.R. and Winkler F. (2001). Tracing index of rational curve parametrizations. Comp. Aided Geom. Des. 18: 771–795 CrossRefMathSciNetGoogle Scholar
  19. 19.
    Stoer, J., Bulirsch, R.: Numerical mathematics, vol. 2, 5th edn. Springer, Berlin Heidelberg New York (2005)Google Scholar
  20. 20.
    Wang W., Joe B. and Goldman R. (2002). Computing quadric surface intersections based on an analysis of plane cubic curves.. Graph Models 64(6): 335–367 CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2006

Authors and Affiliations

  1. 1.Institute of Applied GeometryJohannes Kepler UniversityLinzAustria
  2. 2.Katedra algebrygeometrie a didaktiky matematiky FMFI UKBratislavaSlovakia

Personalised recommendations