A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
A Robust and Efficient Method for Solving Point Distance Problems by Homotopy
[article]
2016
arXiv
pre-print
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 (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
arXiv:1503.07901v3
fatcat:io3djeekajanxe7o4qpgzydtza