Computing the smallest k-enclosing circle and related problems
- 31 July 1994
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 4 (3) , 119-136
- https://doi.org/10.1016/0925-7721(94)90003-5
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Dynamic half-space reporting, geometric optimization, and minimum spanning treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Enumerating the k closest pairs optimallyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Finding k points with minimum diameter and related problemsJournal of Algorithms, 1991
- Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagramsDiscrete & Computational Geometry, 1987
- Slowing down sorting networks to obtain faster sorting algorithmsJournal of the ACM, 1987
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- New upper bounds for neighbor searchingInformation and Control, 1986
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstaclesDiscrete & Computational Geometry, 1986
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- Sorting inc logn parallel stepsCombinatorica, 1983