Graph-based surface reconstruction using structures in scattered point sets

R. Mencl, H. Müller
{"title":"Graph-based surface reconstruction using structures in scattered point sets","authors":"R. Mencl, H. Müller","doi":"10.1109/CGI.1998.694281","DOIUrl":null,"url":null,"abstract":"The authors present an algorithm for the reconstruction of a surface from an unorganized set of points in space. The point data may be obtained from a laser range scanner or any other digitizing tool to describe the shape of the object(s). The basic idea of the algorithm is to construct some kind of wire frame for the surface, the so-called surface description graph. This is performed by applying several steps. In the final part of the algorithm this wire frame is then filled with triangles. Each step uses rules for the reconstruction which are based on human knowledge in geometric structures. These rules are designed to allow the reconstruction of artificial objects as well as natural objects and are extendable in many aspects for ongoing research. As a result of this approach, the algorithm is able to reconstruct surfaces in data sites with changing point density as well as high curvature of the surface. In addition, it automatically recognizes the number of objects covered in the point set. Several examples are given to demonstrate its features.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"64","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Computer Graphics International (Cat. No.98EX149)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CGI.1998.694281","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 64

Abstract

The authors present an algorithm for the reconstruction of a surface from an unorganized set of points in space. The point data may be obtained from a laser range scanner or any other digitizing tool to describe the shape of the object(s). The basic idea of the algorithm is to construct some kind of wire frame for the surface, the so-called surface description graph. This is performed by applying several steps. In the final part of the algorithm this wire frame is then filled with triangles. Each step uses rules for the reconstruction which are based on human knowledge in geometric structures. These rules are designed to allow the reconstruction of artificial objects as well as natural objects and are extendable in many aspects for ongoing research. As a result of this approach, the algorithm is able to reconstruct surfaces in data sites with changing point density as well as high curvature of the surface. In addition, it automatically recognizes the number of objects covered in the point set. Several examples are given to demonstrate its features.
基于散点集结构的基于图的曲面重建
作者提出了一种从空间中无组织点集重建曲面的算法。所述点数据可以从激光距离扫描仪或任何其他数字化工具获得,以描述所述物体的形状。该算法的基本思想是为曲面构造某种线框,即所谓的曲面描述图。这是通过应用几个步骤来完成的。在算法的最后一部分,这个线框然后填充三角形。每一步都使用基于人类几何结构知识的重建规则。这些规则旨在允许人工物体和自然物体的重建,并在许多方面为正在进行的研究进行扩展。该方法能够在点密度变化和曲面曲率较大的数据点重构曲面。此外,它还会自动识别点集中覆盖的物体数量。给出了几个例子来说明它的特点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信