Alon Efrat, Micha Sharir, Alon Ziv  Home/Search
Context Related
| stanford.edu/~alon/papers/cir.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: arizona.edu/~alon/CV/cv3 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present an efficient algorithm for solving the "smallest k-enclosing circle" ( kSC ) problem: Given a set of n points in the plane and an integer k n, find the smallest disk containing k of the points. We present two solutions. When using O(nk) storage, the problem can be solved in time O(nk log 2 n). When only O(n log n) storage is allowed, the running time is O(nk log 2 n log n k ). This problem can also be tackled using the k-th order Voronoi diagram of the given set.... (Update)
Similar documents based on text: More All
0.4: On the Number of Regular Vertices of the Union of Jordan .. - Aronov, Efrat.. (Correct)
0.3: On the Complexity of the Union of Fat Objects in the Plane - Efrat, Sharir (1998) (Correct)
0.3: On the Complexity of the Union of Fat Objects in - The Plane Alon (Correct)
BibTeX entry: (Update)
A. Efrat, M. Sharir, A. Ziv, "Computing the smallest k-enclosing circle and related problems", Computational Geometry 4, 119--136, 1994. http://citeseer.ist.psu.edu/efrat94computing.html More
@inproceedings{ efrat93computing,
author = "Alon Efrat and Micha Sharir and Alon Ziv",
title = "Computing the Smallest k-Enclosing Circle and Related Problems",
booktitle = "Workshop on Algorithms and Data Structures",
pages = "325-336",
year = "1993",
url = "citeseer.ist.psu.edu/efrat94computing.html" }
Citations (may not include all citations):508 Computational Geometry (context) - Preparata, Shamos - 1985
185 Applying parallel computation algorithms in the design of se.. (context) - Megiddo - 1983
114 Optimal point location in a monotone subdivision (context) - Edelsbrunner, Guibas et al. - 1986
113 Linear-time algorithms for linear programming in R 3 and rel.. (context) - Megiddo - 1983
110 parallel steps (context) - Ajtai, Koml'os et al. - 1983
93 the union of Jordan regions and collision-free translational.. (context) - Kedem, Livne et al. - 1986
80 Slowing down sorting networks to obtain faster sorting algor.. (context) - Cole - 1987
49 A simple and fast incremental randomized algorithm for compu.. - Seidel - 1991
47 sets in arrangements of curves and surfaces (context) - Sharir, k- - 1991
46 Dynamic half-space range reporting and its applications (context) - Agarwal, Matousek - 1991
44 Static and dynamic algorithms for k-point clustering problem.. (context) - Datta, Lenhof et al. - 1993
37 algorithm for the Voronoi diagram of a set of simple curve s.. (context) - Yap, log - 1987
27 points with minimum diameter and related problems (context) - Aggarwal, Imai et al. - 1991
26 Planning a purely translational motion for a convex object i.. (context) - Leven, Sharir - 1987
20 Better lower bounds on detecting affine and spherical degene.. - Erickson, Seidel - 1993
[Article contains additional citations not shown here]
Documents on the same site (http://www.cs.arizona.edu/~alon/CV/cv3.html): More
On Incremental Rendering of Silhouette Maps of a.. - Zhang, Efrat, Guibas.. (1999) (Correct)
On the Complexity of the Union of Fat Objects in the Plane - Efrat, Sharir (1998) (Correct)
Sweeping Simple Polygons with a Chain of Guards - Efrat, Guibas, Har-Peled.. (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC