A rigidity-based necessary and sufficient condition for unique registrability of networks, with planar simplification and resolution of a 2D conjecture plus higher-D counterexamples.
Semidef- inite programming approaches for sensor network localization with noisy distance measurements
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NI 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Uniquely Registrable Networks
A rigidity-based necessary and sufficient condition for unique registrability of networks, with planar simplification and resolution of a 2D conjecture plus higher-D counterexamples.