A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
type: Item
instance of: scholarly article
title: A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
zbMATH Open document ID: 0971.68182
DOI: 10.1016/S0925-7721(00)00017-1
author: C. Lemaire
author: J.-M. Moreau
published in: Computational Geometry
publication date: 2001-02-22T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1569501
zbMATH Keywords: Delaunay triangulations
describes a project that uses: LEDA
describes a project that uses: CGAL
describes a project that uses: DeWall
describes a project that uses: Triangle
MaRDI profile type: Publication
cites work: Hashing lazy numbers
cites work: Multidimensional binary search trees used for associative searching
cites work: Geometry. I, II. Transl. from the French by M. Cole and S. Levy
cites work: THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION
cites work: Q3814809
cites work: DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).
cites work: Q3619797
cites work: A faster divide-and-conquer algorithm for constructing Delaunay triangulations
cites work: Higher-dimensional Voronoi diagrams in linear expected time
cites work: Q3772828
cites work: An Algorithm for Finding Best Matches in Logarithmic Expected Time
cites work: Primitives for the manipulation of general subdivisions and the computation of Voronoi
cites work: IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
cites work: Q3796756
cites work: Two algorithms for constructing a Delaunay triangulation
cites work: Delaunay triangulation and the convex hull of n points in expected linear time
cites work: Q4702188
cites work: A comparison of sequential Delaunay triangulation algorithms.
Wikidata QID: Q127797727
description: scientific article; zbMATH DE number 1569501