scientific article; zbMATH DE number 146418

MaRDI QIDQ4029778zbMATH OpenFDO

Authors R. A. Cunninghame-Green

Publication date 1 April 1993

zbMATH Keywords

CADcomputational geometrycutting layouts

Mathematics Subject Classification ID

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

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

Cited in

(3)

• Sets of lines and cutting out polyhedral objects
• scientific article; zbMATH DE number 866038 (Why is no real title available?)
• 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)