scientific article; zbMATH DE number 1979490

zbMATH Open1019.68117MaRDI QIDQ4425945FDOQ4425945

Authors: Bettina Speckmann, Marc Van Kreveld 

Publication date: 14 September 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2518/25180091.htm

Title of this publication is not available (Why is that?)

Recommendations

• An approximation algorithm for cutting out convex polygons
• Minimum convex partition of polygonal domains by guillotine cuts
• scientific article; zbMATH DE number 2079417
• scientific article; zbMATH DE number 1629819
• Minimum k-partitioning of rectilinear polygons

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (4)

• A simple method for fitting of bounding rectangle to closed regions
• Approximate unions of lines and Minkowski sums
• Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
• Corner cuts are close to optimal: from solid grids to polygons and back

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4425945)