Abstract
AbstractWe explore the separability of point sets in the plane by a restricted-orientation convex hull, which is an orientation-dependent, possibly disconnected, and non-convex enclosing shape that generalizes the convex hull. Let R and B be two disjoint sets of red and blue points in the plane, and $$\mathcal {O}$$
O
be a set of $$k\ge 2$$
k
≥
2
lines passing through the origin. We study the problem of computing the set of orientations of the lines of $$\mathcal {O}$$
O
for which the $$\mathcal {O}$$
O
-convex hull of R contains no points of B. For $$k=2$$
k
=
2
orthogonal lines we have the rectilinear convex hull. In optimal $$O(n\log n)$$
O
(
n
log
n
)
time and O(n) space, $$n = \vert R \vert + \vert B \vert $$
n
=
|
R
|
+
|
B
|
, we compute the set of rotation angles such that, after simultaneously rotating the lines of $$\mathcal {O}$$
O
around the origin in the same direction, the rectilinear convex hull of R contains no points of B. We generalize this result to the case where $$\mathcal {O}$$
O
is formed by $$k \ge 2$$
k
≥
2
lines with arbitrary orientations. In the counter-clockwise circular order of the lines of $$\mathcal {O}$$
O
, let $$\alpha _i$$
α
i
be the angle required to clockwise rotate the ith line so it coincides with its successor. We solve the problem in this case in $$O({1}/{\Theta }\cdot N \log N)$$
O
(
1
/
Θ
·
N
log
N
)
time and $$O({1}/{\Theta }\cdot N)$$
O
(
1
/
Θ
·
N
)
space, where $$\Theta = \min \{ \alpha _1,\ldots ,\alpha _k \}$$
Θ
=
min
{
α
1
,
…
,
α
k
}
and $$N=\max \{k,\vert R \vert + \vert B \vert \}$$
N
=
max
{
k
,
|
R
|
+
|
B
|
}
. We finally consider the case in which $$\mathcal {O}$$
O
is formed by $$k=2$$
k
=
2
lines, one of the lines is fixed, and the second line rotates by an angle that goes from 0 to $$\pi $$
π
. We show that this last case can also be solved in optimal $$O(n\log n)$$
O
(
n
log
n
)
time and O(n) space, where $$n = \vert R \vert + \vert B \vert $$
n
=
|
R
|
+
|
B
|
.
Funder
H2020 Marie Sklodowska-Curie Actions
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization,Computer Science Applications,Business, Management and Accounting (miscellaneous)
Reference50 articles.
1. Abello, J., Estivill-Castro, V., Shermer, T., Urrutia, J.: Illumination of orthogonal polygons with orthogonal floodlights. Int. J. Comput. Geom. Appl. 08(01), 25–38 (1998). https://doi.org/10.1142/S0218195998000035
2. Acharyya, A., De, M., Nandy, S.C., Pandit, S.: Variations of largest rectangle recognition amidst a bichromatic point set. Discrete Appl. Math. 286, 35–50 (2020). https://doi.org/10.1016/j.dam.2019.05.012
3. Agarwal, P.K., Aronov, B., Koltun, V.: Efficient algorithms for bichromatic separability. ACM Trans. Algorithms 2(2), 209–227 (2006). https://doi.org/10.1145/1150334.1150338
4. Alegría, C., Orden, D., Seara, C., Urrutia, J.: Detecting inclusions for $${\cal{O}}$$-convex hulls of bichromatic point sets. In: Proceedings of the XVIII Spanish Meeting on Computational Geometry, pp 47–50 (2019)
5. Alegría-Galicia, C., Orden, D., Seara, C., Urrutia, J.: On the $${\cal{O} }_\beta $$-hull of a planar point set. Comput. Geom. Theory Appl. 68, 277–291 (2018). https://doi.org/10.1016/j.comgeo.2017.06.003
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献