Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userTrilateration using Unlabeled Path or Loop Lengths
74
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Let $mathbf{p}$ be a configuration of $n$ points in $mathbb{R}^d$ for some $n$ and some $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 has the same endpoints. 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 $mathbf{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 $mathbf{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 been already been used for the simpler problem of unlabeled edge lengths.
rate research
Read More
Let $G$ be a $3$-connected graph with $n$ vertices and $m$ edges. Let $mathbf{p}$ be a randomly chosen mapping of these $n$ vertices to the integer range $[1..2^b]$ for $bge m^2$. Let $mathbf{l}$ be the vector of $m$ Euclidean lengths of $G$s edges under $mathbf{p}$. In this paper, we show that, WHP over $mathbf{p}$, we can efficiently reconstruct both $G$ and $mathbf{p}$ from $mathbf{l}$. In contrast to this average case complexity, this reconstruction problem is NP-HARD in the worst case. In fact, even the labeled version of this problem (reconstructing $mathbf{p}$ given both $G$ and $mathbf{l}$) is NP-HARD. We also show that our results stand in the presence of small amounts of error in $mathbf{l}$, and in the real setting with approximate length measurements. Our method is based on older ideas that apply lattice reduction to solve certain SUBSET-SUM problems, WHP. We also rely on an algorithm of Seymour that can efficiently reconstruct a graph given an independence oracle for its matroid.
Let $mathbf{p}$ be a configuration of $n$ points in $mathbb{R}^d$ for some $n$ and some $d ge 2$. Each pair of points has a Euclidean length in the configuration. Given some graph $G$ on $n$ vertices, we measure the point-pair lengths corresponding to the edges of $G$. In this paper, we study the question of when a generic $mathbf{p}$ in $d$ dimensions will be uniquely determined (up to an unknowable Euclidean transformation) from a given set of point-pair lengths together with knowledge of $d$ and $n$. In this setting the lengths are given simply as a set of real numbers; they are not labeled with the combinatorial data that describes which point-pair gave rise to which length, nor is data about $G$ given. We show, perhaps surprisingly, that in terms of generic uniqueness, labels have no effect. A generic configuration is determined by an unlabeled set of point-pair lengths (together with $d$ and $n$) iff it is determined by the labeled edge lengths.
Croftons formula of integral geometry evaluates the total motion invariant measure of the set of $k$-dimensional planes having nonempty intersection with a given convex body. This note deals with motion invariant measures on sets of pairs of hyperplanes or lines meeting a convex body. Particularly simple results are obtained if, and only if, the given body is of constant width in the first case, and of constant brightness in the second case.
Trilateration-based localization (TBL) has become a corner stone of modern technology. This study formulates the concern on how wireless sensor networks can take advantage of the computational intelligent techniques using both single- and multi-objective particle swarm optimization (PSO) with an overall aim of concurrently minimizing the required time for localization, minimizing energy consumed during localization, and maximizing the number of nodes fully localized through the adjustment of wireless sensor transmission ranges while using TBL process. A parameter-study of the applied PSO variants is performed, leading to results that show algorithmic improvements of up to 32% in the evaluated objectives.
Suppose that $E$ and $E$ denote real Banach spaces with dimension at least 2 and that $Dvarsubsetneq E$ and $Dvarsubsetneq E$ are uniform domains with homogeneously dense boundaries. We consider the class of all $varphi$-FQC (freely $varphi$-quasiconformal) maps of $D$ onto $D$ with bilipschitz boundary values. We show that the maps of this class are $eta$-quasisymmetric. As an application, we show that if $D$ is bounded, then maps of this class satisfy a two sided Holder condition. Moreover, replacing the class $varphi$-FQC by the smaller class of $M$-QH maps, we show that $M$-QH maps with bilipschitz boundary values are bilipschitz. Finally, we show that if $f$ is a $varphi$-FQC map which maps $D$ onto itself with identity boundary values, then there is a constant $C,,$ depending only on the function $varphi,,$ such that for all $xin D$, the quasihyperbolic distance satisfies $k_D(x,f(x))leq C$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
