منابع مشابه
06 Drawing Colored Graphs on Colored Points
Let G be a planar graph with n vertices whose vertex set is partitioned into subsets V0, . . . , Vk−1 for some positive integer 1 ≤ k ≤ n and let S be a set of n distinct points in the plane partitioned into subsets S0, . . . , Sk−1 with |Vi| = |Si| (0 ≤ i ≤ k − 1). This paper studies the problem of computing a crossing-free drawing of G such that each vertex of Vi is mapped to a distinct point...
متن کاملDrawing Colored Graphs on Colored Points
Let G be a planar graph with n vertices whose vertex set is partitioned into subsets V0, . . . , Vk−1 for a positive integer 1 ≤ k ≤ n and let S be a set of n distinct points in the plane partitioned into subsets S0, . . . , Sk−1 with |Vi| = |Si| (0 ≤ i ≤ k − 1). This paper studies the problem of computing a crossing-free drawing of G such that each vertex of Vi is mapped to a distinct point of...
متن کاملOn Partitioning Colored Points
Let us imagine that red candles and blue candles are placed on the top of a cake. We want to cut it with a knife into two pieces in such a way that all the red candles are on one of the two pieces and all the blue candles are on the other piece. A question is when we can cut it successfully. The following Kirchberger’s theorem [5] answers this question in a general setting. Let X be a finite su...
متن کاملSelecting Heavily Covered Points
A collection of geometric selection lemmas is proved, such as the following: For any set P of n points in three-dimensional space and any set ,9 of m spheres, where each sphere passes through a distinct point pair in P, there exists a point x, not necessarily in P, that is enclosed by f2 (m ! (n log )) of the spheres in S. Similar results apply in arbitrary fixed dimensions, and for geometric b...
متن کاملMatching colored points with rectangles
Let S be a point set in the plane such that each of its ele1 ments is colored either red or blue. A matching of S with rectangles is 2 any set of pairwise-disjoint axis-aligned rectangles such that each rectan3 gle contains exactly two points of S. Such a matching is monochromatic 4 if every rectangle contains points of the same color, and is bichromatic if 5 every rectangle contains points of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2018
ISSN: 0166-218X
DOI: 10.1016/j.dam.2018.05.011