Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Mourrain, B., Pavone, J.P.: Subdivision methods for solving polynomial equations. Technical report, INRIA Sophia-Antipolis (2005)
Sherbrooke, E.C., Patrikalakis, N.M.: Computation of the solutions of nonlinear polynomial systems. Computer Aided Geometric Design 10(5), 279–405 (1993)
Elber, G.: The IRIT 9.5 User Manual (2005), http://www.cs.technion.ac.il/~irit
Lane, J., Riesenfeld, R.: Bounds on a polynomial. BIT 21, 112–117 (1981)
Sederberg, T.W., Meyers, R.J.: Loop detection in surface patch intersections. Computer Aided Geometric Design 5(2), 161–171 (1988)
Sederberg, T.W., Zundel, A.K.: Pyramids that bound surface patches. Graphical Models and Image Processing 58(1), 75–81 (1996)
Barequet, G., Elber, G.: Optimal bounding cones of vectors in three and higher dimensions. Information Processing Letters 93, 83–89 (2005)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry, Algorithms and Applications, 2nd edn. Springer, New York (1998)
Golub, G.H., Loan, C.F.V.: Matrix Computation, 3rd edn. The Johns Hopkins University Press, Baltimore (1996)
Weisstein, E.W.: (Gray code) From MathWorld — A Wolfram Web Resource, http://mathworld.wolfram.com/GrayCode.html
Farin, G.E.: Curves and Surfaces for Computer Aided Geometric Design: A Practical Guide, 4th edn. Academic Press, London (1996)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill (2001)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hanniel, I., Elber, G. (2006). Subdivision Termination Criteria in Subdivision Multivariate Solvers. In: Kim, MS., Shimada, K. (eds) Geometric Modeling and Processing - GMP 2006. GMP 2006. Lecture Notes in Computer Science, vol 4077. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11802914_9
Download citation
DOI: https://doi.org/10.1007/11802914_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36711-6
Online ISBN: 978-3-540-36865-6
eBook Packages: Computer ScienceComputer Science (R0)