Walking in random Delaunay triangulations - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Walking in random Delaunay triangulations

Résumé

Traversing a triangulation using neighbourhood relationships is a common tool, for example just to perform point location in the triangulation or to route a message if the triangulation represents a communication network. Analyzing walking algorithms is a classic of computational geometry and in the worst case, many results have been obtained, and several problems remain open. In this talk, we will focus on the random case: what are the expected performance of some walking strategies ?
Fichier non déposé

Dates et versions

hal-04158857 , version 1 (11-07-2023)

Licence

Paternité

Identifiants

  • HAL Id : hal-04158857 , version 1

Citer

Olivier Devillers. Walking in random Delaunay triangulations. Stochastic Geometry Days, Nov 2021, Dunkerque, France. ⟨hal-04158857⟩
16 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More