3 citations · 4 across the 4 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2021
Extensions of the Maximum Bichromatic Separating Rectangle Problem
Bogdan Armaselu
In this paper, we study two extensions of the maximum bichromatic separating rectangle (MBSR) problem introduced in \cite{Armaselu-CCCG, Armaselu-arXiv}. One of the extensions, int…
cs.CG2020
Improved Algorithm for Computing the Maximum-volume Bichromatic Separating Box
Bogdan Armaselu
We consider the problem of computing the largest-area bichromatic separating box among a set of red points and a set of blue points in three dimensions. Currently, the best…
cs.CG2017★ 3 cited
Maximum Area Rectangle Separating Red and Blue Points
Bogdan Armaselu, Ovidiu Daescu
Given a set R of n red points and a set B of m blue points, we study the problem of finding a rectangle that contains all the red points, the minimum number of blue points and has…