235 search results - page 4 / 47 » The Complexity of Separating Points in the Plane |
247
click to vote
GMP
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract. Riemann surfaces naturally appear in the analysis of complex functions that are branched over the complex plane. However, they usually possess a complicated topology and ...
163
click to vote
ICML
1998
IEEE
16 years 6 months ago
1998
IEEE
Computational comparison is made between two feature selection approaches for nding a separating plane that discriminates between two point sets in an n-dimensional feature space ...
170
click to vote
CCCG
2008
15 years 7 months ago
2008
We prove a tight asymptotic bound of ( log(n/)) on the worst case computational complexity of the convex hull of the union of two convex objects of sizes summing to n requiring o...
179
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
In this paper, we consider the problem of choosing disks (that we can think of as corresponding to wireless sensors) so that given a set of input points in the plane, there exists ...
156
click to vote
IPL
2002
15 years 5 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...