Approximation algorithms for cutting out polygons with lines and rays

DOI10.1007/11533719_54MaRDI QIDQ5716973zbMATH OpenOpenAlexFDO

Authors Xuehou Tan

Publication date 11 January 2006

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

Full work available at URL https://doi.org/10.1007/11533719

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Cutting out polygons with lines and rays
• CUTTING OUT POLYGONS WITH LINES AND RAYS
• An approximation algorithm for cutting out convex polygons
• scientific article; zbMATH DE number 2079417
• Cutting out polygon collections with a saw

Cited in

(14)

• A PTAS for cutting out polygons with lines
• An approximation algorithm for cutting out convex polygons
• The cost of cutting out convex n-gons
• Cutting out polygon collections with a saw
• Approximation algorithms for cutting a convex polyhedron out of a sphere
• Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments
• A PTAS for Cutting Out Polygons with Lines
• Approximation algorithms for cutting a convex polyhedron out of a sphere
• scientific article; zbMATH DE number 2079417 (Why is no real title available?)
• CUTTING OUT POLYGONS WITH LINES AND RAYS
• Cutting out polygons with lines and rays
• Cutting polygons into small pieces with chords: Laser-based localization
• Cutting a convex polyhedron out of a sphere
• Polynomial-time algorithms for contiguous art gallery and related problems

This page was built for publication: Approximation algorithms for cutting out polygons with lines and rays

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