Show simple item record

dc.contributor.authorBletterer, Arnauden_US
dc.contributor.authorPayan, Frédéricen_US
dc.contributor.authorAntonini, Marcen_US
dc.contributor.editorPelechano, Nuriaen_US
dc.contributor.editorVanderhaeghe, Daviden_US
dc.description.abstractWe present an original algorithm to construct Voronoi tessellations on surfaces from a set of depth maps. Based on a local graphbased structure, where each local graph spans one depth map, our algorithm is able to compute partial Voronoi diagrams (one per scan), and then to merge/update them into a single and globally consistent Voronoi diagram. Our first results show that this algorithm is particularly promising for improving the sampling quality of massive point clouds or for reconstructing very large-scale scenes, with low and manageable memory consumption.en_US
dc.publisherThe Eurographics Associationen_US
dc.rightsAttribution 4.0 International License
dc.subjectCCS Concepts: Computing methodologies --> Point-based models; Parametric curve and surface models
dc.subjectComputing methodologies
dc.subjectbased models
dc.subjectParametric curve and surface models
dc.titleGraph-based Computation of Voronoi Diagrams on Large-scale Point-based Surfacesen_US
dc.description.seriesinformationEurographics 2022 - Short Papers
dc.description.sectionheadersGeometry and Shape
dc.identifier.pages4 pages

Files in this item


This item appears in the following Collection(s)

Show simple item record

Attribution 4.0 International License
Except where otherwise noted, this item's license is described as Attribution 4.0 International License