Related papers: Can we "seamlessly" divide a polygon?
In the geometric theory of defects, media with a spin structure, for example, ferromagnet, is considered as a manifold with given Riemann--Cartan geometry. We consider the case with the Euclidean metric corresponding to the absence of…
In this Master of Science Thesis I introduce geometric algebra both from the traditional geometric setting of vector spaces, and also from a more combinatorial view which simplifies common relations and operations. This view enables us to…
The over-segmentation into superpixels is an important preprocessing step to smartly compress the input size and speed up higher level tasks. A superpixel was traditionally considered as a small cluster of square-based pixels that have…
This is the English translation of Leonhard Euler's Latin paper "De solidis quorum superficiem in planum explicare licet". Euler explains several methods to obtain equations for developable surfaces. Therefore, this paper might be…
Three different representation of the proper Euclidean geometry are considered. They differ in the number of basic elements, from which the geometrical objects are constructed. In E-representation there are three basic elements (point,…
A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…
Semantic segmentation aims to robustly predict coherent class labels for entire regions of an image. It is a scene understanding task that powers real-world applications (e.g., autonomous navigation). One important application, the use of…
Determining if a point is in a polygon or not is used by a lot of applications in computer graphics, computer games and geoinformatics. Implementing this check is error-prone since there are many special cases to be considered. This holds…
We give a simple and complete description of those convex lattice polygons in the plane that can be dissected into lattice triangles of integer area. A new version of Sperner's Lemma plays a central role.
Symmetry breaking for graphs and other combinatorial objects is notoriously hard. On the one hand, complete symmetry breaks are exponential in size. On the other hand, current, state-of-the-art, partial symmetry breaks are often considered…
Alexandrov spaces are defined via axioms similar to those given by Euclid. The Alexandrov axioms replace certain equalities with inequalities. Depending on the signs of the inequalities, we obtain Alexandrov spaces with curvature bounded…
Given a set of objects $O$ in the plane, the corresponding intersection graph is defined as follows. Each object defines a vertex and an edge joins two vertices whenever the corresponding objects intersect. We study here the case of unit…
New ray-optical elements allow generalized refraction of light rays, but geometry imposes limitations on possible mappings between the positions of an object and its geometric image. Here I study the case of an infinite, planar,…
We initiate the study of convex geometry over ordered hyperfields. We define convex sets and halfspaces over ordered hyperfields, presenting structure theorems over hyperfields arising as quotients of fields. We prove hyperfield analogues…
The proper Euclidean geometry is considered to be metric space and described in terms of only metric and finite metric subspaces (sigma-immanent description). Constructing the geometry, one does not use topology and topological properties.…
A general definition of mathematical morphology has been defined within the algebraic framework of complete lattice theory. In this framework, dealing with deterministic and increasing operators, a dilation (respectively an erosion) is an…
This paper first gives a brief overview over some interesting descriptions of conic sections, showing formulations in the three geometric algebras of Euclidean spaces, projective spaces, and the conformal model of Euclidean space. Second…
Image segmentation is a central topic in image processing and computer vision and a key issue in many applications, e.g., in medical imaging, microscopy, document analysis and remote sensing. According to the human perception, image…
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…
When regularity lemmas were first developed in the 1970s, they were described as results that promise a partition of any graph into a ``small'' number of parts, such that the graph looks ``similar'' to a random graph on its edge subsets…