Lower bounds for approximate polygon decomposition and minimum gap

Summary, in English

We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, into rectangles, and show an Omega (n log n) lower bound on the time-complexity. The result holds for any decomposition, optimal or approximative. The bound matches the complexity of a number of algorithms in the literature, proving their optimality and settling the complexity of approximate polygon decomposition in these cases. As a related result we show that any non-trivial approximation algorithm for the minimum gap problem requires Omega (n log n) time. (C) 2002 Elsevier Science B.V. All rights reserved.

• Författare: J Gudmundsson; Thore Husfeldt; Christos Levcopoulos
• Avdelning/ar: Computer Science
• Publiceringsår: 2002
• Språk: Engelska
• Sidor: 137-141
• Publikation/Tidskrift/Serie: Information Processing Letters
• Volym: 81
• Issue: 3
• Länkar: http://dx.doi.org/10.1016/S0020-0190(01)00203-4
• Dokumenttyp: Artikel i tidskrift
• Förlag: Elsevier
• Ämne: Computer Science
• Nyckelord: trees; minimum gap; lower bounds; algebraic decision; polygon decomposition; computational geometry
• Status: Published
• ISBN/ISSN/Övrigt: ISSN: 0020-0190