Related papers: Sweeping $x$-monotone pseudolines

Edge bundling reduces the visual clutter in a drawing of a graph by uniting the edges into bundles. We propose a method of edge bundling drawing each edge of a bundle separately as in metro-maps and call our method ordered bundles. To…

We consider a spectrum of geometric optimization problems motivated by contexts such as satellite communication and astrophysics. In the problem Minimum Scan Cover with Angular Costs, we are given a graph $G$ that is embedded in Euclidean…

Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…

For any 3-monotone on $[a,b]$ function $f$ (its third divided differences are nonnegative for all choices of four distinct points, or equivalently, $f$ has a convex derivative on $(a,b)$) we construct a cubic 3-monotone (like $f$) spline…

Several results on constrained spline smoothing are obtained. In particular, we establish a general result, showing how one can constructively smooth any monotone or convex piecewise polynomial function (ppf) (or any $q$-monotone ppf,…

We show that the pivoting process associated with one line and $n$ points in $r$-dimensional space may need $\Omega(\log^r n)$ steps in expectation as $n \to \infty$. The only cases for which the bound was known previously were for $r \le…

We present a method for fitting monotone curves using cubic B-splines, which is equivalent to putting a monotonicity constraint on the coefficients. We explore different ways of enforcing this constraint and analyze their theoretical and…

In this work, we propose a novel and efficient method for smoothing polylines in motion planning tasks. The algorithm applies to motion planning of vehicles with bounded curvature. In the paper, we show that the generated path: 1) has…

Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…

For each integer n, an n-folding curve is obtained by folding n times a strip of paper in two, possibly up or down, and unfolding it with right angles. Generalizing the usual notion of infinite folding curve, we define complete folding…

We consider systems of simple closed curves on surfaces and their total number of intersection points, their so-called crossing number. For a fixed number of curves, we aim to minimise the crossing number. We determine the minimal crossing…

Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope…

We consider embeddings of planar graphs in $R^2$ where vertices map to points and edges map to polylines. We refer to such an embedding as a polyline drawing, and ask how few bends are required to form such a drawing for an arbitrary planar…

We present new computations of approximately length-minimizing polygons with fixed thickness. These curves model the centerlines of "tight" knotted tubes with minimal length and fixed circular cross-section. Our curves approximately…

A pseudoline is a homeomorphic image of the real line in the plane so that its complement is disconnected. An arrangement of pseudolines is a set of pseudolines in which every two cross exactly once. A drawing of a graph is pseudolinear if…

Computing a Euclidean minimum spanning tree of a set of points is a seminal problem in computational geometry and geometric graph theory. We combine it with another classical problem in graph drawing, namely computing a monotone geometric…

We consider the problem of reducing the (semi)total domination number of graph by one by contracting edges. It is known that this can always be done with at most three edge contractions and that deciding whether one edge contraction…

A graph property is monotone if it is closed under removal of vertices and edges. In this paper we consider the following edge-deletion problem; given a monotone property P and a graph G, compute the smallest number of edge deletions that…

Sweeping is a commonly used procedure to explicitly solve the discrete ordinates equation, which itself is a common approximation of the neutron transport equation. To sweep through the computational domain, an ordering of the spatial cells…

For a model of a 3D coating composed of a bi-periodic system of parallel riblets with gaps we analytically derive an approximate formula for the effective slip length (an offset from the flat surface at which the flow velocity would…