Files in this item
Trilateration using unlabeled path or loop lengths
Item metadata
dc.contributor.author | Gkioulekas, Ioannis | |
dc.contributor.author | Gortler, Steven J. | |
dc.contributor.author | Zickler, Todd | |
dc.contributor.author | Theran, Louis S. | |
dc.date.accessioned | 2024-01-22T13:30:08Z | |
dc.date.available | 2024-01-22T13:30:08Z | |
dc.date.issued | 2023-11-25 | |
dc.identifier | 296301859 | |
dc.identifier | ee9a04c0-af7d-4f00-879c-52346396b3b5 | |
dc.identifier | 85178155840 | |
dc.identifier.citation | Gkioulekas , I , Gortler , S J , Zickler , T & Theran , L S 2023 , ' Trilateration using unlabeled path or loop lengths ' , Discrete & Computational Geometry , vol. First Online . https://doi.org/10.1007/s00454-023-00605-x | en |
dc.identifier.issn | 0179-5376 | |
dc.identifier.other | ORCID: /0000-0001-5282-4800/work/151762208 | |
dc.identifier.uri | https://hdl.handle.net/10023/29044 | |
dc.description | Funding: Steven Gortler was partially supported by NSF grant DMS-1564473. Ioannis Gkioulekas and Todd Zickler received support from the DARPA REVEAL program under contract no. HR0011-16-C-0028. | en |
dc.description.abstract | Let p be a configuration of n points in Rd for some n and some d≥2. Each pair of points defines an edge, which has a Euclideanlength 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 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 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 p is generic. | |
dc.format.extent | 43 | |
dc.format.extent | 821231 | |
dc.language.iso | eng | |
dc.relation.ispartof | Discrete & Computational Geometry | en |
dc.subject | Distance geometry | en |
dc.subject | Rigidty theory | en |
dc.subject | Global rigidity | en |
dc.subject | QA Mathematics | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA | en |
dc.title | Trilateration using unlabeled path or loop lengths | en |
dc.type | Journal article | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.contributor.institution | University of St Andrews. Pure Mathematics | en |
dc.identifier.doi | 10.1007/s00454-023-00605-x | |
dc.description.status | Peer reviewed | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.