• Aucun résultat trouvé

Bornes sur l'élongation du plus court chemin dans la triangulation de Delaunay d'un processus de Poisson de grande densité

N/A
N/A
Protected

Academic year: 2021

Partager "Bornes sur l'élongation du plus court chemin dans la triangulation de Delaunay d'un processus de Poisson de grande densité"

Copied!
38
0
0

Texte intégral

Loading

Figure

Figure 2: The paths SP X , U P X , and GP X (the path GP X is defined in Section 6).
Figure 3: Notation for the proofs of Propositions 6 and 7.
Figure 5: Lattice animals. The pixels C(v) for v ∈ A(P) are hashed and the path P is purple.
Figure 6: Illustration for the proof of Lemma 10. Left: A realization of the paths P , P 00 , and P 0
+7

Références

Documents relatifs

Obviously, the length of the Voronoi path gives an upper bound on the length of the shortest path and provides an upper bound on the expected stretch ratio of long walks in the

Consequently, we show that the distribution of the number of 3-cuts in a random rooted 3-connected planar triangula- tion with n + 3 vertices is asymptotically normal with mean

The shortened Voronoi path has the property to be locally defined ; and is shorter than the previously known locally defined path in Delaunay triangulation such as the upper path

Ilias, Immersions minimales, premiere valeur propre du Lapla- cien et volume conforme, Mathematische Annalen, 275(1986), 257-267; Une ine- galit´e du type ”Reilly” pour

This previously unaccounted for licking behavior of cattle creates highly variable drug pharmacokinetics and pharmaco- dynamics in treated animals that may impact the design of

differently, if an employee felt that telephone monitoring was something that had few redeeming qualities, and it was an integral part of the work setting, then

The shortened Voronoi path has the property to be locally defined; and is shorter than the previously known locally defined paths in Delaunay triangulation such as the upper path