16 search results - page 1 / 4 » compgeom 2011 |
COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
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
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
12 years 8 months 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
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...