WEKO3
アイテム
Enumerating At Most <i>k</i>-Out Polygons
https://ipsj.ixsq.nii.ac.jp/records/238534
https://ipsj.ixsq.nii.ac.jp/records/23853454585b21-fa3e-45e8-90c6-83dabb3866d2
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-AL24199007.pdf (920.2 kB)
2026年8月29日からダウンロード可能です。
|
Copyright (c) 2024 by the Information Processing Society of Japan
|
|
| 非会員：¥660, IPSJ:学会員：¥330, AL:会員：¥0, DLIB:会員：¥0 | ||
| Item type | SIG Technical Reports(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2024-08-29 | |||||||||
| タイトル | ||||||||||
| タイトル | Enumerating At Most <i>k</i>-Out Polygons | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | Enumerating At Most <i>k</i>-Out Polygons | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_18gh | |||||||||
| 資源タイプ | technical report | |||||||||
| 著者所属 | ||||||||||
| Indian Institute of Technology | ||||||||||
| 著者所属 | ||||||||||
| Iwate University | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Indian Institute of Technology | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Iwate University | ||||||||||
| 著者名 |
Akram, Waseem
× Akram, Waseem
× Katsuhisa, Yamanaka
|
|||||||||
| 著者名(英) |
Akram, Waseem
× Akram, Waseem
× Katsuhisa, Yamanaka
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Let S be a set of n points in the Euclidean plane and general position i.e., no three points are collinear. An at most k-out polygon of S is a simple polygon such that each vertex is a point in S and there are at most k points outside the polygon. In this paper, we consider the problem of enumerating all the at most k-out polygon of S. We propose a new enumeration algorithm of k-out polygons of a point set. Our algorithm enumerates all the at most k-out polygons in O(n2 log n) delay, while the running time of an existing algorithm is O(n3 log n) delay. | |||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Let S be a set of n points in the Euclidean plane and general position i.e., no three points are collinear. An at most k-out polygon of S is a simple polygon such that each vertex is a point in S and there are at most k points outside the polygon. In this paper, we consider the problem of enumerating all the at most k-out polygon of S. We propose a new enumeration algorithm of k-out polygons of a point set. Our algorithm enumerates all the at most k-out polygons in O(n2 log n) delay, while the running time of an existing algorithm is O(n3 log n) delay. | |||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AN1009593X | |||||||||
| 書誌情報 |
研究報告アルゴリズム（AL） 巻 2024-AL-199, 号 7, p. 1-5, 発行日 2024-08-29 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 2188-8566 | |||||||||
| Notice | ||||||||||
| SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. | ||||||||||
| 出版者 | ||||||||||
| 言語 | ja | |||||||||
| 出版者 | 情報処理学会 | |||||||||
