Datasmith: Tools to Complete Euclidean Distance Matrices

Implements several algorithms for Euclidean distance matrix completion, Sensor Network Localization, and sparse Euclidean distance matrix completion using the minimum spanning tree.

Getting started

Package details

AuthorAdam Rahman and Wayne Oldford <>
MaintainerAdam Rahman <>
LicenseGPL-2 | GPL-3
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the Datasmith package in your browser

Any scripts or data that you put into this service are public.

Datasmith documentation built on May 29, 2017, 10:19 p.m.