2004 | OriginalPaper | Chapter
Approximate Unions of Lines and Minkowski Sums
Authors : Marc van Kreveld, A. Frank van der Stappen
Published in: Algorithms – ESA 2004
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We study the complexity of and algorithms to construct approximations of the union of lines, and of the Minkowski sum of two simple polygons. We also study thick unions of lines and Minkowski sums, which are inflated with a small disc. Let b=D/ε be the ratio of the diameter of the region of interest and the distance (or error) of the approximation. We present upper and lower bounds on the combinatorial complexity of approximate and thick unions of lines and Minkowski sums, with bounds expressed in b and the input size n. We also give efficient algorithms for the computation.