Sciweavers

8 search results - page 2 / 2
» Finding monochromatic l-shapes in bichromatic point sets
Sort
View
CCCG
2009
13 years 6 months ago
The Bichromatic Rectangle Problem in High Dimensions
Given a set of blue points and a set of red points in ddimensional space, we show how to find an axis-aligned hyperrectangle that contains no red points and as many blue points as...
Jonathan Backer, J. Mark Keil
ICDE
2009
IEEE
180views Database» more  ICDE 2009»
14 years 7 months ago
Reverse Furthest Neighbors in Spatial Databases
Given a set of points P and a query point q, the reverse furthest neighbor (RFN) query fetches the set of points p P such that q is their furthest neighbor among all points in P {...
Bin Yao, Feifei Li, Piyush Kumar
FSTTCS
2006
Springer
13 years 9 months ago
Computing a Center-Transversal Line
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...
Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sel...