=ADD=
=reftype=
14
=number=
99-05
=url=
ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-05.ps.gz
=year=
1999
=month=
01
=author=
Pau; Petru
=title=
Translating Convex Polyhedra to Contain a Maximum Number of Points
=abstract=
We present a generalization of a problem of optimal placement
for convex shapes: {\it find a translation of a convex 
$3$-dimensional polytope such that it contains a maximum number 
of points from a given set}. For a polyhedron with $m$ vertices
and a set of $n$ points in space, the algorithm finds a 
placement of maximal containment in $O(mnd^2\log md)$.
=howpublished=
Accepted for publication by the Annals of the West University of
Timisoara, Romania
=keywords=
optimal placement