基于可见性的离散模型特征提取

A. Chica
{"title":"基于可见性的离散模型特征提取","authors":"A. Chica","doi":"10.1145/1364901.1364951","DOIUrl":null,"url":null,"abstract":"In this paper, we present a new visibility-based feature extraction algorithm from discrete models as dense point clouds resulting from laser scans. Based on the observation that one can characterize local properties of the surface by what can be seen by an imaginary creature on the surface, we propose algorithms that extract features using an intermediate representation of the model as a discrete volume for computational efficiency. We describe an efficient algorithm for computing the visibility map among voxels, based on the properties of a discrete erosion. The visibility information obtained in this first step is then used to extract the model components (faces, edges and vertices) --- which may be curved---and to compute the topological connectivity graph in a very efficient and robust way. The results are discussed through several examples.","PeriodicalId":216067,"journal":{"name":"Symposium on Solid and Physical Modeling","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Visibility-based feature extraction from discrete models\",\"authors\":\"A. Chica\",\"doi\":\"10.1145/1364901.1364951\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a new visibility-based feature extraction algorithm from discrete models as dense point clouds resulting from laser scans. Based on the observation that one can characterize local properties of the surface by what can be seen by an imaginary creature on the surface, we propose algorithms that extract features using an intermediate representation of the model as a discrete volume for computational efficiency. We describe an efficient algorithm for computing the visibility map among voxels, based on the properties of a discrete erosion. The visibility information obtained in this first step is then used to extract the model components (faces, edges and vertices) --- which may be curved---and to compute the topological connectivity graph in a very efficient and robust way. The results are discussed through several examples.\",\"PeriodicalId\":216067,\"journal\":{\"name\":\"Symposium on Solid and Physical Modeling\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-06-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Symposium on Solid and Physical Modeling\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1364901.1364951\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symposium on Solid and Physical Modeling","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1364901.1364951","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

在本文中,我们提出了一种新的基于可见性的特征提取算法,将激光扫描产生的密集点云作为离散模型。基于观察到人们可以通过在表面上想象的生物可以看到的东西来表征表面的局部属性,我们提出了使用模型的中间表示作为离散体积来提取特征的算法,以提高计算效率。我们描述了一种有效的算法来计算体素之间的可见性映射,基于离散侵蚀的性质。在第一步中获得的可见性信息然后用于提取模型组件(面,边和顶点)-可能是弯曲的-并以非常有效和稳健的方式计算拓扑连接图。通过几个算例对结果进行了讨论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Visibility-based feature extraction from discrete models
In this paper, we present a new visibility-based feature extraction algorithm from discrete models as dense point clouds resulting from laser scans. Based on the observation that one can characterize local properties of the surface by what can be seen by an imaginary creature on the surface, we propose algorithms that extract features using an intermediate representation of the model as a discrete volume for computational efficiency. We describe an efficient algorithm for computing the visibility map among voxels, based on the properties of a discrete erosion. The visibility information obtained in this first step is then used to extract the model components (faces, edges and vertices) --- which may be curved---and to compute the topological connectivity graph in a very efficient and robust way. The results are discussed through several examples.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Robust Minkowski sums of polyhedra via controlled linear perturbation Adaptive surface reconstruction based on implicit PHT-splines Hexahedral shell mesh construction via volumetric polycube map Hierarchical surface fairing with constraints Accurate moment computation using the GPU
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1