Set (abstract data type)

Computer science

Mathematics

Object (grammar)

Artificial intelligence

Geometry

Combinatorics

Point (geometry)

Programming language

We introduce the exact coloured k-enclosing object problem: given a set P of n points in R, 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 k-enclosing axis-aligned rectangles, squares, discs, and two-sided dominating regions in a t-coloured point set.

On k-enclosing objects in a coloured point set