Maintaining 2D Delaunay triangulations on the GPU for proximity queries of moving points - Archive ouverte HAL Access content directly
Conference Papers Year : 2023

Maintaining 2D Delaunay triangulations on the GPU for proximity queries of moving points

Abstract

In this paper we explore the problem of maintaining the Delaunay triangulation of moving 2D points on the GPU with discrete time steps, using only local transformations. We show that our Delaunay triangulation structure is efficient at answering proximity queries, such as closest neighbor or fixed-radius nearest neighbors problems. We also characterize the difficulties of updating the triangulation, and also the cases where it is possible to do it only through local operations.
Fichier principal
Vignette du fichier
IMR_Research_note_2023 (1).pdf (497.84 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04029968 , version 1 (15-03-2023)

Identifiers

  • HAL Id : hal-04029968 , version 1

Cite

Heinich Porro, Benoît Crespin, Nancy Hitschfeld, Cristóbal Navarro, Francisco Carter. Maintaining 2D Delaunay triangulations on the GPU for proximity queries of moving points. SIAM International Meshing Roundtable Workshop 2023 (SIAM IMR 2023), Mar 2023, Amsterdam, Netherlands. ⟨hal-04029968⟩
65 View
114 Download

Share

Gmail Facebook X LinkedIn More