相关论文: Recovering Obstacles from their Travelling Times

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.

The paper deals with some problems related to recovering information about an obstacle in an Euclidean space from certain measurements of lengths of generalized geodesics in the exterior of the obstacle. The main result is that if two…

Suppose that $K$ and $L$ are two disjoint unions of strictly convex obstacles with the same set of travelling times, contained in an $n$-dimensional Riemannian manifold $M$ (where $n\geq2$). Under some natural curvature conditions on $M$,…

We address the classical inverse problem of recovering the position and shape of obstacles immersed in a planar Stokes flow using boundary measurements. We prove that this problem can be transformed into a shape-from-moments problem to…

This paper presents a novel method for reformulating non-differentiable collision avoidance constraints into smooth nonlinear constraints using strong duality of convex optimization. We focus on a controlled object whose goal is to avoid…

This paper proves an elementary topological fact about closed curves on surfaces, namely that by carefully smoothing an intersection point, one can reduce self-intersection by exactly $1$. This immediately implies a positive answer to a…

The surface reconstruction problem from sets of planar parallel slices representing cross sections through 3D objects is presented. The final result of surface reconstruction is always based on the correct estimation of the structure of the…

This work studies path planning in two-dimensional space, in the presence of polygonal obstacles. We specifically address the problem of building a roadmap graph, that is, an abstract representation of all the paths that can potentially be…

This article is concerned with the reconstruction of obstacle $\O$ immersed in a fluid flowing in a bounded domain $\Omega$ in the two dimensional case. We assume that the fluid motion is governed by the Stokes-Brinkmann equations. We make…

In a recent paper published in Nature, Y.I. Sobolev et al. introduced the concept of trajectoids: convex, rigid objects, which roll without slip or spin on a flat plane along a prescribed periodic, unbounded planar path. A geometric…

Given a compact manifold with boundary with unknown Riemannian metric. The problem is to reconstruct the metric in a class of conformal metrics from knowledge of lengths of all closed geodesics (kinematic data). An integral inequality is…

In this paper we consider the unique determination of inhomogeneities together with possible buried obstacles by scattering measurements. Under the assumption that the buried obstacles have only planar contacts with the inhomogeneities, we…

Reconstructing 2D curves from sample points has long been a critical challenge in computer graphics, finding essential applications in vector graphics. The design and editing of curves on surfaces has only recently begun to receive…

Let $K$ and $L$ be two disjoint unions of strictly convex obstacles contained within a Riemannian manifold with boundary $S$ of dimension $m\geq 2$. The sets of travelling times $\mathcal{T}_K$ and $\mathcal{T}_L$ of $K$ and $L$,…

We propose a double obstacle phase field methodology for binary recovery of the slowness function of an Eikonal equation found in first traveltime tomography. We treat the inverse problem as an optimization problem with quadratic misfit…

We develop a new Riemannian descent algorithm that relies on momentum to improve over existing first-order methods for geodesically convex optimization. In contrast, accelerated convergence rates proved in prior work have only been shown to…

We consider the problem of designing a smooth trajectory that traverses a sequence of convex sets in minimum time, while satisfying given velocity and acceleration constraints. This problem is naturally formulated as a nonconvex program. To…

We propose two new alternating direction methods to solve "fully" nonsmooth constrained convex problems. Our algorithms have the best known worst-case iteration-complexity guarantee under mild assumptions for both the objective residual and…

The time reversibility characteristic of Hamiltonian mechanics has long been extended to nonHamiltonian dynamical systems modeling nonequilibrium steady states with feedback-based thermostats and ergostats. Typical solutions are…

Suppose we are given a pair of points $s, t$ and a set $S$ of $n$ geometric objects in the plane, called obstacles. We show that in polynomial time one can construct an auxiliary (multi-)graph $G$ with vertex set $S$ and every edge labeled…