Sciweavers

Share
COMPGEOM
2011
ACM
9 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
9 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
9 years 2 months ago
Beating the spread: time-optimal point meshing
Gary L. Miller, Todd Phillips, Don Sheehy
COMPGEOM
2011
ACM
9 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
9 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...
COMPGEOM
2011
ACM
9 years 2 months ago
Reeb graphs: approximation and persistence
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...
Tamal K. Dey, Yusu Wang
COMPGEOM
2011
ACM
9 years 2 months ago
Minors in random and expanding hypergraphs
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...
Uli Wagner
COMPGEOM
2011
ACM
9 years 2 months ago
Sphere and dot product representations of graphs
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
Ross J. Kang, Tobias Müller
COMPGEOM
2011
ACM
9 years 2 months ago
Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains
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...
Thilo Beckmann, Rolf Klein, David Kriesel, Elmar L...
COMPGEOM
2011
ACM
9 years 2 months ago
Integer representations of convex polygon intersection graphs
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...
Tobias Müller, Erik Jan van Leeuwen, Jan van ...
books