Subdivision algorithms converge quadratically
Journal of Computational and Applied Mathematics
On the numerical condition of polynomials in Berstein form
Computer Aided Geometric Design
Loop detection in surface patch intersections
Computer Aided Geometric Design
Ray tracing trimmed rational surface patches
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Computation of the solutions of nonlinear polynomial systems
Computer Aided Geometric Design
Polynomial real root finding in Bernstein form
Polynomial real root finding in Bernstein form
On the optimal stability of the Bernstein basis
Mathematics of Computation
Geometric constraint solver using multivariate rational spline functions
Proceedings of the sixth ACM symposium on Solid modeling and applications
Shape Interrogation for Computer Aided Design and Manufacturing
Shape Interrogation for Computer Aided Design and Manufacturing
Accurate display of tensor product isosurfaces
VIS '90 Proceedings of the 1st conference on Visualization '90
Almost tight recursion tree bounds for the Descartes method
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Real Algebraic Numbers: Complexity Analysis and Experimentation
Reliable Implementation of Real Number Algorithms: Theory and Practice
Continued fraction expansion of real roots of polynomial systems
Proceedings of the 2009 conference on Symbolic numeric computation
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
Theoretical Computer Science
Deflation and certified isolation of singular zeros of polynomial systems
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Linear programming for Bernstein based solvers
ADG'08 Proceedings of the 7th international conference on Automated deduction in geometry
GPU-based parallel solver via the Kantorovich theorem for the nonlinear Bernstein polynomial systems
Computers & Mathematics with Applications
A polynomial approach for maxima extraction and its application to tractography in HARDI
IPMI'11 Proceedings of the 22nd international conference on Information processing in medical imaging
A hybrid parallel solver for systems of multivariate polynomials using CPUs and GPUs
Computer-Aided Design
Bernstein Bezoutians and application to intersection problems
Computer Aided Geometric Design
Solving polynomial systems using no-root elimination blending schemes
Computer-Aided Design
Solving polynomial systems using no-root elimination blending schemes
Computer-Aided Design
Fat arcs for implicitly defined curves
MMCS'08 Proceedings of the 7th international conference on Mathematical Methods for Curves and Surfaces
GMP'10 Proceedings of the 6th international conference on Advances in Geometric Modeling and Processing
A subdivision approach to planar semi-algebraic sets
GMP'10 Proceedings of the 6th international conference on Advances in Geometric Modeling and Processing
Approximating algebraic space curves by circular arcs
Proceedings of the 7th international conference on Curves and Surfaces
Computer Aided Geometric Design
SMI 2012: Full Curve intersection using hybrid clipping
Computers and Graphics
The Bernstein polynomial basis: A centennial retrospective
Computer Aided Geometric Design
Yet another algorithm for generalized Voronoï Diagrams
Proceedings of the 27th Annual ACM Symposium on Applied Computing
A regularization method for computing approximate invariants of plane curves singularities
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Maximum Block Improvement and Polynomial Optimization
SIAM Journal on Optimization
Technical note: Voronoi diagrams of algebraic distance fields
Computer-Aided Design
Computing real solutions of polynomial systems via low-rank moment matrix completion
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
A regularization approach for estimating the type of a plane curve singularity
Theoretical Computer Science
Coordinate-free geometry and decomposition in geometrical constraint solving
Computer-Aided Design
| Hi-index | 0.00 |
This paper presents a new algorithm for solving a system of polynomials, in a domain of R^n. It can be seen as an improvement of the Interval Projected Polyhedron algorithm proposed by Sherbrooke and Patrikalakis [Sherbrooke, E.C., Patrikalakis, N.M., 1993. Computation of the solutions of nonlinear polynomial systems. Comput. Aided Geom. Design 10 (5), 379-405]. It uses a powerful reduction strategy based on univariate root finder using Bernstein basis representation and Descarte's rule. We analyse the behavior of the method, from a theoretical point of view, shows that for simple roots, it has a local quadratic convergence speed and gives new bounds for the complexity of approximating real roots in a box of R^n. The improvement of our approach, compared with classical subdivision methods, is illustrated on geometric modeling applications such as computing intersection points of implicit curves, self-intersection points of rational curves, and on the classical parallel robot benchmark problem.