-
Triangulation de Delaunay et arbres multidimensionnels
This thesis deals mainly with Delaunay triangulations. It is shown that the average complexity of k-dimensional merge processes - according to unRnished sites - is... -
The expected number of 3D visibility events is linear
International audience
