Recovering Obstacles from their Travelling Times
Abstract
Noakes and Stoyanov (2021) introduced a method of recovering strictly convex planar obstacles from their set of travelling times. We provide an extension of this construction for obstacles on Riemannian surfaces under some general curvature conditions. It is required that no smooth geodesic intersect more than two obstacles.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.