Related papers: On empty pentagons and hexagons in planar point se…

The polygon retrieval problem on points is the problem of preprocessing a set of $n$ points on the plane, so that given a polygon query, the subset of points lying inside it can be reported efficiently. It is of great interest in areas such…

We give conditions for $k$-point configuration sets of thin sets to have nonempty interior, applicable to a wide variety of configurations. This is a continuation of our earlier work \cite{GIT19} on 2-point configurations, extending a…

We present a short proof, relaying on the divergence theorem, verifying that minimal sets in the plane are trivial.

In this paper, we obtain the counting formulaes of convex pentagons and convex hexagons, respectively, in an $n$-triangular net by solving the corresponding recursive formulaes.

Let $P$ be a $k$-colored set of $n$ points in the plane, $4 \leq k \leq n$. We study the problem of deciding if $P$ contains a subset of four points of different colors such that its Rectilinear Convex Hull has positive area. We show this…

We use the concept of production matrices to show that there exist sets of $n$ points in the plane that admit $\Omega(42.11^n)$ crossing-free geometric graphs. This improves the previously best known bound of $\Omega(41.18^n)$ by Aichholzer…

We characterize the number of points for which there exist non-empty Terracini sets of points in $\mathbb{P}^n$. Then we study minimally Terracini finite sets of points in $\mathbb{P}^n$ and we obtain a complete description in the case of…

Erd\H{o}s asked what is the maximum number $\alpha(n)$ such that every set of $n$ points in the plane with no four on a line contains $\alpha(n)$ points in general position. We consider variants of this question for $d$-dimensional point…

In 1996, Matheson and Tarjan proved that every near planar triangulation on $n$ vertices contains a dominating set of size at most $n/3$, and conjectured that this upper bound can be reduced to $n/4$ for planar triangulations when $n$ is…

We study a generalization of additive bases into a planar setting. A planar additive basis is a set of non-negative integer pairs whose vector sumset covers a given rectangle. Such bases find applications in active sensor arrays used in,…

For every pattern $P$, consisting of a finite set of points in the plane, $S_{P}(n,m)$ is defined as the largest number of similar copies of $P$ among sets of $n$ points in the plane without $m$ points on a line. A general construction,…

Given a set $S \subseteq \mathbb{R}^d$, a hollow polytope has vertices in $S$ but contains no other point of $S$ in its interior. We prove upper and lower bounds on the maximum number of vertices of hollow polytopes whose facets are…

We provide a solution method for the polyhedral convex set optimization problem, that is, the problem to minimize a set-valued mapping with polyhedral convex graph with respect to a set ordering relation which is generated by a polyhedral…

We study the Tukey layers and convex layers of a planar point set, which consists of $n$ points independently and uniformly sampled from a convex polygon with $k$ vertices. We show that the expected number of vertices on the first $t$ Tukey…

A point set $M$ in Euclidean plane is called an integral point set in semi-general position if all the distances between the elements of $M$ are integers, and $M$ does not contain collinear triples. We improve the lower bound for diameter…

We establish a Poincar\`E-Bendixson type result for a weighted averaged infinite horizon problem in the plane, with and without averaged constraints. For the unconstrained problem, we establish the existence of a periodic optimal solution,…

In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of planar graphs that cannot be represented by pentagons. We also…

Given two points in the plane, and a set of "obstacles" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for the minimum-weight subset of the obstacles separating the two points.…

A set of points a 1 ,. .. , a n fixes a planar convex body K if the points are on bdK, the boundary of K, and if any small move of K brings some point of the set in intK, the interior of K. The points a 1 ,. .. , a n $\in$ bdK almost fix K…

For k >= 3, a k-angulation is a 2-connected plane graph in which every internal face is a k-gon. We say that a point set P admits a plane graph G if there is a straight-line drawing of G that maps V(G) onto P and has the same facial cycles…