COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
We present an algorithm to reconstruct a collection of disjoint smooth closed curves from noisy samples. Our noise model assumes that the samples are obtained by first drawing po...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
Let τK be the worst-case (supremum) ratio of the weight of the minimum degree-K spanning tree to the weight of the minimum spanning tree, over all finite point sets in the Eu
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
Docking is the process by which two or several molecules form a complex. Docking involves the geometry of the molecular surfaces, as well as chemical and energetical consideration...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
We show how to construct an arrangement of n lines having a monotone path of length Ω(n2−(d/ √ log n)), where d > 0 is some constant, and thus nearly settle the long stan...