Advertisement

Discrete & Computational Geometry

, Volume 17, Issue 3, pp 307–318 | Cite as

A combinatorial property of convex sets

  • M. AbellanasEmail author
  • G. HernandezEmail author
  • R. KleinEmail author
  • V. Neumann-Lara
  • J. UrrutiaEmail author
Article

Abstract

A known result in combinatorial geometry states that any collection Pn of points on the plane contains two such that any circle containing them contains n/c elements of Pn, c a constant. We prove: Let Φ be a family of n noncrossing compact convex sets on the plane, and let S be a strictly convex compact set. Then there are two elements Si, Sj of Φ such that any set S′ homothetic to S that contains them contains n/c elements of Φ, c a constant (S is homothetic to S if 5’ = λS + v, where λ is a real number greater than 0 and v is a vector of ℜ2). Our proof method is based on a new type of Voronoi diagram, called the “closest covered set diagram” based on a convex distance function. We also prove that our result does not generalize to higher dimensions; we construct a set Φ of n disjoint convex sets in ℜ3)3 such that for any nonempty subset ΦHh of Φ there is a sphere SH containing all the elements of ΦH, and no other element of Φ.

Keywords

Nonempty Subset Voronoi Diagram Convex Polygon Combinatorial Property Voronoi Region 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    I. Bárány and D. G. Larman, A combinatorial property of points and ellipsoids, Discrete Comput. Geom. 5 (1990), 375–382.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    I. Bárány, J. H. Schmerl, S. J. Sidney, and J. Urrutia, A combinatorial result about points and balls in Euclidean space, Discrete Comput. Geom. 4 (1989), 259–262.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    P. Chew and S. Drysdale, Voronoi diagrams based on convex distance functions, Proc. 1st ACM Symposium on Computational Geometry, Baltimore, MD, 1985, pp. 235–244.Google Scholar
  4. 4.
    H. Edelsbrunner, N. Hasan, R. Seidel, and X. J. Shen, Circles through two points that always enclose many points, Geom. Dedicata 32 (1989), 1–12.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    P. C. Fishburn, Interval orders and circle orders, Order 5 (1988), 225–234.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    R. Hyward, A note on the circle containment problem, Discrete Comput. Geom. 4 (1989), 263–264.CrossRefMathSciNetGoogle Scholar
  7. 7.
    R. Hyward, D. Rappaport, and R. Wenger, Some extremal results on circles containing points, Discrete Comput. Geom. 4 (1989), 253–258.CrossRefMathSciNetGoogle Scholar
  8. 8.
    Ch. Ickling, R. Klein, M. Le, and L. Ma, Convex distance functions in 3-space are different, Proc. 9th ACM Symposium on Computational Geometry, 1993, pp. 116–123.Google Scholar
  9. 9.
    R. Klein, K. Melhorn, and S. Meiser, Randomized incremental construction of abstract Voronoi diagrams, Comput. Geom. Theory Appl. 3 (1993), 157–184.zbMATHGoogle Scholar
  10. 10.
    V. Neumann-Lara and J. Urrutia, A combinatorial result on points and circles in the plane, Discrete Math. 69(1988), 173–178.zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    J. Urrutia, Partial orders and Euclidean geometry, in Algorithms and Order, ed. I. Rival, Kluwer, Boston, MA, 1989, pp. 387–434.Google Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  1. 1.Dept. de Matemática AplicadaUniversidad Politecnica de Madrid, Campus de MontegancedoMadridSpain
  2. 2.Praktische Informatik VIFern Universität HagenHagenGermany
  3. 3.Universidad Nacional Antonoma de MéxicoMexico
  4. 4.Department of Computer ScienceUniversity of OttawaOttawaCanada

Personalised recommendations