Skip to main content

A Note on Point Subsets with a Specified Number of Interior Points

  • Conference paper
Discrete and Computational Geometry (JCDCG 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2866))

Included in the following conference series:

Abstract

An interior point of a finite point set is a point of the set that is not on the boundary of the convex hull of the set. For any integer k ≥ 1, let g(k) be the smallest integer such that every set of points in the plane, no three collinear, containing at least g(k) interior points has a subset of points containing exactly k interior points. Similarly, for any integer k ≥ 3, let h(k) be the smallest integer such that every set of points in the plane, no three collinear, containing at least h(k) interior points has a subset of points containing exactly k or k+1 interior points. In this note, we show that g(k) ≥ 3k-1 for k ≥ 3. We also show that h(k) ≥ 2k+1 for 5 ≤ k ≤ 8, and h(k) ≥ 3k-7 for k ≥ 8.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avis, D., Hosono, K., Urabe, M.: On the existance of a point subset with 4 or 5 interior points. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol. 1763, pp. 57–64. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. Avis, D., Hosono, K., Urabe, M.: On the existence of a point subset with a specified number of interior points. Discrete Mathematics 241(1-3), 33–40 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Erdös, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Mathematica 2, 463–470 (1935)

    MATH  MathSciNet  Google Scholar 

  4. Horton, J.: Sets with no empty 7-gons. Canad. Math. Bull. 26, 482–484 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hosono, K., Károlyi, G., Urabe, M.: Constructions from empty polygons. In: Bezdek, A. (ed.) Discrete Geometry: in Honor of W. Kuperberg’s 60th Birthday, pp. 351–358. Marcel Dekker, New York (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fevens, T. (2003). A Note on Point Subsets with a Specified Number of Interior Points. In: Akiyama, J., Kano, M. (eds) Discrete and Computational Geometry. JCDCG 2002. Lecture Notes in Computer Science, vol 2866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44400-8_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-44400-8_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20776-4

  • Online ISBN: 978-3-540-44400-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics