scientific article; zbMATH DE number 2079417

MaRDI QIDQ4471377zbMATH OpenFDO

Authors Adrian Dumitrescu

Publication date 28 July 2004

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• An approximation algorithm for cutting out convex polygons
• EFFICIENT APPROXIMATION OF CONVEX POLYGONS
• Computing and Combinatorics
• A PTAS for Cutting Out Polygons with Lines
• The cost of cutting out convex n-gons

Cited in

(9)

• A PTAS for Cutting Out Polygons with Lines
• A PTAS for cutting out polygons with lines
• The cost of cutting out convex n-gons
• Complete and robust no-fit polygon generation for the irregular stock cutting problem
• An approximation algorithm for cutting out convex polygons
• scientific article; zbMATH DE number 2058624 (Why is no real title available?)
• On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost
• scientific article; zbMATH DE number 1979490 (Why is no real title available?)
• Computing and Combinatorics

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