Bounds on Delaunay tessellations
| Autor: | Roger W. Shores, Edward J. Wegman |
|---|---|
| Rok vydání: | 2010 |
| Předmět: |
Statistics and Probability
Discrete mathematics Delaunay triangulation Gaussian Dimension (graph theory) Function (mathematics) Density estimation Computer Science::Computational Geometry Computational geometry Bowyer–Watson algorithm Combinatorics symbols.namesake symbols Voronoi diagram Mathematics |
| Zdroj: | Wiley Interdisciplinary Reviews: Computational Statistics. 2:571-580 |
| ISSN: | 1939-5108 |
| Popis: | Motivated by applications in density estimation and data compression, this article considers the bounds on the number of tiles in a Delaunay tessellation as a function of both the number of tessellating points and the dimension. Results can also be interpreted for the dual of the Delaunay tessellation, the Voronoi diagram. Several theoretical lower and upper bounds are found in the combinatorics and computational geometry literatures and are brought together in this article. We make a comparison of these bounds with several empirically derived curves based on multivariate uniform and Gaussian generated random tessellating points. The upper bounds are found to be very conservative when compared with the empirically derived number of tiles, often off by many orders of magnitude. Copyright © 2010 John Wiley & Sons, Inc. For further resources related to this article, please visit the WIREs website. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text