ログイン 新規登録
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 研究報告
  2. アルゴリズム(AL)
  3. 2023
  4. 2023-AL-193

Optimal Simple Fold-and-Cut of a Polygonal Line

https://ipsj.ixsq.nii.ac.jp/records/225664
https://ipsj.ixsq.nii.ac.jp/records/225664
f76b360c-46b7-4027-bb61-2127ef46ab3f
名前 / ファイル ライセンス アクション
IPSJ-AL23193013.pdf IPSJ-AL23193013.pdf (1.3 MB)
Copyright (c) 2023 by the Information Processing Society of Japan
オープンアクセス
Item type SIG Technical Reports(1)
公開日 2023-05-03
タイトル
タイトル Optimal Simple Fold-and-Cut of a Polygonal Line
タイトル
言語 en
タイトル Optimal Simple Fold-and-Cut of a Polygonal Line
言語
言語 eng
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_18gh
資源タイプ technical report
著者所属
Japan Advanced Institute of Science and Technology
著者所属(英)
en
Japan Advanced Institute of Science and Technology
著者名 Ryuhei, Uehara

× Ryuhei, Uehara

Ryuhei, Uehara

Search repository
著者名(英) Ryuhei, Uehara

× Ryuhei, Uehara

en Ryuhei, Uehara

Search repository
論文抄録
内容記述タイプ Other
内容記述 We investigate a natural variant of the fold-and-cut problem. We are given a long paper strip P and a polygonal line, which consists of a sequence of line segments, drawn on P. We cut all the line segments by one complete straight cut after overlapping all of them by a sequence of simple foldings. Our goal is to minimize the number of simple foldings to do that. When the polygonal line satisfies some certain geometric conditions, we can find a shortest sequence of simple foldings for the given polygonal line that consists of n line segments in O(n3) time and O(n2) space.
論文抄録(英)
内容記述タイプ Other
内容記述 We investigate a natural variant of the fold-and-cut problem. We are given a long paper strip P and a polygonal line, which consists of a sequence of line segments, drawn on P. We cut all the line segments by one complete straight cut after overlapping all of them by a sequence of simple foldings. Our goal is to minimize the number of simple foldings to do that. When the polygonal line satisfies some certain geometric conditions, we can find a shortest sequence of simple foldings for the given polygonal line that consists of n line segments in O(n3) time and O(n2) space.
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AN1009593X
書誌情報 研究報告アルゴリズム(AL)

巻 2023-AL-193, 号 13, p. 1-4, 発行日 2023-05-03
ISSN
収録物識別子タイプ ISSN
収録物識別子 2188-8566
Notice
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
出版者
言語 ja
出版者 情報処理学会
戻る
0
views
See details
Views

Versions

Ver.1 2025-01-19 12:43:25.454936
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3