Beyond triangulation: covering polygons with triangles

DOI10.1007/978-3-642-22300-6_20MaRDI QIDQ5199245zbMATH OpenOpenAlexFDO

Authors Tobias Christ

Publication date 12 August 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-22300-6_20

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) Approximation algorithms (68W25)

Recommendations

• Covering Polygons Is Hard
• Close approximations of minimum rectangular coverings
• scientific article; zbMATH DE number 4117851
• An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee
• Further NP-hard problems for minimal polygon coverings

Cited in

(6)

• Covering a convex polygon by triangles
• Orientational variable-length strip covering problem: a branch-and-price-based algorithm
• scientific article; zbMATH DE number 1241846 (Why is no real title available?)
• Covering Polygons Is Hard
• scientific article; zbMATH DE number 1877049 (Why is no real title available?)
• Computational Science and Its Applications – ICCSA 2004

This page was built for publication: Beyond triangulation: covering polygons with triangles

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