Multiple Translational Containment Part I: An Approximate Algorithm
We present an algorithm for finding a solution to the two-dimensional translational approximate multiple containment problem: find translations for k polygons which place them inside a polygonal container so that no point of any polygon is more than2ε inside of the boundary of any other polygon. The...
|Published in:||Algorithmica : an international journal in computer science, Vol. 19, No. 1/2 (1997), p. 148-182|
|Other Involved Persons:|
|Item Description:||Received June 24, 1994; revised August 22, 1995.|
|QR Code:||Show QR Code|