Related papers: Ambiguities in a Problem in Planar Geodesy
Cooperative geolocation has attracted significant research interests in recent years. A large number of localization algorithms rely on the availability of statistical knowledge of measurement errors, which is often difficult to obtain in…
An isometry is a geometric transformation that preserves distances between pairs of points. We present methods to classify isometries in the Euclidean plane, and extend these methods to spherical, single elliptical, and hyperbolic geometry.…
We discuss the application of random projections to the fundamental problem of deciding whether a given point in a Euclidean space belongs to a given set. We show that, under a number of different assumptions, the feasibility and…
A face image contains geometric cues in the form of configurational information and contours that can be used to estimate 3D face shape. While it is clear that 3D reconstruction from 2D points is highly ambiguous if no further constraints…
Many prediction tasks contain uncertainty. In some cases, uncertainty is inherent in the task itself. In future prediction, for example, many distinct outcomes are equally valid. In other cases, uncertainty arises from the way data is…
A given region in 2-D Euclidean space is divided by a unknown linear classifier in to two sets each carrying a label. The objective of an agent with known dynamics traversing the region is to identify the true classifier while paying a…
The Euclidean distance degree of an algebraic variety is a well-studied topic in applied algebra and geometry. It has direct applications in geometric modeling, computer vision, and statistics. We use non-proper Morse theory to give a…
We define and study complex structures and generalizations on spaces consisting of geodesics or harmonic maps that are compatible with the symmetries of these spaces. The main results are about existence and uniqueness of such structures.
We study the geodesic complexity of the ordered and unordered configuration spaces of graphs in both the $\ell_1$ and $\ell_2$ metrics. We determine the geodesic complexity of the ordered two-point $\varepsilon$-configuration space of any…
We consider the solid angle that a planar compact subset subtends at a point in a level set of height h and study two extremal problems for the solid angle. One of the variables is a point in such a plane, that is, we study the properties…
Often, one would like to determine some observable A, but can only measure some (hopefully related) observable M. This can arise, for example, in quantum eavesdropping, or when the research lab budget isn't large enough for that 100%…
A problem that is simple to state in the context of spherical geometry, and that seems rather interesting, appears to have been unexamined to date in the mathematical literature. The problem can also be recast as a problem in the real…
Deviation equation: Second order differential equation for the 4-vector which measures the distance between reference points on neighboring world lines in spacetime manifolds. Relativistic geodesy: Science representing the Earth (or any…
We consider the popular and classical method of alternating projections for finding a point in the intersection of two closed sets. By situating the algorithm in a metric space, equipped only with well-behaved geodesics and angles (in the…
We consider a constrained minimax single facility location problem on the plane with rectilinear distance. The feasible set of location points is restricted to rectangles with sides oriented at a 45 degrees angle to the axes of Cartesian…
Understanding, finding, or even deciding on the existence of real solutions to a system of equations is a very difficult problem with many applications. While it is hopeless to expect much in general, we know a surprising amount about these…
Robots sense, move and act in the physical world. It is therefore natural that algorithmic problems in robotics and automation have a geometric component, often central to the problem. Below we review ten challenging problems at the…
Problems in optimization and geometric probability are discussed, all connected with angles subtended at an observer's eye by an object at a distance. Several of these remain unsolved.
This note describes some open problems that can be examined with the purpose of gaining additional insight of how to solve the problem of finding a general classification of geodetic graphs
The goal of Point Distance Solving Problems is to find 2D or 3D placements of points knowing distances between some pairs of points. The common guideline is to solve them by a numerical iterative method (\emph{e.g.} Newton-Raphson method).…