The Maximum Degree of a Random Delaunay Triangulation in a Smooth Convex - Inria - Institut national de recherche en sciences et technologies du numérique
Poster Communications Year : 2014

The Maximum Degree of a Random Delaunay Triangulation in a Smooth Convex

Nicolas Broutin
  • Function : Author
  • PersonId : 874919
Networks, Algorithms and Probabilities
Olivier Devillers
Geometric computing
CV
Ross Hemsley
  • Function : Author
Geometric computing

Abstract

We give a new polylogarithmic bound on the maximum degree of a random Delaunay triangulation in a smooth convex, that holds with probability one as the number of points goes to infinity. In particular, our new bound holds even for points arbitrarily close to the boundary of the domain.

Domains

Data Structures and Algorithms [cs.DS]
Fichier principal
Vignette du fichier
degree.pdf (74.58 Ko) Télécharger le fichier
Vignette du fichier
max_degree2.png (87.19 Ko) Télécharger le fichier
poster.pdf (144.04 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Format Figure, Image
Origin Publisher files allowed on an open archive

Ross Hemsley  : Connect in order to contact the contributor

https://inria.hal.science/hal-01018187

Submitted on : Thursday, July 3, 2014-5:34:49 PM

Last modification on : Wednesday, March 15, 2023-8:58:09 AM

Long-term archiving on : Friday, October 3, 2014-12:01:23 PM

Download

Dates and versions

hal-01018187 , version 1 (03-07-2014)

Identifiers

  • HAL Id : hal-01018187 , version 1

Cite

Nicolas Broutin, Olivier Devillers, Ross Hemsley. The Maximum Degree of a Random Delaunay Triangulation in a Smooth Convex. AofA 2014 - 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (2014), Jun 2014, Paris, France. ⟨hal-01018187⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

INRIA INRIA2 ANR
245 View
1140 Download

Share

More