584 search results - page 6 / 117 » On the Number of Halving Planes |
COMPGEOM
2004
ACM
14 years 24 days 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...
BILDMED
2004
13 years 8 months ago
2004
In the practice of maxillofacial surgery, one major challenge is the correct reconstruction of malformed or damaged bone structures of the face. Among those, a rather frequent task...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
We show that for every fixed ? there is a quadratic time algorithm that decides whether a given graph has crossing number at most and, if this is the case, computes a drawing of t...
GD
2006
Springer
13 years 11 months ago
2006
Springer
We give a brief account of results concerning the number of triangulations on finite point sets in the plane, both for arbitrary sets and for specific sets such as the n
GD
2005
Springer
14 years 26 days ago
2005
Springer
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one co...