Abstract
Noakes and Stoyanov [Mathematics 9, 2434 (2021)] introduced a method of recovering strictly convex planar obstacles from their set of traveling 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 intersects more than two obstacles.
Published Version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have