Related papers: Tightening Curves on Surfaces Monotonically with A…
The computation of the topology of a real algebraic plane curve is greatly simplified if there are no more than one critical point in each vertical line: the general position condition. When this condition is not satisfied, then a finite…
We introduce a geometric multigrid method for solving linear systems arising from variational problems on surfaces in geometry processing, Gravo MG. Our scheme uses point clouds as a reduced representation of the levels of the multigrid…
Let $\omega(G)$ and $\chi(G)$ denote the clique number and chromatic number of a graph $G$, respectively. The {\em disjointness graph} of a family of curves (continuous arcs in the plane) is the graph whose vertices correspond to the curves…
We utilise the two principles of decoupling introduced in arXiv:2407.16108 to prove the following conditional result: assuming uniform decoupling for graphs of polynomials in all dimensions with identically zero Gaussian curvature, we can…
The aim of this paper is to design an efficient multigrid method for constrained convex optimization problems arising from discretization of some underlying infinite dimensional problems. Due to problem dependency of this approach, we only…
In an $r$-uniform hypergraph on $n$ vertices a tight Hamilton cycle consists of $n$ edges such that there exists a cyclic ordering of the vertices where the edges correspond to consecutive segments of $r$ vertices. We provide a first…
Composite minimization involves a collection of smooth functions which are aggregated in a nonsmooth manner. In the convex setting, we design an algorithm by linearizing each smooth component in accordance with its main curvature. The…
Given a set of planar curves (Jordan arcs), each pair of which meets -- either crosses or touches -- exactly once, we establish an upper bound on the number of touchings. We show that such a curve family has $O(t^2n)$ touchings, where $t$…
Optimizing an implicational base of a closure system consists in turning this implicational base into an equivalent one with premises and conclusions as small as possible. This task is known to be hard in general but tractable for a number…
We establish new bounds on the number of tangencies and orthogonal intersections determined by an arrangement of curves. First, given a set of $n$ algebraic plane curves, we show that there are $O(n^{3/2})$ points where two or more curves…
We study a popular algorithm for fitting polynomial curves to scattered data based on the least squares with gradient weights. We show that sometimes this algorithm admits a substantial reduction of complexity, and, furthermore, find…
In this paper we study similarity measures for moving curves which can, for example, model changing coastlines or retreating glacier termini. Points on a moving curve have two parameters, namely the position along the curve as well as time.…
We prove essentially sharp bounds for the $L^p$ restriction of weighted Gauss sums to monomial curves. Getting the $L^2$ upper bound combines the $TT^*$ method for matrices with the first and second derivative test for exponential sums. The…
We study the set of all decompositions (clusterings) of a graph through its characterization as a set of lifted multicuts. This leads us to practically relevant insights related to the definition of a class of decompositions by must-join…
We provide an algorithm, running in polynomial time in the number of vertices, computing the unique solution to the biased infinity Laplacian Boundary Problem on finite graphs. The algorithm is based on the general outline and approach…
For an oriented surface $S$, the singular set of a fold map $f:S\rightarrow \mathbb{R}^2$ is a collection of smooth curves, also known as fold singularities. We construct a sharp lower bound on the number of self-intersections of such fold…
We prove a compactness theorem for sequences of low-action punctured holomorphic curves of controlled topology, in any dimension, without imposing the typical assumption of uniformly bounded Hofer energy. In the limit, we extract a family…
We investigate robust optimization problems defined for maximizing convex functions. For finite uncertainty set, we develop a geometric branch-and-bound algorithmic approach to solve this problem. The geometric branch-and-bound algorithm…
In tolerancing analysis, geometrical or contact specifications can be represented by polytopes. Due to the degrees of invariance of surfaces and that of freedom of joints, these operand polytopes are originally unbounded in most of the…
Connectivity problems like k-Path and k-Disjoint Paths relate to many important milestones in parameterized complexity, namely the Graph Minors Project, color coding, and the recent development of techniques for obtaining kernelization…