@inproceedings{3f6bb0b6d88a467e9e8ba4a9ca3f881d,

title = "Cutting a cornered convex polygon out of a circle",

abstract = "The problem of cutting a convex polygon P out of a piece of paper Q with minimum total cutting length is a well studied problem in computational geometry. Researchers studied several variations of the problem, such as P and Q are convex or non-convex polygons and the cuts are line cuts or rays cuts. In this paper we consider yet another variation of the problem where Q is a circle and P is convex polygon such that P is bounded by a half circle of Q and all the cuts are line cuts. We give a simple linear time O(log n) approximation algorithm for this problem where n is the number of vertices of P.",

keywords = "Algorithm, Circle, Computational geometry, Line cut, Polygon cutting",

author = "Ahmed, {Syed Ishtiaque} and Islam, {Md Ariful} and Masud Hasan",

year = "2008",

doi = "10.1109/ICCITECHN.2008.4802988",

language = "English",

isbn = "9781424421367",

series = "Proceedings of 11th International Conference on Computer and Information Technology, ICCIT 2008",

pages = "1--6",

booktitle = "Proceedings of 11th International Conference on Computer and Information Technology, ICCIT 2008",

note = "11th International Conference on Computer and Information Technology, ICCIT 2008 ; Conference date: 25-12-2008 Through 27-12-2008",

}