IJCGA
2006
13 years 4 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...