Separating bichromatic point sets by L-shapes
نویسندگان
چکیده
منابع مشابه
Separating bichromatic point sets by L-shapes
Given a set R of red points and a set B of blue points in the plane, we study the problem of determining all angles for which there exists an L-shape containing all points from B and no points from R. We propose a worst-case optimal algorithm to solve this problem in O(n) time and O(n) storage, where n = |R| + |B|. We also describe an output-sensitive algorithm that reports these angles in O(n ...
متن کاملFinding monochromatic l-shapes in bichromatic point sets
Given a set R of red points and a set B of blue points in the plane of total size n, we study the problem of determining all angles for which there exists an L-shape containing all points from B without containing any points from R. We propose an algorithm to solve the problem in O(n log n) time and O(n) storage. We also describe an output-sensitive algorithm that reports all angles in O(n + k ...
متن کاملGeometric Spanning Cycles in Bichromatic Point Sets
Given a set of points in the plane each colored either red or blue, we find non-self-intersecting geometric spanning cycles of the red points and of the blue points such that each edge of the red spanning cycle is crossed at most three times by the blue spanning cycle and vice-versa.
متن کاملReporting Bichromatic Segment Intersections from Point Sets
In this paper, we introduce a natural variation of the problem of computing all bichromatic intersections between two sets of segments. Given two sets R and B of n points in the plane defining two sets of segments, say red and blue, we present an O(n) time and space algorithm for solving the problem of reporting the set of segments of each color intersected by segments of the other color. We al...
متن کاملOn balanced 4-holes in bichromatic point sets
Let S = R∪B be a set of n points in general position in the plane. The elements of R and B will be called, respectively, the red and blue elements of S. A k-hole of S is a simple polygon with k vertices, all in S, and containing no element of S in its interior. A 4-hole of S is balanced if it has two blue and two red vertices. In this paper, we characterize the set of bicolored points S = R∪B t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2015
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2015.06.008