Convex Obstacles from Travelling Times
Dynamical Systems
2020-10-12 v1
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.
Cite
@article{arxiv.2010.04334,
title = {Convex Obstacles from Travelling Times},
author = {Lyle Noakes and Luchezar Stoyanov},
journal= {arXiv preprint arXiv:2010.04334},
year = {2020}
}
Comments
14 pages, 3 figures