The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.

edmcr

An R package for Euclidean (squared) distance matrix completion (and determining point configurations based on the completed matrix.)

Description

Implements various general algorithms to estimate missing elements of a Euclidean (squared) distance matrix.
Includes optimization methods based on semi-definite programming, nonparametric position, and dissimilarity parameterization formulas.

When the only non-missing distances are those on the minimal spanning tree, the guided random search algorithm will complete the matrix while preserving the minimal spanning tree.

Point configurations in specified dimensions can be determined from the completions.

Special problems such as the sensor localization problem and reconstructing the geometry of a molecular structure can also be solved.

Online documentation: https://great-northern-diver.github.io/edmcr/

References

Other source code:

These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.