Computing curve intersection by homotopy methods
DOI10.1016/j.cam.2011.05.015zbMath1252.65048OpenAlexW2066137834MaRDI QIDQ651931
Erbao Feng, Wenyu Hu, Zhong-xuan Luo
Publication date: 19 December 2011
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2011.05.015
numerical examplescomputational geometrygeometric modelingpolyhedral homotopycharacteristic pointcurve intersectionsurface intersectionlinear homotopy
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classification and resolution of critical cases in Grandine and Klein's topology determination using a perturbation method
- Numerical computation of polynomial zeros by means of Aberth's method
- Computing curve intersection by means of simultaneous iterations
- HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
- Improperly parametrized rational curves
- Eine Methode zur Berechnung sämtlicher Lösungen von Polynomgleichungssystemen
- Improved test for closed loops in surface intersections
- A new approach to the surface intersection problem
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Numerical stability of path tracing in polyhedral homotopy continuation methods
- Solving polynomial systems by polyhedral homotopies
- Linear perturbation methods for topologically consistent representations of free-form surface intersections
- A NEW APPROACH FOR SURFACE INTERSECTION
- Finding all solutions to polynomial systems and other systems of equations
- Algorithms for intersecting parametric and algebraic curves I
- Algorithm 795
This page was built for publication: Computing curve intersection by homotopy methods
