The relation between a straight line and its digitization as a digital straight line is often expressed using a notion of proximity. In this contribution, we consider the covering...
A d-dimensional polycube of size n is a connected set of n cubes in d dimensions, where connectivity is through (d−1)-dimensional faces. Enumeration of polycubes, and, in particu...
Andrei Asinowski, Gill Barequet, Ronnie Barequet, ...
Biological networks are commonly used to model molecular activity within the cell. Recent experimental studies have shown that the detection of conserved subnetworks across several...
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economi...
In this work, we propose a framework that allows to build morphological operators for processing and filtering objects defined on t) simplicial complex spaces. We illustrate with...
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
Nikola Milosavljevic, Dmitriy Morozov, Primoz Skra...
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...