English
Related papers

Related papers: Towards Plane Spanners of Degree 3

200 papers

We report a computational study of cutting plane algorithms for multi-stage stochastic mixed-integer programming models with the following cuts: (i) Benders', (ii) Integer L-shaped, and (iii) Lagrangian cuts. We first show that Integer…

Optimization and Control · Mathematics 2024-05-07 Akul Bansal , Simge Küçükyavuz

In this short note, we prove that the degree-three dilation of the square lattice $\mathbb{Z}^2$ is $1+\sqrt{2}$. This disproves a conjecture of Dumitrescu and Ghosh. We give a computer-assisted proof of a local-global property for the…

Computational Geometry · Computer Science 2026-01-19 Damien Galant , Cédric Pilatte

Let $P$ be a set of $n$ points in $\mathbb{R}^3$ amid a bounded number of obstacles. When obstacles are axis-parallel boxes, we prove that $P$ admits an $8\sqrt{3}$-spanner with $O(n\log^3 n)$ edges with respect to the geodesic distance.

Computational Geometry · Computer Science 2020-08-11 Mohammad Ali Abam , Mohammad Javad Rezaei Seraji

Multi-degree splines are piecewise polynomial functions having sections of different degrees. For these splines, we discuss the construction of a B-spline basis by means of integral recurrence relations, extending the class of multi-degree…

Numerical Analysis · Mathematics 2017-09-18 Carolina Vittoria Beccari , Giulio Casciola , Serena Morigi

Let $\Gamma$ be a cocompact discrete subgroup of $\mathrm{PSL}_{2}(\mathbb{C})$ and denote by $\mathcal{H}$ the three dimensional upper half-space. For a $p\in\mathcal{H}$, we count the number of points in the orbit $\Gamma p$, according to…

Number Theory · Mathematics 2017-12-08 Niko Laaksonen

In the present note we provide a partial classification of nearly free conic-line arrangements in the complex plane having nodes, tacnodes, and ordinary triple points. In this setting, our theoretical bound tells us that the degree of such…

Algebraic Geometry · Mathematics 2022-07-05 Aleksandra Gałecka

We present a novel method to estimate the motion matrix between overlapping pairs of 3D views in the context of indoor scenes. We use the Manhattan world assumption to introduce lightweight geometric constraints under the form of planes…

Computer Vision and Pattern Recognition · Computer Science 2020-01-22 Adrien Kaiser , José Alonso Ybanez Zepeda , Tamy Boubekeur

A finite projective plane, or more generally a finite linear space, has an associated incidence complex that gives rise to two natural algebras: the Stanley-Reisner ring $R/I_\Lambda$ and the inverse system algebra $R/I_\Delta$. We give a…

Commutative Algebra · Mathematics 2016-08-03 David Cook , Juan Migliore , Uwe Nagel , Fabrizio Zanello

We introduce a new structure for a set of points in the plane and an angle $\alpha$, which is similar in flavor to a bounded-degree MST. We name this structure $\alpha$-MST. Let $P$ be a set of points in the plane and let $0 < \alpha \le…

Computational Geometry · Computer Science 2014-02-26 Rom Aschner , Matthew J. Katz

A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…

Computational Geometry · Computer Science 2020-03-17 M. Sharir , C. Ziv

In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…

Computational Geometry · Computer Science 2019-01-28 Michael Kerber , Arnur Nigmetov

This paper is concerned with configurations of points in a plane lattice which determine angles that are rational multiples of $\pi$. We shall study how many such angles may appear in a given lattice and in which positions, allowing the…

Number Theory · Mathematics 2024-04-09 Roberto Dvornicich , Francesco Veneziano , Umberto Zannier

We consider the following problem: Given a set $S$ of $n$ distinct points in the plane, how many edge-disjoint plane straight-line spanning paths can be drawn on $S$? Each spanning path must be crossing-free, but edges from different paths…

Computational Geometry · Computer Science 2025-06-10 Philipp Kindermann , Jan Kratochvíl , Giuseppe Liotta , Pavel Valtr

In this article, we compute all possible degrees of maps between $S^3$-bundles over $S^5$. It also provides a correction of an article by Lafont and Neofytidis.

Algebraic Topology · Mathematics 2018-10-25 Xueqi Wang

We describe, for various degenerations $S\to \Delta$ of quartic $K3$ surfaces over the complex unit disk (e.g., to the union of four general planes, and to a general Kummer surface), the limits as $t\in \Delta^*$ tends to 0 of the Severi…

Algebraic Geometry · Mathematics 2014-06-03 Ciro Ciliberto , Thomas Dedieu

Plane triangulations with all vertices of degree $3$ or $6$ are enumerated. A plane triangulation is said to be akempic if it has a $4$-colouring such that no two adjacent triangles have the same three colours and this colouring is not…

Combinatorics · Mathematics 2025-04-22 Jan Florek

A closed plane meander of order $n$ is a closed self-avoiding curve intersecting an infinite line $2n$ times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm,…

Statistical Mechanics · Physics 2009-10-31 Iwan Jensen

Quadratic points of a surface in the projective 3-space are the points which can be exceptionally well approximated by a quadric. They are also singularities of a 3-web in the elliptic part and of a line field in the hyperbolic part of the…

Differential Geometry · Mathematics 2017-11-30 Marcos Craizer , Ronaldo Alves Garcia

$t$-spanners are used to approximate the pairwise distances between a set of points in a metric space. They have only a few edges compared to the total number of pairs and they provide a $t$-approximation on the distance of any two…

Computational Geometry · Computer Science 2021-04-29 David Eppstein , Hadi Khodabandeh

We compute the dimension of certain components of the family of smooth determinantal degree $d$ surfaces in $\mathbb{P}^3$, and show that each of them is the closure of a component of the Noether-Lefschetz locus $NL(d)$. Our computations…

Algebraic Geometry · Mathematics 2024-11-05 Manuel Leal , César Lozano Huerta , Montserrat Vite