The power of geometric duality
BIT - Ellis Horwood series in artificial intelligence
Computational geometry: an introduction
Computational geometry: an introduction
Edge-skeletons in arrangements with applications
Algorithmica
A sweepline algorithm for Voronoi diagrams
SCG '86 Proceedings of the second annual symposium on Computational geometry
Constructing arrangements of lines and hyperplanes with applications
SIAM Journal on Computing
On k-hulls and related problems
SIAM Journal on Computing
On k-Nearest Neighbor Voronoi Diagrams in the Plane
IEEE Transactions on Computers
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
Solving query-retrieval problems by compacting Voronoi diagrams
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Constructing levels in arrangements and higher order Voronoi diagrams
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Iterated nearest neighbors and finding minimal polytypes
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Dynamic planar convex hull operations in near-logarithmic amortized time
Journal of the ACM (JACM)
A note on higher order Voronoi diagrams
Nordic Journal of Computing
Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Almost-Delaunay simplices: nearest neighbor relations for imprecise points
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The privacy of k-NN retrieval for horizontal partitioned data: new methods and applications
ADC '07 Proceedings of the eighteenth conference on Australasian database - Volume 63
Note: Computing closest and farthest points for a query segment
Theoretical Computer Science
Two-site Voronoi diagrams in geographic networks
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
AN ORDER-k VORONOI APPROACH TO GEOSPATIAL CONCEPT MANAGEMENT WITHIN CONCEPTUAL SPACES
Applied Artificial Intelligence
Finding an Euclidean anti-k-centrum location of a set of points
Computers and Operations Research
What-if emergency management system: a generalized Voronoi diagram approach
PAISI'07 Proceedings of the 2007 Pacific Asia conference on Intelligence and security informatics
Geospatial cluster tessellation through the complete order-k Voronoi diagrams
COSIT'07 Proceedings of the 8th international conference on Spatial information theory
Higher order Voronoi diagrams of segments for VLSI critical area extraction
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
On the triangle-perimeter two-site Voronoi diagram
Transactions on computational science IX
On the triangle-perimeter two-site Voronoi diagram
Transactions on computational science IX
An output-sensitive approach for the L1/L∞k-nearest-neighbor Voronoi diagram
ESA'11 Proceedings of the 19th European conference on Algorithms
On solving coverage problems in a wireless sensor network using voronoi diagrams
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Round-trip voronoi diagrams and doubling density in geographic networks
Transactions on Computational Science XIV
Higher order city voronoi diagrams
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
UV-diagram: a voronoi diagram for uncertain spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 14.98 |
The kth-order Voronoi diagram of a finite set of sites in the Euclidean plane E2 subdivides E2 into maximal regions such that all points within a given region have the same k nearest sites. Two versions of an algorithm are developed for constructing the kth-order Voronoi diagram of a set of n sites in O(n2 log n + k(n - k) log2 n) time, O(k(n - k)) storage, and in O(n2 + k(n - k) log2 n) time, O(n2) storage, respectively.