Reconstructing Sets From Interpoint Distances

By Paul Lemke, Steven S. Skiena, Warren D. Smith. 2003

130 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design

View Paper: https://www.semanticscholar.org/paper/f92691899e5d59fce13aa47d24032b7cd93847f5

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. M. Schaefer

Citations in the corpus

• Realizability of Graphs and Linkages (2013, background): “The special case of the complete graph turns out to be efficiently solvable: Lemke, Skiena, and Smith sketch an algorithm that shows how to determine realizability of the complete graph and compute the coordinates of the points [29].”