We consider problems of distributing a number of points within a polygonal region P , such that the points are "far away" from each other. Problems of this type have been considered before for the case where the possible locations form a discrete set. Dispersion problems are closely related to packing problems. While Hochbaum and Maass (1985) have given a polynomial time approximation scheme for packing, we show that geometric dispersion problems cannot be approximated arbitrarily well in polynomial time, unless P=NP. A special case of this observation solves an open problem by Rosenkrantz, Tayi, and Ravi. We give a 2/3 approximation algorithm for one version of the geometric dispersion problem. This algorithm is strongly polynomial in the size of the input, i. e., its running time does not depend on the area of P . We also discuss extensions and open problems
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.