HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

A Robust and Efficient Method for Solving Point Distance Problems by Homotopy

Abstract : The goal of Point Distance Solving Problems is to find 2D or 3D placements of points knowing distances between some pairs of points. The common guideline is to solve them by a numerical iterative method (\emph{e.g.} Newton-Raphson method). A sole solution is obtained whereas many exist. However the number of solutions can be exponential and methods should provide solutions close to a sketch drawn by the user. Geometric reasoning can help to simplify the underlying system of equations by changing a few equations and triangularizing it. This triangularization is a geometric construction of solutions, called construction plan. We aim at finding several solutions close to the sketch on a one-dimensional path defined by a global parameter-homotopy using a construction plan. Some numerical instabilities may be encountered due to specific geometric configurations. We address this problem by changing on-the-fly the construction plan. Numerical results show that this hybrid method is efficient and robust.
Complete list of metadata

Contributor : Rémi Imbach Connect in order to contact the contributor
Submitted on : Monday, July 25, 2016 - 5:12:01 PM
Last modification on : Wednesday, December 1, 2021 - 3:32:11 PM


Files produced by the author(s)


  • HAL Id : hal-01135230, version 3
  • ARXIV : 1503.07901


Rémi Imbach, Pascal Mathis, Pascal Schreck. A Robust and Efficient Method for Solving Point Distance Problems by Homotopy. [Research Report] RR-8705, INRIA. 2016. ⟨hal-01135230v3⟩



Record views


Files downloads