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

Carlos Alegría (), David Orden (), Carlos Seara () and Jorge Urrutia ()
Additional contact information
Carlos Alegría: Università Roma Tre
David Orden: Universidad de Alcalá
Carlos Seara: Universitat Politècnica de Catalunya
Jorge Urrutia: Universidad Nacional Autónoma de Mexico

Journal of Global Optimization, 2023, vol. 85, issue 4, No 9, 1003-1036

Abstract: Abstract We 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 | .

Keywords: Restricted orientation convex hulls; Bichromatic separability; Inclusion detection; Lower bounds; Optimization; Theory of computation; Computational geometry; Inclusion detection; Lower bounds; Optimization (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10898-022-01238-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:85:y:2023:i:4:d:10.1007_s10898-022-01238-9

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-022-01238-9

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().