Results 1 -
1 of
1
Reconstructing Sets From Interpoint Distances
- of Algorithms Combin
, 2002
"... Which point sets realize a given distance multiset? Interesting cases include the "turnpike problem" where the points lie on a line, the "beltway problem" where the points lie on a loop, and multidimensional versions. We are interested both in the algorithmic problem of determining such point sets f ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
Which point sets realize a given distance multiset? Interesting cases include the "turnpike problem" where the points lie on a line, the "beltway problem" where the points lie on a loop, and multidimensional versions. We are interested both in the algorithmic problem of determining such point sets for a given collection of distances and the combinatorial problem of finding bounds on the maximum number of different solutions. These problems have applications in genetics and crystallography.
