Line segment covering of cells in arrangements

Matias Korman, Sheung Hung Poon, Marcel Roeloffzen

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

Given a collection L of line segments, we consider its arrangement and study the problem of covering all cells with line segments of L. That is, we want to find a minimum-size set L′ of line segments such that every cell in the arrangement has a line from L′ defining its boundary. We show that the problem is NP-hard, even when all segments are axis-aligned. In fact, the problem is still NP-hard when we only need to cover rectangular cells of the arrangement. For the latter problem we also show that it is fixed parameter tractable with respect to the size of the optimal solution. Finally we provide a linear time algorithm for the case where cells of the arrangement are created by recursively subdividing a rectangle using horizontal and vertical cutting segments.

本文言語English
ホスト出版物のタイトルCombinatorial Optimization and Applications - 9th International Conference, COCOA 2015, Proceedings
編集者Donghyun Kim, Weili Wu, Ding-Zhu Du, Zaixin Lu, Wei Li
出版社Springer-Verlag
ページ152-162
ページ数11
ISBN(印刷版)9783319266251
DOI
出版ステータスPublished - 2015 1 1
イベント9th International Conference on Combinatorial Optimization and Applications, COCOA 2015 - Houston, United States
継続期間: 2015 12 182015 12 20

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
9486
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other9th International Conference on Combinatorial Optimization and Applications, COCOA 2015
CountryUnited States
CityHouston
Period15/12/1815/12/20

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Line segment covering of cells in arrangements」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル