Skip to main content
Article thumbnail
Location of Repository

Previous Up Next Article Citations From References: 1 From Reviews: 0

By Mr (review C (u, Sergey N. (-txd, J. M. [díaz-báñez, José-miguel (e-sevl-ndm, Dolores (mex-nam-ndm) Pérez-lantero, Carlos (e-upb-ndm) Urrutia and Jorge (mex-nam-im


On the coarseness of bicolored point sets. (English summary) Comput. Geom. 46 (2013), no. 1, 65–77. Summary: “Let R be a set of red points and B a set of blue points on the plane. In this paper we introduce a new concept, which we call coarseness, for measuring how blended the elements of S = R ∪ B are. For X ⊆ S, let ∇(X) = ||X ∩ R | − |X ∩ B| | be the bichromatic discrepancy of X. We say that a partition Π = {S1, S2,..., Sk} of S is convex if the convex hulls of its members are pairwise disjoint. The discrepancy of a convex partition Π of S is the minimum ∇(Si) over the elements of Π. The coarseness of S is the discrepancy of the convex partition of S with maximum discrepancy. We study the coarseness of bicolored point sets, and relate it to well blended point sets. In particular, we show combinatorial results on the coarseness of general configurations and give efficient algorithms for computing the coarseness of two specific cases, namely when the set of points is in convex position and when the measure is restricted to convex partitions with tw

Year: 2013
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.