Decomposing Octilinear Polygons into Triangles and Rectangles

DOI10.1007/978-3-319-13287-7_3MaRDI QIDQ2945661zbMATH OpenOpenAlexFDO

Authors Serafino Cicerone, Gabriele Di Stefano

Publication date 14 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-13287-7_3

zbMATH Keywords

approximation algorithmsCAD applicationsoctilinear polygonspolygon decomposition

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer science aspects of computer-aided design (68U07) Approximation algorithms (68W25)

Recommendations

• Decomposing a simple polygon into pseudo-triangles and convex polygons
• scientific article; zbMATH DE number 2160477
• Approximation algorithms for decomposing octilinear polygons
• scientific article; zbMATH DE number 1424299
• scientific article; zbMATH DE number 515326
• Decomposing a Polygon into Simpler Components
• scientific article; zbMATH DE number 2197927
• Dissections of regular polygons into similar triangles

Cited in

(2)

• Incrementally closing octagons
• Approximation algorithms for decomposing octilinear polygons

This page was built for publication: Decomposing Octilinear Polygons into Triangles and Rectangles

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