Related papers: Convex Lattice Polygons with $k\ge3$ Interior Poin…
Motivated by long-standing conjectures on the discretization of classical inequalities in the Geometry of Numbers, we investigate a new set of parameters, which we call \emph{packing minima}, associated to a convex body $K$ and a lattice…
We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…
We demonstrate in an elementary way how to construct a frieze pattern of width $m-3$ from a partition of a convex $m$-gon by not intersecting diagonals.
One of the earliest and most well known problems in computational geometry is the so-called art gallery problem. The goal is to compute the minimum possible number guards placed on the vertices of a simple polygon in such a way that they…
We study three families of polyhedral cones whose sections are regular simplices, cubes, and crosspolytopes. We compute solid angles and conic intrinsic volumes of these cones. We show that several quantities appearing in stochastic…
The standard method for constructing generating vectors for good lattice point sets is the component-by-component construction. Numerical experiments have shown that the generating vectors found by these constructions sometimes tend to have…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
We explore an Art Gallery variant where each point of a polygon must be seen by k guards, and guards cannot see through other guards. Surprisingly, even covering convex polygons under this variant is not straightforward. For example,…
This paper treats triangles in the plane whose vertices lie on the integer lattice, i.e., the vertices have integer coordinates. It shows that apart from trivial examples, the circumcenter, centroid and orthocenter of such triangles never…
We study the existence of equilateral polygons in planar integer lattices. Maehara showed that it's sufficient to work with rectangular lattices $\Lambda(m) = L[(1,0),(0,\sqrt{m})]$ with $m \equiv 3 \pmod{4}$. Building on results of Maehara…
It is known that, adding the number of lattice points lying on the boundary of a reflexive polygon and the number of lattice points lying on the boundary of its polar, always yields 12. Generalising appropriately the notion of reflexivity,…
Given a finite set $A \subseteq \mathbb{R}^d$, points $a_1,a_2,\dotsc,a_{\ell} \in A$ form an $\ell$-hole in $A$ if they are the vertices of a convex polytope which contains no points of $A$ in its interior. We construct arbitrarily large…
Enumeration of various types of lattice polygons and in particular polyominoes is of primary importance in many machine learning, pattern recognition, and geometric analysis problems. In this work, we develop a large deviation principle for…
In this paper we investigate multivariate integration in weighted unanchored Sobolev spaces of smoothness of arbitrarily high order. As quadrature points we employ higher order polynomial lattice point sets over $\mathbb{F}_{2}$ which are…
We provide a multidimensional extension of previous results on the existence of polynomial progressions in dense subsets of the primes. Let $A$ be a subset of the prime lattice - the d-fold direct product of the primes - of positive…
Interior point methods for solving linearly constrained convex programming involve a variable projection matrix at each iteration to deal with the linear constraints. This matrix often becomes ill-conditioned near the boundary of the…
The main objective of this thesis is a classification project for integral lattices. Using Kneser's neighbour method we have developed the computer program tn to classify complete genera of integral lattices. Main results are detailed…
A high-level description of an algorithm which computes the minimum perimeter triangle enclosing a convex polygon in linear time exists in the literature. Besides that an implementation of the algorithm is given in the subsequent work.…
We consider a problem in computational origami. Given a piece of paper as a convex polygon $P$ and a point $f$ located within, fold every point on a boundary of $P$ to $f$ and compute a region that is safe from folding, i.e., the region…
There is a hierarchy of structure conditions for convex sets. In this paper we study a recently defined [3, 8, 9] condition called locally nonconical convexity (abbreviated LNC). Is is easy to show that every strictly convex set is LNC, as…