covering grid points in a convex polygon with straight lines∗

DOI10.1080/00207169208804057MaRDI QIDQ3989786zbMATH OpenOpenAlexFDO

Authors Hsuan-Shih Lee, R. C. Chang

Publication date 28 June 1992

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169208804057

zbMATH Keywords

approximation algorithmcontinued fraction expansionshitting set problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Continued fractions (11A55)

Recommendations

• REGULAR ENUMERATION OF GRID POINTS IN A CONVEX POLYGON
• Covering a Set of Points with a Minimum Number of Lines
• An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee
• On covering \(\mathbb Z\)-grid points by rectangles
• scientific article; zbMATH DE number 1877049

Cites work

• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 3573943 (Why is no real title available?)
• Approximation algorithms for hitting objects with straight lines

Cited in

(2)

• scientific article; zbMATH DE number 1830732 (Why is no real title available?)
• Covering a Set of Points with a Minimum Number of Lines

This page was built for publication: covering grid points in a convex polygon with straight lines^∗

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