Related papers: Triangulating the Real Projective Plane

Given a collection of points in the plane, classifying which subsets are collinear is a natural problem and is related to classical geometric constructions. We consider collections of points in a projective plane over a finite field such…

We give explicit parametric equations for all irreducible plane projective sextic curves which have at most double points and whose total Milnor number is maximal (is equal to 19). In each case we find a parametrization over a number field…

We prove the projective plane $\rp^2$ is an absolute extensor of a finite-dimensional metric space $X$ if and only if the cohomological dimension mod 2 of $X$ does not exceed 1. This solves one of the remaining difficult problems (posed by…

Given a real algebraic curve, embedded in projective space, we study the computational problem of deciding whether there exists a hyperplane meeting the curve in real points only. More generally, given any divisor on such a curve, we may…

For an arrangement of $n$ lines in the real projective plane, we denote by $f$ the number of regions into which the real projective plane is divided by the lines. Using Bojanowski's inequality, we establish a new lower bound for $f$. In…

Working over the field of order 2 we consider those complete caps (maximal sets of points with no three collinear) which are disjoint from some codimension 2 subspace of projective space. We derive restrictive conditions which such a cap…

Triangulation refers to the problem of finding a 3D point from its 2D projections on multiple camera images. For solving this problem, it is the common practice to use so-called optimal triangulation method, which we call the L2 method in…

We prove the following generalised empty pentagon theorem: for every integer $\ell \geq 2$, every sufficiently large set of points in the plane contains $\ell$ collinear points or an empty pentagon. As an application, we settle the next…

In the paper, we consider the rigidity problem of the infinite hexagonal triangulation of the plane under the piecewise linear conformal changes introduced by Luo in [5]. Our result shows that if a geometric hexagonal triangulation of the…

We prove that it is $\#\mathsf{P}$-complete to count the triangulations of a (non-simple) polygon.

A polarity of a projective plane is a map, often assumed to be involutive, mapping a generic point to a generic line and reciprocally. The most classical polarity is the polarity with respect to a conic, but other exist: the harmonic…

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

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…

We give some new advances in the research of the maximum number of triangles that we may obtain in a simple arrangements of n lines or pseudo-lines.

Given two rational, properly parametrized space curves ${\mathcal C}_1$ and ${\mathcal C}_2$, where $\CCC_2$ is contained in some plane $\Pi$, we provide an algorithm to check whether or not there exist perspective or parallel projections…

We discuss different approaches for the enumeration of triangulated surfaces. In particular, we enumerate all triangulated surfaces with 9 and 10 vertices. We also show how geometric realizations of orientable surfaces with few vertices can…

A set P of points in R^2 is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no n-universal point set of size n, for any n>=15. Conversely,…

Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than 180 degrees. In this paper we prove that the opposite statement is also true, namely that planar…

In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a…

Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and classified these configurations, as an inverse problem of the Erd\H{o}s distinct distances problem. We consider the analogous problem for…