Packing Rotating Segments

We show that the following variant of labeling rotating maps is NP-hard, and present a polynomial approximation scheme for solving it. The input is a set of feature points on a map, to each of which a vertical bar of zero width is assigned. The goal is to choose the largest subsets of the bars such...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2019-07
Main Author: Ali Gholami Rudi
Format: Article
Language:English
Subjects:
Algorithms
Labels
Polynomials
Rotation
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We show that the following variant of labeling rotating maps is NP-hard, and present a polynomial approximation scheme for solving it. The input is a set of feature points on a map, to each of which a vertical bar of zero width is assigned. The goal is to choose the largest subsets of the bars such that when the map is rotated and the labels remain vertical, none of the bars intersect. We extend this algorithm to the general case where labels are arbitrary objects.
ISSN:2331-8422