Subdivision Termination Criteria in Subdivision Multivariate Solvers

  • Iddo Hanniel
  • Gershon Elber
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4077)


The need for robust solutions for sets of non-linear multivariate constraints or equations needs no motivation. Subdivision-based multivariate constraint solvers [1, 2, 3] typically employ the convex hull and subdivision/domain clipping properties of the Bézier/B-spline representation to detect all regions that may contain a feasible solution. Once such a region has been identified, a numerical improvement method is usually applied, which quickly converges to the root. Termination criteria for this subdivision/domain clipping approach are necessary so that, for example, no two roots reside in the same sub-domain (root isolation).

This work presents two such termination criteria. The first theoretical criterion identifies sub-domains with at most a single solution. This criterion is based on the analysis of the normal cones of the multiviarates and has been known for some time [1]. Yet, a computationally tractable algorithm to examine this criterion has never been proposed. In this paper, we present such an algorithm for identifying sub-domains with at most a single solution that is based on a dual representation of the normal cones as parallel hyper-planes over the unit hyper-sphere. Further, we also offer a second termination criterion, based on the representation of bounding parallel hyper-plane pairs, to identify and reject sub-domains that contain no solution.

We implemented both algorithms in the multivariate solver of the IRIT [4] solid modeling system and present examples using our implementation.


Dual Representation Normal Cone Single Solution Geometric Design Tangent Cone 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Elber, G., Kim, M.-S.: Geometric constraint solver using multivariate rational spline functions. In: Proceedings of the Symposium on Solid Modeling and Applications 2001, Ann Arbor, Michigan, pp. 1–10 (2001)Google Scholar
  2. 2.
    Mourrain, B., Pavone, J.P.: Subdivision methods for solving polynomial equations. Technical report, INRIA Sophia-Antipolis (2005)Google Scholar
  3. 3.
    Sherbrooke, E.C., Patrikalakis, N.M.: Computation of the solutions of nonlinear polynomial systems. Computer Aided Geometric Design 10(5), 279–405 (1993)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Elber, G.: The IRIT 9.5 User Manual (2005),
  5. 5.
    Lane, J., Riesenfeld, R.: Bounds on a polynomial. BIT 21, 112–117 (1981)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Sederberg, T.W., Meyers, R.J.: Loop detection in surface patch intersections. Computer Aided Geometric Design 5(2), 161–171 (1988)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Sederberg, T.W., Zundel, A.K.: Pyramids that bound surface patches. Graphical Models and Image Processing 58(1), 75–81 (1996)CrossRefGoogle Scholar
  8. 8.
    Barequet, G., Elber, G.: Optimal bounding cones of vectors in three and higher dimensions. Information Processing Letters 93, 83–89 (2005)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry, Algorithms and Applications, 2nd edn. Springer, New York (1998)Google Scholar
  10. 10.
    Golub, G.H., Loan, C.F.V.: Matrix Computation, 3rd edn. The Johns Hopkins University Press, Baltimore (1996)Google Scholar
  11. 11.
    Weisstein, E.W.: (Gray code) From MathWorld — A Wolfram Web Resource,
  12. 12.
    Farin, G.E.: Curves and Surfaces for Computer Aided Geometric Design: A Practical Guide, 4th edn. Academic Press, London (1996)Google Scholar
  13. 13.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill (2001)Google Scholar
  14. 14.
    Milne, P.S.: On the solutions of a set of polynomial equations. In: Symbolic and Numerical Computation for Artificial Intelligence, pp. 89–102. Academic Press, London (1992)Google Scholar
  15. 15.
    Dennis, J.E., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice Hall Series in Computational Mathematics. Prentice Hall Inc., Englewood Cliffs (1983)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Iddo Hanniel
    • 1
  • Gershon Elber
    • 1
  1. 1.Department of Computer ScienceTechnion, Israel Institute of TechnologyHaifaIsrael

Personalised recommendations