A robust and efficient method for solving point distance problems by homotopy

DOI10.1007/s10107-016-1058-7zbMath1372.65057arXiv1503.07901OpenAlexW2265336713MaRDI QIDQ526832

Pascal Mathis, Pascal Schreck, Rémi Imbach

Publication date: 15 May 2017

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.07901

zbMATH Keywords

reparameterizationsymbolic-numeric algorithmcurve trackingpoint distance solving problems

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Related Items (1)

Using jointly geometry and algebra to determine RC-constructibility

Uses Software

• HOM4PS

Cites Work

• Unnamed Item
• Interrogating witnesses for geometric constraint solving
• HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
• Subdivision methods for solving polynomial equations
• A new robust algorithm to trace curves
• An Interval Step Control for Continuation Methods
• Solving Real Polynomial Systems with Real Homotopies
• Certified Parallelotope Continuation for One-Manifolds
• A systematic framework for solving geometric constraints analytically

This page was built for publication: A robust and efficient method for solving point distance problems by homotopy