中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/26849
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 80990/80990 (100%)
造访人次 : 41268967      在线人数 : 280
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/26849


    题名: Development of feature segmentation algorithms for quadratic surfaces
    作者: Lai,HC;Chang,YH;Lai,JY
    贡献者: 機械工程研究所
    关键词: TRIANGULAR MESHES
    日期: 2009
    上传时间: 2010-06-29 18:01:39 (UTC+8)
    出版者: 中央大學
    摘要: Segmentation is a process of partitioning the data in a triangular model to extract the feature regions for use in surface reconstruction. Quadratic surfaces are among the common entities in typical CAD models and should be reconstructed accurately. The purpose of this study is to develop a method for segmenting quadratic features from triangular meshes. The proposed process is primarily composed of two steps. In the first step, a region growing is developed to search for a small area near a seed point to determine the feature type, which can either be a plane, a spherical surface, a cylindrical surface or a conical surface. In the second step, a re-growing procedure is employed to search for the points of the same feature type. Moreover, an automatic algorithm is proposed to extract all planar regions for complex triangular models. The feasibility and limitations of the proposed method are demonstrated by real range data with various quadratic surfaces. (C) 2009 Elsevier Ltd. All rights reserved.
    關聯: ADVANCES IN ENGINEERING SOFTWARE
    显示于类别:[機械工程研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML406检视/开启


    在NCUIR中所有的数据项都受到原著作权保护.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明