Skip to search formSkip to main contentSkip to account menu

Voronoi diagram

Known as: Thiessen polygons, Voronoi pattern, Voronoi cells 
In mathematics, a Voronoi diagram is a partitioning of a plane into regions based on distance to points in a specific subset of the plane. That set… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Bowyer–Watson algorithmBregman divergenceCGALCentroidal Voronoi tessellation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
Fingerprint Matching Algorithm Based on Voronoi Diagram
In this paper we present a new indexing-based approach to fingerprint matching technique. Our proposed approach is the idea of… 
2007
2007
Visualizing bregman voronoi diagrams
Voronoi diagrams are fundamental geometric structures that partition the space into elementary regions of influence defining… 
2006
2006
Angular Voronoi Diagram with Applications
Given a set of line segments in the plane, we define an angular Voronoi diagram as follows: a point belongs to a Voronoi region… 
Highly Cited
2006
Highly Cited
2006
Detecting Coverage Boundary Nodes in Wireless Sensor Networks
The objective of this paper is to provide a distributed protocol that allows individual sensor nodes to identify themselves as… 
2006
2006
VORONOI Diagram-based Path Planning for UAVs
Path Planning for uninhabited air vehicles (UAVs) plays important roles in autonomous flight and completing mission. On the basis… 
Highly Cited
2005
Highly Cited
2005
Evolution of Field Early-Type Galaxies: The View from GOODS CDFS
We explore the evolution of field early-type galaxies in a sample extracted from the ACS images of the southern GOODS field. The… 
2005
2005
Approximations of 3D generalized Voronoi diagrams
We introduce a new approach to approximate generalized 3D Voronoi diagrams for different site shapes (points, spheres, segments… 
1999
1999
Skew Voronoi Diagrams
On a tilted plane T in three-space, skew distances are defined as the Euclidean distance plus a multiple of the signed difference… 
1997
1997
Voronoi diagrams for direction-sensitive distances
Most computational geometry research on planar problems assumes that the underlying plane is perfectly ‘flat’, in the sense that… 
1996
1996
Robust Proximity Queries in Implicit Voronoi Diagrams
In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact computation… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)