Geometric separability using orthogonal objects

Abidha, V.P.; Ashok, Pradeesha

doi:10.1016/j.ipl.2022.106245

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Book1

Article1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Abidha and Ashok[3] studied the geometric separability problem for a bichromatic point-setP = R ∪B (|P | = n) of red (R)and blue (B) points. It computes a separator as an object of a certain type that separates R and B.…”

mentioning

confidence: 99%

Red-Blue Rectangular Annulus Cover Problem

Maji,

Pandit,

Sadhu

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We study the Generalized Red-Blue Annulus Cover problem for two sets of points, red (R) and blue (B), where each point p ∈ R∪B is associated with a positive penalty P(p). The red points have non-covering penalties, and the blue points have covering penalties. The objective is to compute a circular annulus A such that the value of the function P(R out )+P(B in ) is minimum, where R out ⊆ R is the set of red points not covered by A and B in ⊆ B is the set of blue points covered by A. We also study another version of this problem, where all the red points in R and the minimum number of points in B are covered by the circular annulus in two dimensions. We design polynomial-time algorithms for all such circular annulus problems.

show abstract

mentioning

confidence: 99%