Loading...
Please wait, while we are loading the content...
Similar Documents
A 3-Approximation Algorithm for Computing Partitions with Minimum Stabbing number of Rectilinear Simple Polygons
| Content Provider | Semantic Scholar |
|---|---|
| Author | Abam, Mohammad Ali Aronov, Boris Berg, Mark De Khosravi, Amirali |
| Copyright Year | 2011 |
| Abstract | Let P be a rectilinear simple polygon. The stabbing number of a partition of P into rectangles is the maximum number of rectangles stabbed by any axis-parallel segment inside P . We present a 3-approximation algorithm for finding a partition with minimum stabbing number. It is based on an algorithm that finds an optimal partition for histograms. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://alexandria.tue.nl/openaccess/Metis253579.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |