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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Path planning still remains one of the core problems in modern robotic applications, such as the design of autonomous vehicles… 
Highly Cited
2003
Highly Cited
2003
A broad variety of location dependent services will become feasible in the near future due to the use of the Global Positioning… 
Highly Cited
1999
Highly Cited
1999
We present a new approach for computing generalized 2D and 3D Voronoi diagrams using interpolation-based polygon rasterization… 
Highly Cited
1998
Highly Cited
1998
This paper presents a method of page segmentation based on the approximated area Voronoi diagram. The characteristics of the… 
Highly Cited
1990
Highly Cited
1990
In this paper we give a new randomized incremental algorithm for the construction of planar Voronoi diagrams and Delaunay… 
Highly Cited
1989
Highly Cited
1989
A general method is presented for determining the mathematical expectation of the combinatorial complexity and other properties… 
Highly Cited
1989
Highly Cited
1989
An algorithm for planning a collision-free path for a rectangle in a planar workspace populated with polygonal obstacles is… 
Highly Cited
1986
Highly Cited
1986
We introduce a geometric transformation that allows Voronoi diagrams to be computed using a sweepline technique. The… 
Highly Cited
1983
Highly Cited
1983
The following problem is discussed: given n points in the plane (the sites) and an arbitrary query point q, find the site that is… 
Highly Cited
1982
Highly Cited
1982
The notion of Voronoi diagram for a set of N points in the Euclidean plane is generalized to the Voronoi diagram of order k and…