%AGkioulekas, Ioannis%AGortler, Steven%ATheran, Louis%AZickler, Todd%BJournal Name: Discrete & Computational Geometry; Journal Volume: 71; Journal Issue: 2; Related Information: CHORUS Timestamp: 2024-02-03 23:03:42
%D2023%ISpringer Science + Business Media
%JJournal Name: Discrete & Computational Geometry; Journal Volume: 71; Journal Issue: 2; Related Information: CHORUS Timestamp: 2024-02-03 23:03:42
%K
%MOSTI ID: 10475617
%PMedium: X; Size: p. 399-441
%TTrilateration Using Unlabeled Path or Loop Lengths
%XAbstract
Let$$\textbf{p}$$$p$be a configuration ofnpoints in$$\mathbb R^d$$${R}^{d}$for somenand some$$d \ge 2$$$d\ge 2$. Each pair of points defines an edge, which has a Euclidean length in the configuration. A path is an ordered sequence of the points, and a loop is a path that begins and ends at the same point. A path or loop, as a sequence of edges, also has a Euclidean length, which is simply the sum of its Euclidean edge lengths. We are interested in reconstructing$$\textbf{p}$$$p$given a set of edge, path and loop lengths. In particular, we consider the unlabeled setting where the lengths are given simply as a set of real numbers, and are not labeled with the combinatorial data describing which paths or loops gave rise to these lengths. In this paper, we study the question of when$$\textbf{p}$$$p$will be uniquely determined (up to an unknowable Euclidean transform) from some given set of path or loop lengths through an exhaustive trilateration process. Such a process has already been used for the simpler problem of reconstruction using unlabeled edge lengths. This paper also provides a complete proof that this process must work in that edge-setting when given a sufficiently rich set of edge measurements and assuming that$$\textbf{p}$$$p$is generic.

%0Journal Article