Convex Obstacles from Travelling Times
From MaRDI portal
Publication:6350867
arXiv2010.04334MaRDI QIDQ6350867FDOQ6350867
Authors: Lyle Noakes, Luchezar Stoyanov 
Publication date: 8 October 2020
Abstract: A construction is given for the recovery of a disjoint union of strictly convex smooth planar obstacles from travelling-time information. The obstacles are required to be such that no Euclidean line meets more than two of them.
This page was built for publication: Convex Obstacles from Travelling Times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6350867)
