2004 | OriginalPaper | Buchkapitel
Approximate Unions of Lines and Minkowski Sums
verfasst von : Marc van Kreveld, A. Frank van der Stappen
Erschienen in: Algorithms – ESA 2004
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.