Skip to main content
Log in

Topologically Correct Intersection Curves of Two Trimmed Quadrics with Tolerance Control

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

Surface/surface intersection is a fundamental problem in Compute Aided Design and Geometric Modeling since it is essential to solid modeling, numerically controlled machining, feature recognition, computer animation, etc. In practical applications, quadric surfaces, which are the most basic type of surfaces, are typically bounded surfaces trimmed by a sequence of planes. In this paper, a robust algorithm is proposed for computing the intersection curve segments of two trimmed quadrics based on the parametric representation of the intersection curves of two quadrics. The proposed algorithm guarantees correct topology and ensures that the approximation errors of the end points of the intersection curve segments are less than a given tolerance. The error control is based on an effective solution to a set of polynomial inequality system using the root isolation technique. Some examples are presented to validate the robustness and effectiveness of the proposed algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Hoschek J and Lasser D, Fundamentals of Computer Aided Geometric Design, AK Peters, Ltd., 1993.

    Google Scholar 

  2. Patrikalakis N M, Surface-to-surface intersections, IEEE Computer Graphics and Applications, 1993, 13(1): 89–95.

    Article  Google Scholar 

  3. Requicha A A G and Voelcker H B, Boolean operations in solid modeling: Boundary evaluation and merging algorithms, Proceedings of the IEEE, 1985, 73(1): 30–44.

    Article  Google Scholar 

  4. Sunil V B and Pande S S, Automatic recognition of features from freeform surface CAD models, Computer-Aided Design, 2008, 40(4): 502–517.

    Article  Google Scholar 

  5. Lo S H, Automatic mesh generation over intersecting surfaces, International Journal for Numerical Methods in Engineering, 1995, 38(6): 943–954.

    Article  MathSciNet  Google Scholar 

  6. Bénard P, Hertzmann A, and Kass M, Computing smooth surface contours with accurate topology, ACM Transactions on Graphics, 2014, 33(2): 1–21.

    Article  Google Scholar 

  7. Badia S, Martorell P A, and Verdugo F, Geometrical discretisations for unfitted finite elements on explicit boundary representations, Journal of Computational Physics, 2022, 460: 111162.

    Article  MathSciNet  Google Scholar 

  8. Desbrun M and Cani M P, Active implicit surface for animation, Proceedings of the Graphics Interface 1998 Conference, Vancouver, BC, Canada, 1998, 143–150.

    Google Scholar 

  9. Mihaluta M, Martin P, and Dantan J Y, Manufacturing process modeling and simulation, Proceedings of the 6th CIRP International Conference on Intelligent Computation in Manufacturing Engineering, CIRP ICME’ 08, Naples, Italy, 2008, 7.

    Google Scholar 

  10. Bajaj C, Garrity T, and Warren J, On the applications of multi-equational resultants, Technical Report CSD-TR-826, Purdue University, 1988.

    Google Scholar 

  11. Chandru V and Kochar B S, Analytic techniques for geometric intersection problems, Geometric Modeling: Algorithms and New Trends, SIAM, 1987, 305–318.

    Google Scholar 

  12. Farouki R T, Trimmed-surface algorithms for the evaluation and interrogation of solid boundary representations, IBM Journal of Research and Development, 1987, 31(3): 314–334.

    Article  Google Scholar 

  13. Houghton E G, Emnett R F, Factor J D, et al., Implementation of a divide-and-conquer method for intersection of parametric surfaces, Computer Aided Geometric Design, 1985, 2(1–3): 173–183.

    Article  Google Scholar 

  14. Dokken T, Finding intersections of B-spline represented geometries using recursive subdivision techniques, Computer Aided Geometric Design, 1985, 2(1–3): 189–195.

    Article  Google Scholar 

  15. Chen J J and Ozsoy T M, An intersection algorithm for C2 parametric surfaces, Knowledge Engineering and Computer Modelling, 1986, 69–77.

    Chapter  Google Scholar 

  16. Asteasu C and Orbegozo A, Parametric piecewise surfaces intersection, Computers & Graphics, 1991, 15(1): 9–13.

    Article  Google Scholar 

  17. Lukács G, The generalized inverse matrix and the surface-surface intersection problem, Theory and Practice of Geometric Modeling, Springer, Berlin, Heidelberg, 1989, 167–185.

    Chapter  Google Scholar 

  18. Barnhill R E, Farin G, Jordan M, et al., Surface/surface intersection, Computer Aided Geometric Design, 1987, 4(1–2): 3–16.

    Article  MathSciNet  Google Scholar 

  19. Hall C A and Meyer W W, Optimal error bounds for cubic spline interpolation, Journal of Approximation Theory, 1976, 16(2): 105–122.

    Article  MathSciNet  Google Scholar 

  20. Fioravanti M, Gonzalez-Vega L, and Necula I, Computing the intersection of two ruled surfaces by using a new algebraic approach, Journal of Symbolic Computation, 2006, 41(11): 1187–1205.

    Article  MathSciNet  Google Scholar 

  21. Jinyuan J I A, Baciu G, and Kwok K W, Quadric decomposition for computing the intersections of surfaces of revolution, Graphical Models, 2004, 66(5): 303–330.

    Article  Google Scholar 

  22. Wilf I and Manor Y, Quadric-surface intersection curves: shape and structure, Computer-Aided Design, 1993, 25(10): 633–643.

    Article  Google Scholar 

  23. Levin J Z, Mathematical models for determining the intersections of quadric surfaces, Computer Graphics and Image Processing, 1979, 11(1): 73–87.

    Article  Google Scholar 

  24. Tu, C H, Wang W P, Mourrain B, et al., Using signature sequences to classify intersection curves of two quadrics, Computer Aided Geometric Design, 2009, 26(3): 317–335.

    Article  MathSciNet  Google Scholar 

  25. Goldman R and Miller J R, Combining algebraic rigor with geometric robustness for the detection and calculation of conic sections in the intersection of two natural quadric surfaces, Proceedings of the ACM Symposium on Solid Modeling Foundations and CAD/CAM Applications, Austin, Texas, USA, 1991, 221–231.

    Chapter  Google Scholar 

  26. Shene C K and Johnstone J K, On the lower degree intersections of two natural quadrics, ACM Transactions on Graphics, 1994, 13(4): 400–424.

    Article  Google Scholar 

  27. Miller J R and Goldman R N, Using tangent balls to find plane sections of natural quadrics, IEEE Computer Graphics and Applications, 1992, 12(2): 68–82.

    Article  Google Scholar 

  28. Johnstone J K and Shene C K, Computing the intersection of a plane and a natural quadric, Computers & Graphics, 1992, 16(2): 179–186.

    Article  Google Scholar 

  29. Miller J R, Geometric approaches to nonplanar quadric surface intersection curves, ACM Transactions on Graphics, 1987, 6(4): 274–307.

    Article  Google Scholar 

  30. Piegl L, Geometric method of intersecting natural quadrics represented in trimmed surface form, Computer-Aided Design, 1989, 21(4): 201–212.

    Article  Google Scholar 

  31. O’Connor M A, Natural quadrics: Projections and intersections, IBM Journal of Research and Development, 1989, 33(4): 417–446.

    Article  MathSciNet  Google Scholar 

  32. Miller J R and Goldman R N, Geometric algorithms for detecting and calculating all conic sections in the intersection of any 2 natural quadric surfaces, Graphical Models and Image Processing, 1995, 57(1): 55–66.

    Article  Google Scholar 

  33. Shene C K and Johnstone J K, On the planar intersection of natural quadrics, Proceedings of the First ACM Symposium on Solid Modeling Foundations and CAD/CAM Applications, 1991, 233–242.

    Chapter  Google Scholar 

  34. Bromwich T J I A, Quadratic Forms and Their Classification by Means of Invariant-Factors, Cambridge Tracts in Mathematics and Mathematical Physics, Cambridge, 1906.

    Google Scholar 

  35. Wilhelm K, Der Flächenbüschel Zweiter Ordnung, Schade, Berlin, 1872.

    Google Scholar 

  36. Otto S, Flächen 2, Ordnung und ihre Systeme und Durchdringungskurven, Eds. by Meyer W F and Mohrmann H, Geometrie, Vieweg+Teubner Verlag, Wiesbaden, 1921.

    Google Scholar 

  37. Tu C H, Wang W P, and Wang J Y, Classifying the nonsingular intersection curve of two quadric surfaces, Geometric Modeling and Processing, Theory and Applications, GMP 2002 Proceedings, 2002, 23–32.

    Google Scholar 

  38. Chan K, A simple mathematical approach for determining intersection of quadratic surfaces, Multiscale Optimization Methods and Applications, Springer, New York, 2006, 271–298.

    Chapter  Google Scholar 

  39. Tu C H, Wang W P, Bernard M, et al., Signature sequence of intersection curve of two quadrics for exact morphological classification, Technique Reports of Department of Computer Science, Hong Kong University, Hong Kong, 2005.

    Google Scholar 

  40. Dupont L, Lazard D, Lazard S, et al., Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils, Journal of Symbolic Computation, 2008, 43(3): 192–215.

    Article  MathSciNet  Google Scholar 

  41. Geismann N, Hemmer M, and Schömer E, Computing a 3-dimensional cell in an arrangement of quadrics: Exactly and Actually!, Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001, 264–273.

    Chapter  Google Scholar 

  42. Berberich E, Hemmer M, Kettner L, et al., An exact, complete and efficient implementation for computing planar maps of quadric intersection curves, Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, 2005, 99–106.

    Google Scholar 

  43. Schömer E and Wolpert N, An exact and efficient approach for computing a cell in an arrangement of quadrics, Computational Geometry, 2006, 33(1–2): 65–97.

    Article  MathSciNet  Google Scholar 

  44. Gonzalez-Vega L and Trocado A, Tools for analyzing the intersection curve between two quadrics through projection and lifting, Journal of Computational and Applied Mathematics, 2021, 393: 113522.

    Article  MathSciNet  Google Scholar 

  45. Wang W P, Joe B, and Goldman R, Computing quadric surface intersections based on an analysis of plane cubic curves, Graphical Models, 2002, 64(6): 335–367.

    Article  Google Scholar 

  46. Levin J, A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces, Communications of the ACM, 1976, 19(10): 555–563.

    Article  MathSciNet  Google Scholar 

  47. Dupont L, Lazard D, Lazard S, et al., Near-optimal parameterization of the intersection of quadrics: I. The generic algorithm, Journal of Symbolic Computation, 2008, 43(3): 168–191.

    Article  MathSciNet  Google Scholar 

  48. Sarraga R F, Algebraic methods for intersections of quadric surfaces in GMSOLID, Computer Vision, Graphics, and Image Processing, 1983, 22(2): 222–238.

    Article  Google Scholar 

  49. Farouki R T, Neff C, and O’Conner M A, Automatic parsing of degenerate quadric-surface intersections, ACM Transactions on Graphics, 1989, 8(3): 174–203.

    Article  Google Scholar 

  50. Wang, W P, Goldman R, and Tu C H, Enhancing Levin’s method for computing quadric-surface intersections, Computer Aided Geometric Design, 2003, 20(7): 401–422.

    Article  MathSciNet  Google Scholar 

  51. Dupont L, Lazard D, Lazard S, et al., Near-optimal parameterization of the intersection of quadrics: III. Parameterizing singular intersections, Journal of Symbolic Computation, 2008, 43(3): 216–232.

    Article  MathSciNet  Google Scholar 

  52. Lazard S, Peñaranda L M, and Petitjean S, Intersecting quadrics: An efficient and exact implementation, Computational Geometry, 2006, 35(1–2): 74–99.

    Article  MathSciNet  Google Scholar 

  53. Rouillier F and Zimmermann P, Efficient isolation of polynomial’s real roots, Journal of Computational and Applied Mathematics, 2004, 162(1): 33–50.

    Article  MathSciNet  Google Scholar 

  54. Collins G E and Akritas A G, Polynomial real root isolation using Descarte’s rule of signs, Proceedings of the Third ACM Symposium on Symbolic and Algebraic Computation, 1976, 272–275.

    Chapter  Google Scholar 

  55. Collins G E and Loos R, Real zeros of polynomials, Computer Algebra, 1983, 4: 83–94.

    Article  MathSciNet  Google Scholar 

  56. Basu, S, Pollack R, and Roy M F, Algorithms in Real Algebraic Geometry, Springer, Berlin, 2006.

    Book  Google Scholar 

  57. González-Vega L, Recio T, and Lombardi H, et al., Sturm-Habicht Sequences, Determinants and Real Roots of Univariate Polynomials, Eds. by Elimination Q and Decomposition C A, Springer, Vienna, 1998.

    Chapter  Google Scholar 

  58. Chen X D, Xu G, and Wang Y G, Computing the singular intersection curves between two quadric surfaces, Journal of Computer-Aided Design & Computer Graphics, 2009, 21(8): 1066–1073.

    Google Scholar 

  59. Michael H, Towards the Three-Dimensional Arrangement of Quadrics: An Exact Parametric Approach, LAP LAMBERT Academic Publishing, Saarbrucken, 2010.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Falai Chen.

Ethics declarations

The authors declare no conflict of interest.

Additional information

This research was supported in part by the National Natural Science Foundation of China under Grant No. 61972368.

This paper was recommended for publication by Editor LEI Na.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shao, W., Chen, F. Topologically Correct Intersection Curves of Two Trimmed Quadrics with Tolerance Control. J Syst Sci Complex 37, 2207–2239 (2024). https://doi.org/10.1007/s11424-024-2519-3

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-024-2519-3

Keywords