Approximation Algorithm for the Largest Area Convex Hull of Same Size Non-overlapping Axis-Aligned Squares
Given a set of n equal size and non-overlapping axis-aligned squares, we need to choose exactly one point in each square to make the area of a convex hull of the resulting point set as large as possible. Previous algorithm  on this problem gives an optimal algorithm with O(n 3) running time. In this paper, we propose an approximation algorithm which runs in O(nlogn) time and gives a convex hull with area larger than the area of the optimal convex hull minus the area of one square.
KeywordsConvex Hull Imprecise Data Computational Geometry
Unable to display preview. Download preview PDF.
- 1.Akl, S.G., Toussaint, G.T.: Efficient convex hull algorithms for pattern recognition applications. In: Int. Joint Conf. on Pattern Recognition, Kyoto, Japan, pp. 483–487 (1978)Google Scholar
- 2.Beresford, A.R., Stajano, F.: Location Privacy in pervasive Computing. IEEE Pervasive Computing 2(1) (2003)Google Scholar
- 5.Gedik, B., Liu, L.: A customizable k-anonymity model for protecting location privacy. In: ICDCS (2005)Google Scholar