Abstract
The k-sets of a set V of points in the plane are the subsets of k points of V that can be separated from the rest by a straight line. In order to find all the k-sets of V, one can build the so called k-set polygon whose vertices are the centroids of the k-sets of V. In this paper, we extend the classical convex-hull divide and conquer construction method to build the k-set polygon.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andrzejak, A., Fukuda, K.: Optimization over k-set polytopes and efficient k-set enumeration. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 1–12. Springer, Heidelberg (1999)
Andrzejak, A., Welzl, E.: In between k-sets, j-facets, and i-faces: (i,j)-partitions. Discrete Comput. Geom. 29, 105–131 (2003)
Brodal, G.S., Jacob, R.: Dynamic planar convex hull. In: Proc. 43rd Annu. Sympos. Found. Comput. Science, pp. 617–626 (2002)
Cole, R., Sharir, M., Yap, C.K.: On k-hulls and related problems. SIAM J. Comput. 16, 61–77 (1987)
Dey, T.K.: Improved bounds on planar k-sets and related problems. Discrete Comput. Geom. 19, 373–382 (1998)
El Oraiby, W., Schmitt, D.: k-sets of convex inclusion chains of planar point sets. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 339–350. Springer, Heidelberg (2006)
Jarvis, R.A.: On the identification of the convex hull of a finite set of points in the plane. Inform. Process. Lett. 2, 18–21 (1973)
Overmars, M.H., van Leeuwen, J.: Maintenance of configurations in the plane. J. Comput. Syst. Sci. 23, 166–204 (1981)
Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)
Toth, G.: Point sets with many k-sets. In: Proc. 16th Annu. ACM Sympos. Comput. Geom, pp. 37–42 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
El Oraiby, W., Schmitt, D. (2008). Divide and Conquer Method for k-Set Polygons. In: Ito, H., Kano, M., Katoh, N., Uno, Y. (eds) Computational Geometry and Graph Theory. KyotoCGGT 2007. Lecture Notes in Computer Science, vol 4535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89550-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-89550-3_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89549-7
Online ISBN: 978-3-540-89550-3
eBook Packages: Computer ScienceComputer Science (R0)