Related papers: Lost at Sea
We study the two dimensional least gradient problem in a convex, but not necessary strictly convex region. We look for solutions in the space of $BV$ functions satisfying the boundary data $f$ in trace sense. We assume that $f$ is in $BV$…
Conformal mapping may be the best-known topic in complex analysis. Any simply connected nonempty domain $\Omega$ in the complex plane ${{\mathbb{C}}}$ (assuming $\Omega\ne {{\mathbb{C}}}$) can be mapped bijectively to the unit disk by an…
In this work we study the stability regions of linear multistep or multiderivative multistep methods for initial-value problems by using techniques that are straightforward to implement in modern computer algebra systems. In many…
The kinetics of spreading of a liquid drop in a wedge or V-shaped groove, in a network of such grooves, and on a hydrophilic strip, is re-examined. The length of a droplet of volume Omega spreading in a wedge after a time t is predicted to…
It is known that every planar graph has a planar embedding where edges are represented by non-crossing straight-line segments. We study the planar slope number, i.e., the minimum number of distinct edge-slopes in such a drawing of a planar…
Given a set of disjoint simple polygons $\sigma_1, \ldots, \sigma_n$, of total complexity $N$, consider a convexification process that repeatedly replaces a polygon by its convex hull, and any two (by now convex) polygons that intersect by…
Let $P$ be a set of $n$ points in the plane. We consider a variation of the classical Erd\H{o}s-Szekeres problem, presenting efficient algorithms with $O(n^3)$ running time and $O(n^2)$ space complexity that compute: (1) A subset $S$ of $P$…
Motivated by the fact that not all nonconvex optimization problems are difficult to solve, we survey in this paper three widely-used ways to reveal the hidden convex structure for different classes of nonconvex optimization problems.…
Let $S$ be a set of $n$ points in the plane, $\wp(S)$ be the set of all simple polygons crossing $S$, $\gamma_P$ be the maximum angle of polygon $P \in \wp(S)$ and $\theta =min_{P\in\wp(S)} \gamma_P$. In this paper, we prove that…
We introduce a novel approach for object segmentation from 3D images using modified minimal path Eikonal equation. The proposed method utilizes an implicit constraint - a second order correction to the inhomogeneous minimal path Eikonal -…
This paper presents an algorithm for approximately minimizing a convex function in simple, not necessarily bounded convex domains, assuming only that function values and subgradients are available. No global information about the objective…
Let $ \Omega \subsetneq \mathbf{R}^n\,(n\geq 2)$ be an unbounded convex domain. We study the minimal surface equation in $\Omega$ with boundary value given by the sum of a linear function and a bounded uniformly continuous function in $…
For finite graphs, path-width is an interesting and useful concept, but if we extend it to infinite graphs in the most obvious way (by making the indexing path infinite), it does not work nicely. The simplest extension that works nicely is…
We propose a volumetric formulation for computing the Optimal Transport problem defined on surfaces in $\mathbb{R}^3$, found in disciplines like optics, computer graphics, and computational methodologies. Instead of directly tackling the…
More than fifty years ago, Bellman asked for the best escape path within a known forest but for an unknown starting position. This deterministic finite path is the shortest path that leads out of a given environment from any starting point.…
New algorithms are devised for finding the maxima of multidimensional point samples, one of the very first problems studied in computational geometry. The algorithms are very simple and easily coded and modified for practical needs. The…
We consider the problem of optimally insulating a given domain $\Omega$ of ${\mathbb{R}}^d$; this amounts to solve a nonlinear variational problem, where the optimal thickness of the insulator is obtained as the boundary trace of the…
We provide a linear time algorithm to determine the flip distance between two plane spanning paths on a point set in convex position. At the same time, we show that the happy edge property does not hold in this setting. This has to be seen…
The self intersection of an immersion i : S^2 \to R^3 dissects S^2 into pieces which are planar surfaces (unless i is an embedding). In this work we determine what collections of planar surfaces may be obtained in this way. In particular,…
This paper describes an efficient approach to constructing a resultant polyline with a minimum number of segments and arcs. While fitting an arc can be done with complexity O(1) (see [1] and [2]), the main complexity is in checking that the…