Subdivision termination criteria in subdivision multivariate solvers using dual hyperplanes representations

CAD Computer Aided Design

Volumn 39, Issue 5, 2007, Pages 369-378

  Hanniel, Iddo ^a   Elber, Gershon ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Non linear equations; Subdivision solvers; Termination criteria

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MULTIVARIANT ANALYSIS; PROBLEM SOLVING; SET THEORY;

SUBDIVISION SOLVERS; SUBDIVISION/DOMAIN CLIPPING PROPERTIES; TERMINATION CRITERIA;

NONLINEAR EQUATIONS;

EID: 34248150903     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cad.2007.02.004     Document Type: Article

References (18)

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. p. 1-10
2. Mourrain B, Pavone JP. Subdivision methods for solving polynomial equations. Tech. rep. INRIA Sophia-Antipolis; 2005
3. Sherbrooke E.C., and Patrikalakis N.M. Computation of the solutions of nonlinear polynomial systems. Computer Aided Geometric Design 10 5 (1993) 279-405
4. Elber G. The IRIT 9.5 user manual, http://www.cs.technion.ac.il/ irit; 2005
5. Lane J., and Riesenfeld R. Bounds on a polynomial. BIT Numerical Mathematics 21 (1981) 112-117
6. Eiger A., Sikorski K., and Stenger F. A bisection method for systems of nonlinear equations. ACM Transactions on Mathematical Software 10 4 (1984) 367-377
7. Mourrain B., Vrahatis M.N., and Yakoubsohn J.C. Complexity of isolating real roots and computing with certainty the topological degree. Journal of Complexity 18 (2002) 612-640
8. Sederberg T.W., and Meyers R.J. Loop detection in surface patch intersections. Computer Aided Geometric Design 5 2 (1988) 161-171
9. Sederberg T.W., and Zundel A.K. Pyramids that bound surface patches. Graphical Models and Image Processing 58 1 (1996) 75-81
10. Barequet G., and Elber G. Optimal bounding cones of vectors in three and higher dimensions. Information Processing Letters 93 (2005) 83-89
11. de Berg M., van Kreveld M., Overmars M., and Schwarzkopf O. Computational geometry, algorithms and applications. 2nd ed. (1998), Springer, New York
12. Golub G.H., and Loan C.F.V. Matrix computation. 3rd ed. (1996), The Johns Hopkins University Press, Baltimore, London
13. Weisstein EW. Gray code, from MathWorld - A wolfram web resource, http://mathworld.wolfram.com/GrayCode.html
14. Farin G.E. Curves and surfaces for computer aided geometric design: A practical guide. 4th ed. (1996), Academic Press
15. Akenine-Moeller T., and Haines E. Real-time rendering. 2nd ed. (2002), AK Peters
16. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to algorithms. 2nd ed. (2001), MIT Press, McGraw-Hill
17. Milne P.S. On the solutions of a set of polynomial equations. Symbolic and numerical computation for artificial intelligence (1992), Academic Press 89-102
18. Dennis J.E., and Schnabel R.B. Numerical methods for unconstrained optimization and nonlinear equations. Prentice hall series in computational mathematics (1983), Prentice Hall Inc.