• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Construction of graphics data by using 3D data scanner

Research Project

Project/Area Number 07650461
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field System engineering
Research InstitutionHIROSHIMA UNIVERSITY

Principal Investigator

HARADA Koichi  Hiroshima University, Faculty of Integrated Arts and Sciences, Professor, 総合科学部, 教授 (90124114)

Project Period (FY) 1995 – 1996
Project Status Completed (Fiscal Year 1996)
Budget Amount *help
¥2,000,000 (Direct Cost: ¥2,000,000)
Fiscal Year 1996: ¥700,000 (Direct Cost: ¥700,000)
Fiscal Year 1995: ¥1,300,000 (Direct Cost: ¥1,300,000)
Keywords3D data / Image data input / Compuer graphics / Image scanner / Data scanner / Minimax method / Curvature pattern / Cone intersection method / 3次元曲面 / 三次元座標読み取り装置 / Mini Max法 / グラフィックスデータ構成法 / 三角形パッチ / クラック / 接続境界線
Research Abstract

The objective of this research project is to develop a simple and efficient 3D data input method that is widely used for 3D object design and manufacturing. Two stages of research has been established for this purpose : (a) Processing the given 3D data and then convert the data for 3D rendering of CG (Computer Graphics) presentation (the actual data is the position data and the derivative data that are required for triangular or square patch definition). (b) The obtained curved surface data is merged to the traditional data given by three view plane method and/or sweep method. To accomplish (a) we use the public 3D database provided by NRCC (National Research Council Canada), and have obtained the following theoretical results :
(1) The 3D data given by 3D data scanner can be treated as the set of 2D data. The minimax data reduction method for 2D data is useful for this type of 3D data.
(2) For the application of large amount of data, the cone intersection method (one of the local methods) is also applied for the same reduction problem and proposed the case dependent application of the global methods and local methods.
(3) Framework of applying the cone intersection method is proposed to introduce the concept of minimum convex hull of the local data.
(4) The value of curvature is introduced to reduce the number of data. This method offers a theoretical background for automatic detecting the useful data contained in the given 3D data acquired by 3D data scanner.
(5) The concept of efficient data retrieval yields the clothoid curve -- one of nonlinear spline curves -- that introduces the directional processing for 2D data.

Report

(3 results)
  • 1996 Annual Research Report   Final Research Report Summary
  • 1995 Annual Research Report
  • Research Products

    (18 results)

All Other

All Publications (18 results)

  • [Publications] 原田、伊藤: "近似誤差という観点からのミニマックス近似法の評価" 電子情報通信学会論文誌. J79-DII・2. 174-181 (1996)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] 宮奥,原田: "円錐交差法による多角形曲線近似の一手法" 電子情報通信学会論文誌. J79-DII・3. 365-373 (1996)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] K.Miyaoku,K.Harada: "The Cone Intersection Method for Min Polygonal Approximation in R2" Trans.IEICE of Japan. E79-D・4. 343-348 (1996)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] K.Miyaoku,K.Harada: "Effective data reduction by the curvatuer-based polygonal approximation" Trans.IEICE of Japan. E80-D・2. 250-258 (1997)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] V.S.R.Sasipalli,K.Harada: "Reversibly visible polygons and polygonal approximation in two dimensional space" Proc.CG Intn'l 97. (to appear). (1997)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] K.Harada, K.Ito: "An Evaluation of Mini-max Approximation Method from the View Point of Approximation Error" Trans.IEICE of Japan. Vol.J79-D-II. 174-181 (1996)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] K.Miyaoku, K.Harada: "A Modification of the Polygonal Approximation Algorithm by Using Cone Intersection Method" Trans.IEICE of Japan. Vol.J79-D-II. 365-373 (1996)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] K.Miyaoku, K.Harada: "The Cone Intersection Method for Min-#Polygonal Approximation in R2" Trans.IEICE of Japan. Vol.E79-D. 343-348 (1996)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] K.Miyaoku, K.Harada: "Effeetive data reduction by the curvatuer-based polygonal approximation" Trans.IEICE of Japan. Vol.E80-D. 250-258 (1997)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] V.S.R.Sasipalli, K.Harada: "Reversibly visible polygons and polygonal approximation in two dimensional space" Proc.CG Intn'l97. (to appear).

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] 原田,伊藤: "近似誤差という観点からのミニマックス近似法の評価" 電子情報通信学会論文誌. J79-D11・2. 174-181 (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] 宮奥、原田: "円錐交差法による多角形曲線近似の一手法" 電子情報通信学会論文誌. J79-DII・3. 365-373 (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] K.Miyaoku, K.Hrada: "The Cone Intersection Method for Min-# Polygonal Approximation in R2" Trans. IEICE of Japan. E79-D・4. 343-348 (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] K.Miyaoku, K.Harada: "Effective data reduction by the curvatuer-based polygonal approximation" Trans. IEICE of Japan. E80-D・2. 250-258 (1997)

    • Related Report
      1996 Annual Research Report
  • [Publications] V.S.R. Sasipalli, K.Harada: "Reversibly visible polygons and polygonal approximation in two dimensional space" Proc. CG Intn′l 97. (to appear). (1997)

    • Related Report
      1996 Annual Research Report
  • [Publications] 原田, 伊藤: "近似誤差という観点からのミニマックス近似法の評価" 電子情報通信学会論文誌. J79-DII. 174-181 (1996)

    • Related Report
      1995 Annual Research Report
  • [Publications] 宮奥, 原田: "円錐交差法による多角形曲線近似の-手法" 電子情報通信学会論文誌. J79-DII(印刷中). (1996)

    • Related Report
      1995 Annual Research Report
  • [Publications] K. Miyaoku, K.Harada: "The Cone Intersection Method for Min-♯ Polygonal Appniximst in R^2" Trans IEICE Japan. (掲載予定). (1996)

    • Related Report
      1995 Annual Research Report

URL: 

Published: 1995-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi