35 search results - page 3 / 7 » compgeom 2003 |
44
Voted
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
COMPGEOM
2003
ACM
15 years 2 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
15 years 2 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...
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and ascending manifolds of all critical points. In the generic case, its ...