Disk Constrained 1-Center Queries
Luis Barba · Canadian Conference on Computational Geometry · 2012
We show that a setP ofn points in the plane can be preprocessed in O(n logn)-time to construct a data structure supporting O(logn)-time queries of the following form: Find the minimum enclosing circle of P with center on a given disk.