Surfel Based Geometry Resonstruction

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2010

Documents

View graph of relations

We propose a method for retrieving a piecewise smooth surface from noisy data. In data acquired by a scanning process sampled points are almost never on the discontinuities making reconstruction of surfaces with sharp features difficult. Our method is based on a Markov Random Field (MRF) formulation of a surface prior, with the surface represented as a collection of small planar patches, the surfels, associated with each data point. The main advantage of using surfels is that we avoid treating data points as vertices. MRF formulation of the surface prior allows us to separately model the likelihood (related to the mesh formation process) and the local surface properties. We chose to model the smoothness by considering two terms: the parallelism between neighboring surfels, and their overlap. We have demonstrated the feasibility of this approach on both synthetical and scanned data. In both cases sharp features were precisely located and planar regions smoothed.
Original languageEnglish
TitleTheory and Practice of Computer Graphics 2010 : Eurographics UK Chapter Proceedings
EditorsJohn Collomosse, Ian Grimstead
PublisherEurographics Association
Publication date2010
Pages39-44
ISBN (print)978-3-905673-75-3
StatePublished

Conference

ConferenceTheory and Practice of Computer Graphics
Number8
CitySheffield
Period01/01/10 → …
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

Download statistics

No data available

ID: 5831595