Algorithms for optimal segmentation of regions decomposable into basic shapes (Theoretical foundations of computing)

Icons representing 記事

Algorithms for optimal segmentation of regions decomposable into basic shapes

(Theoretical foundations of computing)

Call No. (NDL)
Z16-940
Bibliographic ID of National Diet Library
10274954
Material type
記事
Author
葛西 亮生ほか
Publisher
東京 : 電子情報通信学会
Publication date
2009-06-29
Material Format
Paper
Journal name
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 109(108) 2009.6.29
Publication Page
p.23~30
View All

Holdings of Libraries in Japan

This page shows libraries in Japan other than the National Diet Library that hold the material.

Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.

other

  • CiNii Research

    Search Service
    You can check the holdings of institutions and databases with which CiNii Research is linked at the site of CiNii Research.

Bibliographic Record

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Paper

Material Type
記事
Author/Editor
葛西 亮生
全 眞嬉
Matias Korman 他
Alternative Title
基本図形分割可能領域の最適切り出しアルゴリズム
Periodical title
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報
No. or year of volume/issue
109(108) 2009.6.29
Volume
109
Issue
108