On k-enclosing objects in a coloured point set

View/Open
Document typeConference report
Defense date2014
Rights accessOpen Access
Abstract
We introduce the exact coloured
k
-enclosing object
problem: given a set
P
of
n
points in
R
2
, each of
which has an associated colour in
f
1
;:::;t
g
, and a vec-
tor
c
= (
c
1
;:::;c
t
), where
c
i
2
Z
+
for each 1
i
t
,
nd a region that contains exactly
c
i
points of
P
of
colour
i
for each
i
. We examine the problems of nd-
ing exact coloured
k
-enclosing axis-aligned rectangles,
squares, discs, and two-sided dominating regions in a
t
-coloured point set
CitationBarba, L. [et al.]. On k-enclosing objects in a coloured point set. A: Canadian Conference on Computational Geometry. "Proceedings of the 25th Canadian Conference on Computational Geometry". Waterloo: 2014, p. 229-234.
Publisher versionhttp://cccg.ca/proceedings/2013/
Files | Description | Size | Format | View |
---|---|---|---|---|
kEnclosing-cccg2013-paper35.pdf | Extended abstract CCCG2013 | 339,7Kb | View/Open |
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain