DGCI

2013

Springer

10 years 4 months ago
2013

Springer

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...

COCOON

2011

Springer

12 years 9 months ago
2011

Springer

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...

COCOA

2011

Springer

12 years 9 months ago
2011

Springer

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...

COCOA

2011

Springer

12 years 9 months ago
2011

Springer

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...

DGCI

2011

Springer

13 years 22 days ago
2011

Springer

In this work, we propose a framework that allows to build morphological operators for processing and ﬁltering objects deﬁned on t) simplicial complex spaces. We illustrate with...

COMPGEOM

2011

ACM

13 years 24 days ago
2011

ACM

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...

COMPGEOM

2011

ACM

13 years 24 days ago
2011

ACM

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...

COMPGEOM

2011

ACM

13 years 24 days ago
2011

ACM

COMPGEOM

2011

ACM

13 years 24 days ago
2011

ACM

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 ﬁnd the edges of the c...

COMPGEOM

2011

ACM

13 years 24 days ago
2011

ACM

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...