Computational geometry: an introduction
Computational geometry: an introduction
Average case analysis of dynamic geometric optimization
Computational Geometry: Theory and Applications
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Location Privacy in Pervasive Computing
IEEE Pervasive Computing
Capturing the Uncertainty of Moving-Object Representations
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Querying Imprecise Data in Moving Object Environments
IEEE Transactions on Knowledge and Data Engineering
Probabilistic skylines on uncertain data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Keyword Search in Spatial Databases: Towards Searching by Document
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data
IEEE Transactions on Knowledge and Data Engineering
Superseding Nearest Neighbor Search on Uncertain Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
Computing minimum diameter color-spanning sets
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Preserving user location privacy in mobile data management infrastructures
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Computing minimum diameter color-spanning sets is hard
Information Processing Letters
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
| Hi-index | 0.00 |
In this paper we study several geometric problems of color-spanning sets: given N points with M colors in the plane, choosing M points with distinct colors such that some geometric properties of those M points are minimized or maximized. The geometric properties studied in this paper are the maximum diameter, the largest closest pair, and the minimum planar spanning tree. We give an O(N logN) expected time algorithm for the maximum diameter problem. For the largest closest pair and the minimum planar spanning tree problems, we give hardness proofs.