WEKO3
アイテム
Polynomial Time Algorithms for Label Size Maximization on Rotating Maps
https://ipsj.ixsq.nii.ac.jp/records/182995
https://ipsj.ixsq.nii.ac.jp/records/182995c631f96f-2a54-4c29-bcd1-1829d2dcde95
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL5808009.pdf (456.5 kB)
|
Copyright (c) 2017 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2017-08-15 | |||||||||
| タイトル | ||||||||||
| タイトル | Polynomial Time Algorithms for Label Size Maximization on Rotating Maps | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | Polynomial Time Algorithms for Label Size Maximization on Rotating Maps | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | [特集：離散と計算の幾何・グラフ・ゲーム] map labeling, label size maximization, dynamic maps, rotating maps | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者所属 | ||||||||||
| Information and System Engineering Course, Graduate School of Science and Engineering, Chuo University | ||||||||||
| 著者所属 | ||||||||||
| Department of Information and System Engineering, Faculty of Science and Engineering, Chuo University | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Information and System Engineering Course, Graduate School of Science and Engineering, Chuo University | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Department of Information and System Engineering, Faculty of Science and Engineering, Chuo University | ||||||||||
| 著者名 |
Yusuke, Yokosuka
× Yusuke, Yokosuka
× Keiko, Imai
|
|||||||||
| 著者名(英) |
Yusuke, Yokosuka
× Yusuke, Yokosuka
× Keiko, Imai
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Map labeling is the problem of placing labels at corresponding graphical features on a map. There are two main optimization problems: the label number maximization problem and the label size maximization problem. In general, both problems are NP-hard for static maps. Recently, the widespread use of several applications, such as personal mapping systems, has increased the importance of dynamic maps and the label number maximization problem for dynamic cases has been studied. In this paper, we consider the label size maximization problem for points on rotating maps. Our model is as follows. For each label, an anchor point is chosen inside the label or on its boundary. Each label is placed such that the anchor point coincides with the corresponding point on the map. Furthermore, while the map fully rotates from 0 to 2π, the labels are placed horizontally according to the angle of the map. Our problem consists of finding the maximum scale factor for the labels such that the labels do not intersect, and determining the placing of the anchor points. We describe an O(n log n)-time and O(n)-space algorithm for the case where each anchor point is inside the label. Moreover, if the anchor points are on the boundaries, we also present an O(n log n)-time and O(n)-space exact and approximation algorithms for several label shapes. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.25(2017) (online) DOI http://dx.doi.org/10.2197/ipsjjip.25.572 ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Map labeling is the problem of placing labels at corresponding graphical features on a map. There are two main optimization problems: the label number maximization problem and the label size maximization problem. In general, both problems are NP-hard for static maps. Recently, the widespread use of several applications, such as personal mapping systems, has increased the importance of dynamic maps and the label number maximization problem for dynamic cases has been studied. In this paper, we consider the label size maximization problem for points on rotating maps. Our model is as follows. For each label, an anchor point is chosen inside the label or on its boundary. Each label is placed such that the anchor point coincides with the corresponding point on the map. Furthermore, while the map fully rotates from 0 to 2π, the labels are placed horizontally according to the angle of the map. Our problem consists of finding the maximum scale factor for the labels such that the labels do not intersect, and determining the placing of the anchor points. We describe an O(n log n)-time and O(n)-space algorithm for the case where each anchor point is inside the label. Moreover, if the anchor points are on the boundaries, we also present an O(n log n)-time and O(n)-space exact and approximation algorithms for several label shapes. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.25(2017) (online) DOI http://dx.doi.org/10.2197/ipsjjip.25.572 ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AN00116647 | |||||||||
| 書誌情報 |
情報処理学会論文誌 巻 58, 号 8, 発行日 2017-08-15 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7764 | |||||||||
