ログイン 新規登録
言語:

WEKO3

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

Field does not validate



インデックスリンク

インデックスツリー

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

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 論文誌(ジャーナル)
  2. Vol.54
  3. No.5

A Picturesque Maze Generation Algorithm with Any Given Endpoints

https://ipsj.ixsq.nii.ac.jp/records/92125
https://ipsj.ixsq.nii.ac.jp/records/92125
8b724cac-a569-4765-a822-e7377d4596c8
名前 / ファイル ライセンス アクション
IPSJ-JNL5405004.pdf IPSJ-JNL5405004 (975.3 kB)
Copyright (c) 2013 by the Information Processing Society of Japan
オープンアクセス
Item type Journal(1)
公開日 2013-05-15
タイトル
タイトル A Picturesque Maze Generation Algorithm with Any Given Endpoints
タイトル
言語 en
タイトル A Picturesque Maze Generation Algorithm with Any Given Endpoints
言語
言語 eng
キーワード
主題Scheme Other
主題 [特集:パズルの数理] picturesque maze, 2-edge-connectivity, given endpoints
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
資源タイプ journal article
著者所属
NTT Secure Platform Laboratories
著者所属(英)
en
NTT Secure Platform Laboratories
著者名 Koki, Hamada

× Koki, Hamada

Koki, Hamada

Search repository
著者名(英) Koki, Hamada

× Koki, Hamada

en Koki, Hamada

Search repository
論文抄録
内容記述タイプ Other
内容記述 A picturesque maze is a kind of maze in which the solution path reveals a hidden black-and-white raster image. We propose here an algorithm to generate a picturesque maze of a given black-and-white raster image. Okamoto and Uehara proposed an algorithm to generate a picturesque maze by turning each original pixel into a 2-by-2 set of pixels. One drawback of the method is that the entrance and the exit are always adjacent. We propose a simple algorithm to generate a picturesque maze with any given endpoints for a 2-edge-connected input image.

------------------------------
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.21(2013) No.3 (online)
DOI http://dx.doi.org/10.2197/ipsjjip.21.393
------------------------------
論文抄録(英)
内容記述タイプ Other
内容記述 A picturesque maze is a kind of maze in which the solution path reveals a hidden black-and-white raster image. We propose here an algorithm to generate a picturesque maze of a given black-and-white raster image. Okamoto and Uehara proposed an algorithm to generate a picturesque maze by turning each original pixel into a 2-by-2 set of pixels. One drawback of the method is that the entrance and the exit are always adjacent. We propose a simple algorithm to generate a picturesque maze with any given endpoints for a 2-edge-connected input image.

------------------------------
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.21(2013) No.3 (online)
DOI http://dx.doi.org/10.2197/ipsjjip.21.393
------------------------------
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AN00116647
書誌情報 情報処理学会論文誌

巻 54, 号 5, 発行日 2013-05-15
ISSN
収録物識別子タイプ ISSN
収録物識別子 1882-7764
戻る
0
views
See details
Views

Versions

Ver.1 2025-01-20 06:48:25.249749
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