A 2D Voronoi-diagram data structure answers smallest-enclosing-disk rectangle queries in O(log^4 n) deterministic time after O(n log^2 n) preprocessing.
New Results and New Trends in Computer Science (1991)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Presents a distributed multicoverage algorithm for robot swarms operating with local sensing, local communication, and no global coordination.
citing papers explorer
-
Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
A 2D Voronoi-diagram data structure answers smallest-enclosing-disk rectangle queries in O(log^4 n) deterministic time after O(n log^2 n) preprocessing.
-
Distributed Multi-Coverage for Robot Swarms
Presents a distributed multicoverage algorithm for robot swarms operating with local sensing, local communication, and no global coordination.