Cutting out polygons with lines and rays

Authors:
Ovidiu Daescu;Jun Luo
Affiliations:
Department of Computer Science, University of Texas at Dallas, Richardson, TX;Department of Computer Science, University of Texas at Dallas, Richardson, TX
Venue:
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Year:
2004

Citing 4
Cited 2

The complexity of cutting paper (extended abstract)

SCG '85 Proceedings of the first annual symposium on Computational geometry
Polygons cuttable by a circular saw

Computational Geometry: Theory and Applications
An approximation algorithm for cutting out convex polygons

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Sets of lines and cutting out polyhedral objects

Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01

Approximation algorithms for cutting out polygons with lines and rays

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A PTAS for cutting out polygons with lines

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present approximation algorithms for cutting out polygons with line cuts and ray cuts Our results answer a number of open problems and are either the first solutions or significantly improve over previously known solutions For the line cutting version, we prove a key property that leads to a simple, constant factor approximation algorithm For the ray cutting version, we prove it is possible to compute in almost linear time a cutting sequence that is an O(log2n)-factor approximation No algorithms were previously known for the ray cutting version.