scispace - formally typeset
Search or ask a question
Topic

Voronoi diagram

About: Voronoi diagram is a research topic. Over the lifetime, 7743 publications have been published within this topic receiving 186181 citations. The topic is also known as: Voronoi diagrams & Voronoi polygons.


Papers
More filters
Journal ArticleDOI
TL;DR: The Voronoi diagram as discussed by the authors divides the plane according to the nearest-neighbor points in the plane, and then divides the vertices of the plane into vertices, where vertices correspond to vertices in a plane.
Abstract: Computational geometry is concerned with the design and analysis of algorithms for geometrical problems. In addition, other more practically oriented, areas of computer science— such as computer graphics, computer-aided design, robotics, pattern recognition, and operations research—give rise to problems that inherently are geometrical. This is one reason computational geometry has attracted enormous research interest in the past decade and is a well-established area today. (For standard sources, we refer to the survey article by Lee and Preparata [19841 and to the textbooks by Preparata and Shames [1985] and Edelsbrunner [1987bl.) Readers familiar with the literature of computational geometry will have noticed, especially in the last few years, an increasing interest in a geometrical construct called the Voronoi diagram. This trend can also be observed in combinatorial geometry and in a considerable number of articles in natural science journals that address the Voronoi diagram under different names specific to the respective area. Given some number of points in the plane, their Voronoi diagram divides the plane according to the nearest-neighbor

4,236 citations

Book
01 Jan 1992
TL;DR: In this article, the Voronoi diagram generalizations of the Voroni diagram algorithm for computing poisson Voroni diagrams are defined and basic properties of the generalization of Voroni's algorithm are discussed.
Abstract: Definitions and basic properties of the Voronoi diagram generalizations of the Voronoi diagram algorithms for computing Voronoi diagrams poisson Voronoi diagrams spatial interpolation models of spatial processes point pattern analysis locational optimization through Voronoi diagrams.

4,018 citations

Journal ArticleDOI
07 Aug 2002
TL;DR: In this paper, the authors describe decentralized control laws for the coordination of multiple vehicles performing spatially distributed tasks, which are based on a gradient descent scheme applied to a class of decentralized utility functions that encode optimal coverage and sensing policies.
Abstract: This paper describes decentralized control laws for the coordination of multiple vehicles performing spatially distributed tasks. The control laws are based on a gradient descent scheme applied to a class of decentralized utility functions that encode optimal coverage and sensing policies. These utility functions are studied in geographical optimization problems and they arise naturally in vector quantization and in sensor allocation tasks. The approach exploits the computational geometry of spatial structures such as Voronoi diagrams.

2,445 citations

Journal ArticleDOI
TL;DR: Some applications of centroidal Voronoi tessellations to problems in image compression, quadrature, finite difference methods, distribution of resources, cellular biology, statistics, and the territorial behavior of animals are given.
Abstract: A centroidal Voronoi tessellation is a Voronoi tessellation whose generating points are the centroids (centers of mass) of the corresponding Voronoi regions. We give some applications of such tessellations to problems in image compression, quadrature, finite difference methods, distribution of resources, cellular biology, statistics, and the territorial behavior of animals. We discuss methods for computing these tessellations, provide some analyses concerning both the tessellations and the methods for their determination, and, finally, present the results of some numerical experiments.

2,151 citations

Book ChapterDOI
01 Jan 2003
TL;DR: A unified and consistent set of flexible tools to approximate important geometric attributes, including normal vectors and curvatures on arbitrary triangle meshes, using averaging Voronoi cells and the mixed Finite-Element/Finite-Volume method is proposed.
Abstract: This paper proposes a unified and consistent set of flexible tools to approximate important geometric attributes, including normal vectors and curvatures on arbitrary triangle meshes. We present a consistent derivation of these first and second order differential properties using averaging Voronoi cells and the mixed Finite-Element/Finite-Volume method, and compare them to existing formulations. Building upon previous work in discrete geometry, these operators are closely related to the continuous case, guaranteeing an appropriate extension from the continuous to the discrete setting: they respect most intrinsic properties of the continuous differential operators. We show that these estimates are optimal in accuracy under mild smoothness conditions, and demonstrate their numerical quality. We also present applications of these operators, such as mesh smoothing, enhancement, and quality checking, and show results of denoising in higher dimensions, such as for tensor images.

2,003 citations


Network Information
Related Topics (5)
Matrix (mathematics)
105.5K papers, 1.9M citations
79% related
Cluster analysis
146.5K papers, 2.9M citations
79% related
Robustness (computer science)
94.7K papers, 1.6M citations
78% related
Optimization problem
96.4K papers, 2.1M citations
78% related
Probabilistic logic
56K papers, 1.3M citations
77% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023251
2022500
2021263
2020284
2019322
2018329