Two-Dimensional Voronoi Diagrams in the Lp-Metric
Journal of the ACM (JACM)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Some approaches to best-match file searching
Communications of the ACM
An Algroithm for Finding Best Matches in Logarithmic Expected Time
An Algroithm for Finding Best Matches in Logarithmic Expected Time
A survey of techniques for fixed radius near neighbor searching.
A survey of techniques for fixed radius near neighbor searching.
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
IEEE Transactions on Computers
An Algorithm for Finding Nearest Neighbors
IEEE Transactions on Computers
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
Applications of a planar separator theorem
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Journal of Computer and System Sciences
An improved algorithm for constructing kth-order voronoi diagrams
IEEE Transactions on Computers
The Largest Empty Annulus Problem
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Higher Order Delaunay Triangulations
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Region-restricted clustering for geographic data mining
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Note: Computing closest and farthest points for a query segment
Theoretical Computer Science
Constructing minimum-interference networks
Computational Geometry: Theory and Applications
Region-restricted clustering for geographic data mining
Computational Geometry: Theory and Applications
Two-site Voronoi diagrams in geographic networks
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Depth of segments and circles through points enclosing many points: a note
Computational Geometry: Theory and Applications
Higher-order Voronoi diagrams on triangulated surfaces
Information Processing Letters
2-Covered paths by a set of antennas with minimum power transmission range
Information Processing Letters
Approximate Evaluation of Range Nearest Neighbor Queries with Quality Guarantee
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
AN ORDER-k VORONOI APPROACH TO GEOSPATIAL CONCEPT MANAGEMENT WITHIN CONCEPTUAL SPACES
Applied Artificial Intelligence
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
Analysis of higher order Voronoi diagram for fuzzy information coverage
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Obstacle discovery in distributed actuator and sensor networks
ACM Transactions on Sensor Networks (TOSN)
IEEE Transactions on Signal Processing
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
Evaluating coverage quality through best covered pathes in wireless sensor networks
Proceedings of the Nineteenth International Workshop on Quality of Service
An output-sensitive approach for the L1/L∞k-nearest-neighbor Voronoi diagram
ESA'11 Proceedings of the 19th European conference on Algorithms
SIAM Journal on Computing
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
Constructing interference-minimal networks
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
k-sets of convex inclusion chains of planar point sets
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Round-trip voronoi diagrams and doubling density in geographic networks
Transactions on Computational Science XIV
GPU-Based influence regions optimization
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
Higher order city voronoi diagrams
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Covering a bichromatic point set with two disjoint monochromatic disks
Computational Geometry: Theory and Applications
On the complexity of higher order abstract voronoi diagrams
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Information Processing Letters
| Hi-index | 14.99 |
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 an iterative algorithm to construct the generalized diagram in 0(k2N log N) time using 0(k2(N - k)) space is presented. It is shown that the k-nearest neighbor problem and other seemingly unrelated problems can be solved efficiently with the diagram.