DOI QR코드

DOI QR Code

Computing the Dominating-Free Set by Two Point Sets in the Plane

  • Kim, Soo-Hwan (Department of Embedded IT, Pusan University of Foreign Studies)
  • Received : 2011.01.10
  • Accepted : 2011.02.07
  • Published : 2011.01.01

Abstract

In this paper, we study the dominating-free sest which is defined as follows: k points called servers and n points called clients in the plane are given. For a point p in the plane is said to be dominated by a client c if for every server s, the distance between s and p is greater than the distance between s and c. The dominating-free set is the set of points in the plane which aren't dominated by any client. We present an O(nklogk+$n^2k$) time algorithm for computing the dominating-free set under the $L_1$-metric. Specially, we present an O(nlogn) time algorithm for the problem when k=2. The algorithm uses some variables and 1-dimensional arrays as its principle data structures, so it is easy to implement and runs fast.

Keywords

References

  1. S. Borzsönyi, D. Kossmann, and K. Stocker, "The skyline operator," Proc. 17th International Conference on Data Engineering, pp. 421- 430, 2001.
  2. D. Papadias, Y. Tao, G. Fu, B. Seeger, "An optimal and progressive algorithm for skyline queries," Proc. the 2003 ACM SIGMOD international conference on Management of data, pp. 467-478, 2003.
  3. M. Sharifzadeh and C. Shahabi, "The Spatial Skyline Queries," Proc. the 32nd international conference on Very large data bases, pp. 751-762, 2006.
  4. W. Son, M. W. Lee, H. K. Ahn, and S. Hwang, "Spatial Skyline Queries: An Efficient Geometric Algorithm," Proc. The 11th International Symposium on Advances in Spatial and Temporal Databases, pp. 247-264, 2009.
  5. K. Deng, X. Zhou, and H. T. Shen, "Multi-source skyline query processing in road networks," Proc. 23th International Conference on Data Engineering, pp. 796-805, 2007.
  6. Wanbin Son and Hee-Kap Ahn, "Computing the Skyline of a Point Set with a Highway," Proc. Korea Computer Congress 2009, Vol. 36, No. 1, 2009.
  7. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, pp. 345-350, 1985.
  8. J.-R. Sack, "Rectilinear Computational Geometry," Ph. D. Dissertation, School of Comput. Sci., Carleton University, Ottawa, Canada, 1984.