947 search results - page 99 / 190 » Discrete Geometry |
153
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
Let P be a set of n points in Ê3 , not all in a common plane. We solve a problem of Scott (1970) by showing that the connecting lines of P assume at least 2n − 7 different dir...
149
click to vote
CAAN
2004
Springer
15 years 11 months ago
2004
Springer
The web graph has been the focus of much recent attention, with several stochastic models proposed to account for its various properties. A survey of these models is presented, foc...
144
click to vote
COMPGEOM
2003
ACM
15 years 11 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...
154
click to vote
COMPGEOM
2003
ACM
15 years 11 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
174
click to vote
DGCI
2003
Springer
15 years 11 months ago
2003
Springer
We use a mathematical morphology approach to compute the surface and curve skeletons of a 3D object. We focus on the behaviour of the surface skeleton, in particular the reversibil...