Related papers: Partitioning the projective plane and the dunce ha…
We initiate a systematic study of lattices of thick subcategories for arbitrary essentially small triangulated categories. To this end we give several examples illustrating the various properties these lattices may, or may not, have and…
We introduce the notion of extended admissible dissections of a marked surface, building upon the notion of an admissible dissection of a marked surface by Amiot--Plamondon--Schroll. For each extended admissible dissection we construct a…
The moduli space of planar polygons with generic side lengths is a smooth, closed manifold. It is known that these manifolds contain the real points of the moduli space of distinct points on the projective line as an open dense subset.…
We shift the perspective on the interval fragmentation problem from division points to division spacings. This leads to a proof that is both simpler and stronger, establishing limiting distributions for partition points and spacings and,…
Industrial bin picking is a challenging task that requires accurate and robust segmentation of individual object instances. Particularly, industrial objects can have irregular shapes, that is, thin and concave, whereas in bin-picking…
A pseudo-triangle is a simple polygon with three convex vertices, and a pseudo-triangulation is a face-to-face tiling of a planar region into pseudo-triangles. Pseudo-triangulations appear as data structures in computational geometry, as…
In this work we consider triangulations of point sets in the Euclidean plane, i.e., maximal straight-line crossing-free graphs on a finite set of points. Given a triangulation of a point set, an edge flip is the operation of removing one…
According to the decomposition and relative hard Lefschetz theorems, given a projective map of complex quasi projective algebraic varieties and a relatively ample line bundle, the rational intersection cohomology groups of the domain of the…
Vertex splitting replaces a vertex by two copies and partitions its incident edges amongst the copies. This problem has been studied as a graph editing operation to achieve desired properties with as few splits as possible, most often…
We generalize a special case of a theorem of Proctor on the enumeration of lozenge tilings of a hexagon with a maximal staircase removed, using Kuo's graphical condensation method. Additionally, we prove a formula for a weighted version of…
Given a web (multi-foliation) and a linear system on a projective surface we construct divisors cutting out the locus where some element of the linear system has abnormal contact with the leaf of the web. We apply these ideas to reobtain a…
We completely characterize triangulations of the projective plane that have a spanning bipartite quadrangulation subgraph. This is an affirmative answer to a question by K\"undgen and Ramamurthi (J Combin Theory Ser B 85, 307--337, 2002)…
Suppose $k$ is a positive integer and $\mathcal{X}$ is a $k$-fold packing of the plane by infinitely many arc-connected compact sets, which means that every point of the plane belongs to at most $k$ sets. Suppose there is a function…
We give a general parametrization of all the recollement data for a triangulated category with a set of generators. From this we deduce a characterization of when a perfectly generated (or aisled) triangulated category is a recollement of…
The semistable minimal model program is a special case of the minimal model program concerning 3-folds fibred over a curve and birational morphisms preserving this structure. We classify semistable divisorial contractions which contract the…
Graph partitioning is the problem of dividing the nodes of a graph into balanced partitions while minimizing the edge cut across the partitions. Due to its combinatorial nature, many approximate solutions have been developed, including…
An efficient advanced numerical model for mapping the distribution of the buried tree roots is presented. It not only simplify the complicate root branches to an easy manipulated model, but also grasp the main structure of tree roots…
We consider discretization of the 'geometric cover problem' in the plane: Given a set $P$ of $n$ points in the plane and a compact planar object $T_0$, find a minimum cardinality collection of planar translates of $T_0$ such that the union…
Continuing results from JCDCGGG 2016 and 2017, we solve several new cases of the simple foldability problem -- deciding which crease patterns can be folded flat by a sequence of (some model of) simple folds. We give new efficient algorithms…
The famous pancake theorem states that for every finite set $X$ in the plane, there exist two orthogonal lines that divide $X$ into four equal parts. We propose an algorithm whose running time is linear in the number of points in $X$ and…