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.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
representative citing papers
TabKDE generates synthetic tabular data using copula transformations followed by kernel density estimation, matching prior accuracy with negligible training time and reduced storage via coresets.
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.
-
TabKDE: Simple and Scalable Tabular Data Generation with Kernel Density Estimates
TabKDE generates synthetic tabular data using copula transformations followed by kernel density estimation, matching prior accuracy with negligible training time and reduced storage via coresets.
- Computing k-means in mixed precision