Reconstructing a convex polygon from its $\omega$-cloud

TL;DR

This paper studies how to reconstruct a convex polygon solely from its $$-cloud, establishing conditions for uniqueness and providing an efficient reconstruction algorithm with linear time complexity.

Contribution

It introduces conditions under which the polygon can be uniquely reconstructed from the $$-cloud and presents an optimal linear-time reconstruction method.

Findings

Unique reconstruction when < and </2 are known.

Reconstruction algorithm runs in O(n) time with O(1) extra space.

Non-uniqueness cases are characterized when conditions are not met.

Abstract

An $\omega$-wedge is the closed set of points contained between two rays that are emanating from a single point (the apex), and are separated by an angle $\omega < \pi$. Given a convex polygon $P$, we place the $\omega$-wedge such that $P$ is inside the wedge and both rays are tangent to $P$. The set of apex positions of all such placements of the $\omega$-wedge is called the $\omega$-cloud of $P$. We investigate reconstructing a polygon $P$ from its $\omega$-cloud. Previous work on reconstructing $P$ from probes with the $\omega$-wedge required knowledge of the points of tangency between $P$ and the two rays of the $\omega$-wedge in addition to the location of the apex. Here we consider the setting where the maximal $\omega$-cloud alone is given. We give two conditions under which it uniquely defines $P$: (i) when $\omega < \pi$ is fixed/given, or (ii) when what is known is that $\omega < \pi/2$. We show that if neither of these two conditions hold, then $P$ may not be unique. We show that, when the uniqueness conditions hold, the polygon $P$ can be reconstructed in $O(n)$ time with $O(1)$ working space in addition to the input, where $n$ is the number of arcs in the input $\omega$-cloud.