Lower bounds for approximate polygon decomposition and minimum gap
From MaRDI portal
Publication:1603513
DOI10.1016/S0020-0190(01)00203-4zbMath1032.68139MaRDI QIDQ1603513
Joachim Gudmundsson, Thore Husfeldt, Christos Levcopoulos
Publication date: 14 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Cites Work
- Complexities of efficient solutions of rectilinear polygon cover problems
- Triangulating a simple polygon in linear time
- Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
- Optimal time bounds for some proximity problems in the plane
- Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles
- COVERING CONVEX RECTILINEAR POLYGONS IN LINEAR TIME
- A LINEAR-TIME ALGORITHM FOR COVERING SIMPLE POLYGONS WITH SIMILAR RECTANGLES
- Unnamed Item
- Unnamed Item
- Unnamed Item