Abstract
We study two problems concerning the maximal and convex layers of a point set in d dimensions. The first is the average-case complexity of computing the first k layers of a point set drawn from a uniform or component-independent (CI) distribution. We show that, for \(d \in \{2,3\}\), the first \(n^{1/d-\epsilon }\) maximal layers can be computed using \(dn + o(n)\) scalar comparisons with high probability. For \(d \ge 4\), the first \(n^{1/2d-\epsilon }\) maximal layers can be computed within this bound with high probability. The first \(n^{1/d-\epsilon }\) convex layers in 2D, the first \(n^{1/2d-\epsilon }\) convex layers in 3D, and the first \(n^{1/(d^2+2)}\) convex layers in \(d \ge 4\) dimensions can be computed using \(2dn + o(n)\) scalar comparisons with high probability. Since the expected number of maximal layers in 2D is \(2\sqrt{n}\), our result for 2D maximal layers shows that it takes \(dn + o(n)\) scalar comparisons to compute a \(1/n^\epsilon \)-fraction of all layers in the average case. The second problem is bounding the expected size of the kth maximal and convex layer. We show that the kth maximal and convex layer of a point set drawn from a continuous CI distribution in d dimensions has expected size \(O(k^d \log ^{d-1} (n/k^d))\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Note that \(\bigcup _{i=1}^k Q_i'\) is not a subset of the first k \(\sigma \)-skyline of S. A counterexample will be given in the full version of this paper.
References
Bentley, J.L., Clarkson, K.L., Levine, D.B.: Fast linear expected-time algorithms for computing maxima and convex hulls. Algorithmica 9(2), 168–183 (1993)
Bentley, J.L., Kung, H.T., Schkolnick, M., Thompson, C.D.: On the average number of maxima in a set of vectors and applications. J. ACM 25(4), 536–543 (1978)
de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-77974-2
Blunck, H., Vahrenhold, J.: In-place algorithms for computing (layers of) maxima. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 363–374. Springer, Heidelberg (2006). https://doi.org/10.1007/11785293_34
Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings of the 17th International Conference on Data Engineering, pp. 421–430 (2001)
Buchsbaum, A.L., Goodrich, M.T.: Three-dimensional layers of maxima. Algorithmica 39(4), 275–286 (2004)
Chazelle, B.: An optimal convex hull algorithm in any fixed dimension. Discret. Comput. Geom. 10(4), 377–409 (1993)
Chazelle, B.: On the convex layers of a planar set. IEEE Trans. Inf. Theor. 31(4), 509–517 (2006)
Dalal, K.: Counting the onion. Random Struct. Algorithms 24(2), 155–165 (2004)
Frieze, A.: On the length of the longest monotone subsequence in a random permutation. Ann. Appl. Probab. 1(2), 301–305 (1991)
Golin, M.J.: A provably fast linear-expected-time maxima-finding algorithm. Algorithmica 11(6), 501–524 (1994)
Kung, H.T., Luccio, F., Preparata, F.P.: On finding the maxima of a set of vectors. J. ACM 22(4), 469–476 (1975)
Matoušek, J., Plecháč, P.: On functional separately convex hulls. Discret. Comput. Geom. 19(1), 105–130 (1998)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)
Nielsen, F.: Output-sensitive peeling of convex and maximal layers. Inf. Process. Lett. 59(5), 255–259 (1996)
Okabe, A., Boots, B., Sugihara, K., Chiu, S., Kendall, D.G.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. Wiley, Hoboken (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
He, M., Nguyen, C.P., Zeh, N. (2018). Maximal and Convex Layers of Random Point Sets. In: Bender, M., Farach-Colton, M., Mosteiro, M. (eds) LATIN 2018: Theoretical Informatics. LATIN 2018. Lecture Notes in Computer Science(), vol 10807. Springer, Cham. https://doi.org/10.1007/978-3-319-77404-6_44
Download citation
DOI: https://doi.org/10.1007/978-3-319-77404-6_44
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-77403-9
Online ISBN: 978-3-319-77404-6
eBook Packages: Computer ScienceComputer Science (R0)