COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
A graph G is a k-sphere graph if there are k-dimensional real vectors v1, . . . , vn such that ij ∈ E(G) if and only if the distance between vi
COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
Several recent works considered cooperative cleaning in static and dynamic environments, which incorporates a swarm of simple robots cleaning an expanding region of contaminated c...
COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
Abstract. We study the grid size that is needed to represent intersection graphs of convex polygons. Here the polygons are similar to a base polygon P whose corners have rational c...
COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
We report on a generic uni- and bivariate algebraic kernel that is publicly available with Cgal 3.7. It comprises complete, correct, though efficient state-of-the-art implementati...
COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...