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
2016
Highly Cited
2016
Thank you for downloading spatial tessellations concepts and applications of voronoi diagrams. Maybe you have knowledge that… 
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
2004
Highly Cited
2004
  • S. Fortune
  • Handbook of Discrete and Computational Geometry…
  • 2004
  • Corpus ID: 19663265
The Voronoi diagram of a set of sites partitions space into regions one per site the region for a site s consists of all points… 
Highly Cited
2000
Highly Cited
2000
Highly Cited
1998
Highly Cited
1998
Author(s): Amenta, Nina; Bern, Marshall; Kamvysselis, Manolis | Abstract: We describe our experience with a new algorithm for the… 
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
1992
Highly Cited
1992
Definitions and Basic Properties of Voronoi Diagrams. Generalizations of the Voronoi Diagram. Algorithms for Computing Voronoi… 
Review
1991
Review
1991
Computational geometry is concerned with the design and analysis of algorithms for geometrical problems. In addition, other more… 
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
1985
Highly Cited
1985
The following problem is discussed: given n points in the plane (the sites) and an arbitrary query point q, find the site that is…