{"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}
引用次数: 7
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.