Related papers: Study guide for "On restricted projections to plan…
We consider cylindrical algebraic decomposition (CAD) and the key concept of delineability which underpins CAD theory. We introduce the novel concept of projective delineability which is easier to guarantee computationally. We prove results…
This paper addresses the question of when projections of a high-dimensional random vector are approximately Gaussian. This problem has been studied previously in the context of high-dimensional data analysis, where the focus is on…
The decomposition of a matrix, as a product of factors with particular properties, is a much used tool in numerical analysis. Here we develop methods for decomposing a matrix $C$ into a product $X Y$, where the factors $X$ and $Y$ are…
Tree decompositions were developed by Robertson and Seymour. Since then algorithms have been developed to solve intractable problems efficiently for graphs of bounded treewidth. In this paper we extend tree decompositions to allow cycles to…
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…
Recently, there has been interest in representing single graphs by multiple drawings; for example, using graph stories, storyplans, or uncrossed collections. In this paper, we apply this idea to orthogonal graph drawing. Due to the…
A lower bound on the minimum degree of the plane algebraic curves containing every point in a large point-set $K$ of the Desarguesian plane $PG(2,q)$ is obtained. The case where $K$ is a maximal $(k,n)$-arc is considered to greater extent.
We prove bilinear $\ell^2$-decoupling and refined bilinear decoupling inequalities for the truncated hyperbolic paraboloid in $\mathbb{R}^3$. As an application, we prove the associated restriction estimate in the range $p>22/7$, matching an…
For each $d\geq 0$, we prove decoupling inequalities in $\mathbb R^3$ for the graphs of all bivariate polynomials of degree at most $d$ with bounded coefficients, with the decoupling constant depending uniformly in $d$ but not the…
The challenging task of 3D planar reconstruction from images involves several sub-tasks including frame-wise plane detection, segmentation, parameter regression and possibly depth prediction, along with cross-frame plane correspondence and…
In this article we address the problem of computing the dimension of the space of plane curves of degree $d$ with $n$ general points of multiplicity $m$. A conjecture of Harbourne and Hirschowitz implies that when $d \geq 3m$, the dimension…
Multiple near frontal-parallel planes based depth representation demonstrated impressive results in self-supervised monocular depth estimation (MDE). Whereas, such a representation would cause the discontinuity of the ground as it is…
The paper is devoted to the study of homeomoephisms with finite distortion on the plane with use of the modulus techniques.
We prove decoupling inequalities for mixed-homogeneous bivariate polynomials, which partially answers a conjecture of Bourgain, Demeter and Kemp.
The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less well known is Erd\H{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear…
A graph drawing in the plane is called an almost embedding if images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. We introduce integer invariants of almost embeddings: winding number, cyclic and triodic Wu…
The Grassmann manifold of linear subspaces is important for the mathematical modelling of a multitude of applications, ranging from problems in machine learning, computer vision and image processing to low-rank matrix optimization problems,…
We provide criteria for deciding whether a given planar curve is an image of a given spatial curve, obtained by a central or a parallel projection with unknown parameters. These criteria reduce the projection problem to a certain…
An analytic center cutting plane method is an iterative algorithm based on the computation of analytic centers. In this paper, we propose some analytic center cutting plane methods for solving quasimonotone or pseudomonotone variational…
Prompted by results of Guardo, Van Tuyl and the second author for lines in projective 3 space, we develop asymptotic upper bounds for the least degree of a homogeneous form vanishing to order at least m on a union of disjoint r dimensional…