Join Our Newsletter

COMPGEOM

2010

ACM

9 years 8 months ago
2010

ACM

Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the memb...

COMPGEOM

2010

ACM

9 years 8 months ago
2010

ACM

COMPGEOM

2010

ACM

9 years 9 months ago
2010

ACM

We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...

COMPGEOM

2010

ACM

9 years 9 months ago
2010

ACM

Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...

COMPGEOM

2010

ACM

9 years 10 months ago
2010

ACM

We study the problem of computing the similarity between two piecewise-linear bivariate functions deﬁned over a common domain, where the surfaces they deﬁne in 3D—polyhedral...

COMPGEOM

2010

ACM

9 years 10 months ago
2010

ACM

In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...

COMPGEOM

2010

ACM

9 years 10 months ago
2010

ACM

Let P be a set of n points in R3 . The 2-center problem for P is to ﬁnd two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...

COMPGEOM

2010

ACM

9 years 10 months ago
2010

ACM

COMPGEOM

2010

ACM

9 years 10 months ago
2010

ACM

Sampling conditions for recovering the homology of a set using topological persistence are much weaker than sampling conditions required by any known algorithm for producing a top...

COMPGEOM

2010

ACM

9 years 10 months ago
2010

ACM