Show simple item record

dc.contributor.authorBletterer, Arnauden_US
dc.contributor.authorPayan, Frédéricen_US
dc.contributor.authorAntonini, Marcen_US
dc.contributor.authorMeftah, Anisen_US
dc.contributor.editorJu, Tao and Vaxman, Amiren_US
dc.date.accessioned2018-07-08T15:27:55Z
dc.date.available2018-07-08T15:27:55Z
dc.date.issued2018
dc.identifier.isbn978-3-03868-069-7
dc.identifier.issn1727-8384
dc.identifier.urihttps://doi.org/10.2312/sgp.20181178
dc.identifier.urihttps://diglib.eg.org:443/handle/10.2312/sgp20181178
dc.description.abstractNowadays, LiDAR scanners are able to capture complex scenes of real life, leading to extremely detailed point clouds. However, the amount of points acquired (several billions) and their distribution raise the problem of sampling a surface optimally. Indeed, these point clouds finely describe the acquired scene, but also exhibit numerous defects in terms of sampling quality, and sometimes contain too many samples to be processed as they are. In this work, we introduce a local graph-based structure that enables to manipulate gigantic point clouds, by taking advantage of their inherent structure. In particular, we show how this structure allows to resample gigantic point clouds efficiently, with good blue-noise properties, whatever their size in a reasonable time.en_US
dc.publisherThe Eurographics Associationen_US
dc.titleOut-of-core Resampling of Gigantic Point Cloudsen_US
dc.description.seriesinformationSymposium on Geometry Processing 2018- Posters
dc.description.sectionheadersPosters
dc.identifier.doi10.2312/sgp.20181178
dc.identifier.pages1-2


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record