Separating bichromatic point sets in the plane by restricted orientation convex hulls

Author:

Alegría CarlosORCID,Orden DavidORCID,Seara CarlosORCID,Urrutia JorgeORCID

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)

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Rectilinear convex hull of points in 3D and applications;Journal of Global Optimization;2024-05-04

2. The Rectilinear Convex Hull of Line Segments;Fundamentals of Computation Theory;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3