非表示:
キーワード:
-
要旨:
Let $S$ be a set of $n$ points in $d$-space and let
$1 \leq k \leq n$ be an integer. A unified approach is given
for solving the problem of finding a subset of $S$ of size $k$
that minimizes some closeness measure, such as the diameter,
perimeter or the circumradius. Moreover, data structures are
given that maintain such a subset under insertions and
deletions of points.
