Trilateration using unlabeled path or loop lengths

DOI10.1007/s00454-023-00605-xarXiv2012.14527OpenAlexW3113854859MaRDI QIDQ6191440

Steven J. Gortler, Ioannis Gkioulekas, Todd E. Zickler, Louis Theran

Publication date: 9 February 2024

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.14527

zbMATH Keywords

distance geometryglobal rigidityrigidity theory

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Distance in graphs (05C12) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Cites Work

• Unnamed Item
• The unassigned distance geometry problem
• The algebro-geometric study of range maps
• Slider-pinning rigidity: a Maxwell-Laman-type theorem
• Elementary structure of real algebraic varieties
• On reconstructing \(n\)-point configurations from the distribution of distances or areas
• On graphs and rigidity of plane skeletal structures
• Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
• The non-solvability by radicals of generic 3-connected planar Laman graphs
• WHICH POINT CONFIGURATIONS ARE DETERMINED BY THE DISTRIBUTION OF THEIR PAIRWISE DISTANCES?
• The Rigidity of Graphs
• Analysis of PSLQ, an integer relation finding algorithm
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• GENERIC UNLABELED GLOBAL RIGIDITY
• Generic Global Rigidity in Complex and Pseudo-Euclidean Spaces
• Euclidean Distance Geometry and Applications
• Integral distances
• Algorithms in real algebraic geometry

This page was built for publication: Trilateration using unlabeled path or loop lengths