ログイン 新規登録
言語:

WEKO3

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

Field does not validate



インデックスリンク

インデックスツリー

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

WEKO

One fine body…

WEKO

One fine body…

アイテム

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

High Quality Consistent Digital Curved Rays via Vector Field Rounding

https://ipsj.ixsq.nii.ac.jp/records/213772
https://ipsj.ixsq.nii.ac.jp/records/213772
e1e39e5c-b3dd-46cd-9e0f-3f4f456e810c
名前 / ファイル ライセンス アクション
IPSJ-AL21185011.pdf IPSJ-AL21185011.pdf (1.1 MB)
Copyright (c) 2021 by the Information Processing Society of Japan
オープンアクセス
Item type SIG Technical Reports(1)
公開日 2021-11-11
タイトル
タイトル High Quality Consistent Digital Curved Rays via Vector Field Rounding
タイトル
言語 en
タイトル High Quality Consistent Digital Curved Rays via Vector Field Rounding
言語
言語 eng
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_18gh
資源タイプ technical report
著者所属
Department of Computer Science, Scool of Engineering, Kwansei Gakuin University
著者所属
Graduate School of Information Science and Technology, The University of Tokyo
著者所属(英)
en
Department of Computer Science, Scool of Engineering, Kwansei Gakuin University
著者所属(英)
en
Graduate School of Information Science and Technology, The University of Tokyo
著者名 Takeshi, Tokuyama

× Takeshi, Tokuyama

Takeshi, Tokuyama

Search repository
Ryo, Yoshimura

× Ryo, Yoshimura

Ryo, Yoshimura

Search repository
著者名(英) Takeshi, Tokuyama

× Takeshi, Tokuyama

en Takeshi, Tokuyama

Search repository
Ryo, Yoshimura

× Ryo, Yoshimura

en Ryo, Yoshimura

Search repository
論文抄録
内容記述タイプ Other
内容記述 We consider the consistent digital rays (CDR) of curved rays, which approximates a set of curved rays emanating from the origin by the set of rooted paths (called digital rays) of a spanning tree of a grid graph. Previously, a construction algorithm of CDR for diffused families of curved rays to attain an O(√n log n) bound for the distance between digital ray and the corresponding ray is known [11]. In this paper, we give a description of the problem as a rounding problem of the vector field generated from the ray family, and investigate the relation of the quality of CDR and the discrepancy of the range space generated from gradient curves of rays. Consequently, we show the existence of a CDR with an O(log1.5 n) distance bound for any diffused family of curved rays.
論文抄録(英)
内容記述タイプ Other
内容記述 We consider the consistent digital rays (CDR) of curved rays, which approximates a set of curved rays emanating from the origin by the set of rooted paths (called digital rays) of a spanning tree of a grid graph. Previously, a construction algorithm of CDR for diffused families of curved rays to attain an O(√n log n) bound for the distance between digital ray and the corresponding ray is known [11]. In this paper, we give a description of the problem as a rounding problem of the vector field generated from the ray family, and investigate the relation of the quality of CDR and the discrepancy of the range space generated from gradient curves of rays. Consequently, we show the existence of a CDR with an O(log1.5 n) distance bound for any diffused family of curved rays.
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AN1009593X
書誌情報 研究報告アルゴリズム(AL)

巻 2021-AL-185, 号 11, p. 1-8, 発行日 2021-11-11
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 17:01:46.388969
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