Results 1 
1 of
1
On kEnclosing Objects in a Coloured Point Set
"... We introduce the exact coloured kenclosing object problem: given a set P of n points in R2, each of which has an associated colour in {1,..., t}, and a vector c = (c1,..., ct), where ci ∈ Z+ for each 1 ≤ i ≤ t, find a region that contains exactly ci points of P of colour i for each i. We examine t ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
We introduce the exact coloured kenclosing object problem: given a set P of n points in R2, each of which has an associated colour in {1,..., t}, and a vector c = (c1,..., ct), where ci ∈ Z+ for each 1 ≤ i ≤ t, find a region that contains exactly ci points of P of colour i for each i. We examine the problems of finding exact coloured kenclosing axisaligned rectangles, squares, discs, and twosided dominating regions in a tcoloured point set. 1