Sciweavers

Share
DGCI
2013
Springer
5 years 5 months ago
Optimal Covering of a Straight Line Applied to Discrete Convexity
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...
Jean-Marc Chassery, Isabelle Sivignon
COCOON
2011
Springer
7 years 10 months ago
Proper n-Cell Polycubes in n - 3 Dimensions
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, ...
COCOA
2011
Springer
7 years 10 months ago
Algorithmic Aspects of Heterogeneous Biological Networks Comparison
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...
Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-B...
COCOA
2011
Springer
7 years 10 months ago
The Complexity of Testing Monomials in Multivariate Polynomials
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...
Zhixiang Chen, Bin Fu
DGCI
2011
Springer
8 years 1 months ago
Some Morphological Operators on Simplicial Complex Spaces
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...
Fabio Dias, Jean Cousty, Laurent Najman
COMPGEOM
2011
ACM
8 years 2 months ago
On the structure and composition of forbidden sequences, with geometric applications
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...
Seth Pettie
COMPGEOM
2011
ACM
8 years 2 months ago
Zigzag persistent homology in matrix multiplication time
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...
COMPGEOM
2011
ACM
8 years 2 months ago
Beating the spread: time-optimal point meshing
Gary L. Miller, Todd Phillips, Don Sheehy
COMPGEOM
2011
ACM
8 years 2 months ago
Three problems about dynamic convex hulls
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...
Timothy M. Chan
COMPGEOM
2011
ACM
8 years 2 months ago
Metric graph reconstruction from noisy data
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...
Mridul Aanjaneya, Frédéric Chazal, D...
books