Computing the smallest $k$-enclosing circle and related problems

Alon Efrat, Micha Sharir, and Alon Ziv
Computational Geometry Theory & Applications 4:119–136, 1994
Proc. 3rd Worksh. Algorithms and Data Structures (WADS 1993), Lecture Notes in Computer Science 709, Frank K. H. A. Dehne, Jörg-Rudiger Sack, Nicola Santoro, and Sue Whitesides, ed., Springer-Verlag, Aug 1993, pp. 325–336

Cites:

• New algorithms for minimum area $k$-gons
• New algorithms for minimum measure simplices and one-dimensional weighted Voronoi diagrams
• Dynamic algorithms for half-space reporting, proximity problems, and geometric minimum spanning trees