On k-enclosing objects in a coloured point set
- Author
-
Barba, L.; Durocher, S.; Fraser, R.; Hurtado, F.; Mehrabi , S.; Mondal, D.; Morrison, J.; Skala, M.; Wahid, M.
- Type of activity
-
Presentation of work at congresses
- Name of edition
-
CCCG Canadian Conference on Computational Geometry
- Date of publication
-
2014
- Presentation's date
-
2013-08-09
- Book of congress proceedings
-
Proceedings of the 25th Canadian Conference on Computational Geometry
- First page
-
229
- Last page
-
234
- Repository
-
http://hdl.handle.net/2117/24559
- URL
-
http://cccg.ca/proceedings/2013/
- 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
- Citation
-
Barba, 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.
- Group of research
-
DCG - Discrete and Combinatorial Geometry
kEnclosing-cccg2013-paper35.pdf
(347924 bytes)
Share
