scientific article; zbMATH DE number 146418

zbMATH Open0791.68160MaRDI QIDQ4029778FDOQ4029778

Authors: R. A. Cunninghame-Green 

Publication date: 1 April 1993

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

Recommendations

• A new algorithm for the minimal-area convex enclosure problem
• scientific article; zbMATH DE number 2161546
• Subtraction of two 2D polygons with some matching vertices
• Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
• Multiple translational containment. I: An approximate algorithm

zbMATH Keywords

computational geometryCADcutting layouts

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer science aspects of computer-aided design (68U07)

Cited In (2)

• Sets of lines and cutting out polyhedral objects
• Algorithms – ESA 2005

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 Q4029778)