Graph-based Computation of Voronoi Diagrams on Large-scale Point-based Surfaces - Laboratoire d'Informatique, Signaux et Systèmes de Sophia-Antipolis Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Graph-based Computation of Voronoi Diagrams on Large-scale Point-based Surfaces

Résumé

We 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.
Fichier principal
Vignette du fichier
2022_BPA_EGshort_GraphVoronoi.pdf (26.1 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03608439 , version 1 (25-05-2022)

Identifiants

  • HAL Id : hal-03608439 , version 1

Citer

A Bletterer, Frédéric Payan, Marc Antonini. Graph-based Computation of Voronoi Diagrams on Large-scale Point-based Surfaces. Eurographics 2022 (Short Paper Session), Apr 2022, Reims, France. ⟨hal-03608439⟩
61 Consultations
30 Téléchargements

Partager

Gmail Facebook X LinkedIn More