Skip to main content

Convex Hulls of Point-Sets and Non-uniform Hypergraphs

  • Conference paper
Algorithmic Aspects in Information and Management (AAIM 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4508))

Included in the following conference series:

Abstract

For fixed integers k ≥ 3 and hypergraphs \({\mathcal G}\) on N vertices, which contain edges of cardinalities at most k, and are uncrowded, i.e., do not contain cycles of lengths 2,3, or 4, and with average degree for the i-element edges bounded by O(T i − 1 ·(ln T)(k − i)/(k − 1)), i = 3, ..., k, for some number T ≥ 1, we show that the independence number \(\alpha ({\mathcal G})\) satisfies \(\alpha ({\mathcal G}) = \Omega ((N/T) \cdot (\ln T)^{1/(k-1)})\). Moreover, an independent set I of size |I| = Ω((N/T) ·(ln T)1/(k − 1)) can be found deterministically in polynomial time. This extends a result of Ajtai, Komlós, Pintz, Spencer and Szemerédi for uncrwoded uniform hypergraphs. We apply this result to a variant of Heilbronn’s problem on the minimum area of the convex hull of small sets of points among n points in the unit square [0,1]2.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ajtai, M., Komlós, J., Pintz, J., Spencer, J., Szemerédi, E.: Extremal Uncrowded Hypergraphs. Journal of Combinatorial Theory Ser. A 32, 321–335 (1982)

    Article  MATH  Google Scholar 

  2. Barequet, G.: A Lower Bound for Heilbronn’s Triangle Problem in d Dimensions. SIAM Journal on Discrete Mathematics 14, 230–236 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. Barequet, G., Naor, J.: Large k − D Simplices in the D-Dimensional Unit Cube. In: Proceedings ‘17th Canadian Conference on Computational Geometry’, pp. 30–33 (2005)

    Google Scholar 

  4. Barequet, G., Shaikhet, A.: The On-Line Heilbronn’s Triangle Problem in d Dimensions. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 408–417. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Bertram–Kretzberg, C., Lefmann, H.: The Algorithmic Aspects of Uncrowded Hypergraphs. SIAM Journal on Computing 29, 201–230 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bertram-Kretzberg, C., Hofmeister, T., Lefmann, H.: An Algorithm for Heilbronn’s Problem. SIAM Journal on Computing 30, 383–390 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. Brass, P.: An Upper Bound for the d-Dimensional Analogue of Heilbronn’s Triangle Problem. SIAM Journal on Discrete Mathematics 19, 192–195 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Chazelle, B.: Lower Bounds on the Complexity of Polytope Range Searching. Journal of the American Mathematical Society 2, 637–666 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  9. Duke, R.A., Lefmann, H., Rödl, V.: On Uncrowded Hypergraphs. Random Structures & Algorithms 6, 209–212 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  10. Fundia, A.: Derandomizing Chebychev’s Inequality to find Independent Sets in Uncrowded Hypergraphs. Random Structures & Algorithms 8, 131–147 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  11. Komlós, J., Pintz, J., Szemerédi, E.: On Heilbronn’s Triangle Problem. Journal of the London Mathematical Society 24, 385–396 (1981)

    Article  MATH  Google Scholar 

  12. Komlós, J., Pintz, J., Szemerédi, E.: A Lower Bound for Heilbronn’s Problem. Journal of the London Mathematical Society 25, 13–24 (1982)

    Article  MATH  Google Scholar 

  13. Lefmann, H.: Distributions of Points in d Dimensions and Large k-Point Simplices. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 514–523. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Lefmann, H.: Distributions of Points in the Unit-Square and Large k-Gons. In: Proceedings ‘16th ACM-SIAM Symposium on Discrete Algorithms SODA’, ACM and SIAM, pp. 241–250. ACM, New York (2005)

    Google Scholar 

  15. Roth, K.F.: On a Problem of Heilbronn. Journal of the London Mathematical Society 26, 198–204 (1951)

    Article  MATH  Google Scholar 

  16. Roth, K.F.: On a Problem of Heilbronn, II, and III. Proc. of the London Mathematical Society 25(3), 193–212, and 543–549 (1972)

    Google Scholar 

  17. Roth, K.F.: Estimation of the Area of the Smallest Triangle Obtained by Selecting Three out of n Points in a Disc of Unit Area. In: Proc. of Symposia in Pure Mathematics. 24, pp. 251–262. AMS, Providence (1973)

    Google Scholar 

  18. Roth, K.F.: Developments in Heilbronn’s Triangle Problem. Advances in Mathematics 22, 364–385 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  19. Schmidt, W.M.: On a Problem of Heilbronn. Journal of the London Mathematical Society 4(2), 545–550 (1972)

    Article  MATH  Google Scholar 

  20. Spencer, J.: Turán’s Theorem for k-Graphs. Discrete Mathematics 2, 183–186 (1972)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ming-Yang Kao Xiang-Yang Li

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Lefmann, H. (2007). Convex Hulls of Point-Sets and Non-uniform Hypergraphs. In: Kao, MY., Li, XY. (eds) Algorithmic Aspects in Information and Management. AAIM 2007. Lecture Notes in Computer Science, vol 4508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72870-2_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72870-2_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72868-9

  • Online ISBN: 978-3-540-72870-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics