Related papers: Highly Oscillating Thin Obstacles
For the thin obstacle problem in 3d, we show that half-space solutions form an isolated family in the space of $7/2$-homogeneous solutions. For a general solution with one blow-up profile in this family, we establish the rate of convergence…
This paper studies the lower bound complexity for the optimization problem whose objective function is the average of $n$ individual smooth convex functions. We consider the algorithm which gets access to gradient and proximal oracle for…
An obstacle representation of a graph $G$ is a set of points in the plane representing the vertices of $G$, together with a set of polygonal obstacles such that two vertices of $G$ are connected by an edge in $G$ if and only if the line…
In this paper we establish the optimal interior regularity and the $C^{1,\gamma}$ smoothness of the regular part of the free boundary in the thin obstacle problem for a class of degenerate elliptic equations with variable coefficients.
In this article we investigate the higher regularity properties of the regular free boundary in the fractional thin obstacle problem. Relying on a Hodograph-Legendre transform, we show that for smooth or analytic obstacles the regular free…
We consider travel time tomography problems involving detection of high contrast, discrete high velocity structures. This results in a discrete nonlinear inverse problem, for which traditional grid-based models and iterative linearized…
Given a matrix $A$, a linear feasibility problem (of which linear classification is a special case) aims to find a solution to a primal problem $w: A^Tw > \textbf{0}$ or a certificate for the dual problem which is a probability distribution…
Intersection algorithms are very important in computation of geometrical problems. Algorithms for a line intersection with linear or quadratic surfaces are quite efficient. However, algorithms for a line intersection with other surfaces are…
The (unweighted) point-separation problem asks, given a pair of points $s$ and $t$ in the plane, and a set of candidate geometric objects, for the minimum-size subset of objects whose union blocks all paths from $s$ to $t$. Recent work has…
We study the problem of generating a hyperplane tessellation of an arbitrary set $T$ in $\mathbb{R}^n$, ensuring that the Euclidean distance between any two points corresponds to the fraction of hyperplanes separating them up to a…
We study certain obstacle type problems involving standard and nonlocal minimal surfaces. We obtain optimal regularity of the solution and a characterization of the free boundary.
For a given a normally hyperbolic invariant manifold, whose stable and unstable manifolds intersect transversally, we consider several tools and techniques to detect trajectories with prescribed itineraries: the scattering map, the…
We revisit the classical problem of diffusion of a scalar (or heat) released in a two-dimensional medium with an embedded periodic array of impermeable obstacles such as perforations. Homogenisation theory provides a coarse-grained…
We study optimization problems for partially hinged rectangular plates, modeling bridge roadways, in the presence of real and artificial obstacles. Real obstacles represent structural constraints to avoid, while artificial ones are…
We establish H\"older stability of an inverse hyperbolic obstacle problem. Mainly, we study the problem of reconstructing an unknown function defined on the boundary of the obstacle from two measurements taken on the boundary of a domain…
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…
We consider the inverse obstacle scattering problem of determining both the shape and the "equivalent impedance" from far field measurements at a fixed frequency. In this work, the surface impedance is represented by a second order surface…
We introduce the concept of an obstacle skeleton which is a set of line segments inside a polygonal obstacle $\omega$ that can be used in place of $\omega$ when performing intersection tests for obstacle-avoiding network problems in the…
Safety is paramount for mobile robotic platforms such as self-driving cars and unmanned aerial vehicles. This work is devoted to a task that is indispensable for safety yet was largely overlooked in the past -- detecting obstacles that are…
This paper presents an optimal $\Theta(n \log n)$ algorithm for determining time-minimal rectilinear paths among $n$ transient rectilinear obstacles. An obstacle is transient if it exists in the scene only for a specific time interval,…