English
Related papers

Related papers: Minimum number of partial triangulations

200 papers

A quadrangle in the Euclidean plane is called $n$-self-affine if it has a dissection into $n$ affine images of itself. All convex quadrangles are known to be $n$-self-affine for every $n \ge 5$. The only $2$-self-affine convex quadrangles…

Combinatorics · Mathematics 2026-05-25 Christian Richter , Felix Zimmermann

Given a set S of n points in the plane and a fixed angle 0 < omega < pi, we show how to find in O(n log n) time all triangles of minimum area with one angle omega that enclose S. We prove that in general, the solution cannot be written…

Computational Geometry · Computer Science 2013-05-31 Prosenjit Bose , Jean-Lou De Carufel

Let S be a set of n points in the plane, and let T be a set of m triangles with vertices in S. Then there exists a point in the plane contained in Omega(m^3 / (n^6 log^2 n)) triangles of T. Eppstein (1993) gave a proof of this claim, but…

Computational Geometry · Computer Science 2013-03-25 Gabriel Nivasch , Micha Sharir

We classify minimal projective 3-folds of general type with $p_g = 2$ by studying the birationality of their 6-canonical maps.

Algebraic Geometry · Mathematics 2019-01-25 Meng Chen , Yong Hu , Matteo Penegini

We prove some uniqueness results for conics of minimal area that enclose a compact, full-dimensional subset of the elliptic plane. The minimal enclosing conic is unique if its center or axes are prescribed. Moreover, we provide sufficient…

Metric Geometry · Mathematics 2010-08-26 Matthias J. Weber , Hans-Peter Schröcker

Given two distinct point sets $P$ and $Q$ in the plane, we say that $Q$ \emph{blocks} $P$ if no two points of $P$ are adjacent in any Delaunay triangulation of $P\cup Q$. Aichholzer et al. (2013) showed that any set $P$ of $n$ points in…

Computational Geometry · Computer Science 2022-10-24 Oswin Aichholzer , Thomas Hackl , Maarten Löffler , Alexander Pilz , Irene Parada , Manfred Scheucher , Birgit Vogtenhuber

The complete sets of irreducible triangulations are known for the orientable surfaces with genus of 0, 1, or 2 and for the nonorientable surfaces with genus of 1, 2, 3, or 4. By examining these sets we determine some of the properties of…

Combinatorics · Mathematics 2007-05-23 Thom Sulanke

We give a topological bound on the number of minimal models of a class of three dimensional log smooth pairs of general type.

Algebraic Geometry · Mathematics 2015-01-20 Paolo Cascini , Vladimir Lazić

We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…

Combinatorics · Mathematics 2019-03-05 Kevin Buchin , Man-Kwun Chiu , Stefan Felsner , Günter Rote , André Schulz

We prove that a minimal $t$-fold blocking set in a finite projective plane of order $n$ has cardinality at most \[\frac{1}{2} n\sqrt{4tn - (3t + 1)(t - 1)} + \frac{1}{2} (t - 1)n + t.\] This is the first general upper bound on the size of…

Combinatorics · Mathematics 2018-12-14 Anurag Bishnoi , Sam Mattheus , Jeroen Schillewaert

We prove by example that the number of elastic collisions of $n$ balls of equal mass and equal size in $d$-dimensional space can be greater than $n^3/27$ for $n\geq 3$ and $d\geq 2$. The previously known lower bound was of order $n^2$.

Dynamical Systems · Mathematics 2019-03-27 Krzysztof Burdzy , Mauricio Duarte

For each $n \geq 2$, $l \geq 3$, let ${ES}_L (l,n)$ be the minimum $N$ such that every family of $N$-lines in the plane contains either $l$ concurrent lines or $n$ lines in convex position. In this papar, we give the upper and lower bounds…

Combinatorics · Mathematics 2024-11-20 Koki Furukawa

In 2007, Ando and Egawa proved a theorem which provides a lower bound on the number of contractible edges preserving $4$-connectedness in $4$-connected graphs. In this paper, we refine their bounds, especially for the $4$-connected plane…

Combinatorics · Mathematics 2026-04-06 Toshiki Abe , Michitaka Furuya , Raiji Mukae , Shoichi Tsuchiya

Given a set of points in the plane, a covering path is a polygonal path that visits all the points. In this paper we consider covering paths of the vertices of an n x m grid. We show that the minimal number of segments of such a path is…

Combinatorics · Mathematics 2013-11-05 Balázs Keszegh

The present work considers the properties of classes of generally convex sets in the plane known as $1$-semiconvex and weakly $1$-semiconvex. More specifically, the examples of open and closed weakly $1$-semiconvex but non $1$-semiconvex…

Metric Geometry · Mathematics 2020-02-11 T. M. Osipchuk

Since ancient times mathematicians consider geometrical objects with integral side lengths. We consider plane integral point sets $\mathcal{P}$, which are sets of $n$ points in the plane with pairwise integral distances where not all the…

Combinatorics · Mathematics 2008-04-09 Sascha Kurz , Alfred Wassermann

In this paper, we consider the problem of counting almost empty monochromatic triangles in colored planar point sets, that is, triangles whose vertices are all assigned the same color and that contain only a few interior points.…

Let $\cal T$ be a tiling of the plane with equilateral triangles no two of which share a side. We prove that if the side lengths of the triangles are bounded from below by a positive constant, then $\cal T$ is periodic and it consists of…

Combinatorics · Mathematics 2018-05-24 Janos Pach , Gabor Tardos

We consider the configuration space of planar $n$-gons with fixed perimeter, which is diffeomorphic to the complex projective space $\mathbb{C}P^{n-2}$. The oriented area function has the minimal number of critical points on the…

Geometric Topology · Mathematics 2024-07-22 Giorgi Khimshiashvili , Gaiane Panina , Dirk Siersma

We prove that for any collection F of $n \ge 2$ pairwise disjoint compact convex sets in the plane there is a pair of sets A and B in F such that any line that separates A from B separates either A or B from a subcollection of F with at…

Combinatorics · Mathematics 2023-01-04 Eduardo Rivera-Campo , Jorge Urrutia
‹ Prev 1 8 9 10 Next ›