B.M.Chazelle and D.T.Lee,"On a Circle Placement Problem," Computing  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Iterated Nearest Neighbors and Finding Minimal Polytopes - Eppstein, Erickson (1994) (34 citations) (Correct)
.... where the optimal sphere cannot be forced to be tangenttod points, are handled in total time O(n ) Thus, the entire sweep algorithm takes time O(n log n) In the plane, wecansolve this problem in time and space O(n ) using a more complicated algorithm developed by Chazelle and Lee [8]. To find minimum circumradius sets, we apply parametric searching with Cole s weighted median strategy [10] Our sweep algorithm can be parallelized to run in O(log n) steps on O(n ) processors. Thus, the total time is O(n n) in general, and O(n log n) in the plane. The parametric ....
B. M. Chazelle and D. T. Lee. On a circle placement problem. Computing, 36:1--16, 1986.
Davenport-Schinzel Sequences and Their Geometric Applications - Agarwal, Sharir (1995) (136 citations) (Correct)
....bound of 8n Gamma 1 on the complexity of the zone. Applying a more careful analysis, Bern et al. 28] showed: Theorem 6.8 ( 28] The complexity of the zone of a line in an arrangement of n lines is at most 5:5n, and this bound is tight within an additive constant term, in the worst case. See [11, 28, 34, 51] for other results and applications of zones of arcs. An immediate consequence of Theorem 6.7 is an efficient algorithm for computing the arrangement A( Gamma) Suppose we add the arcs of Gamma one by one and maintain the arrangement of the arcs added so far. Let Gamma i be the set of arcs ....
B. Chazelle and D. T. Lee, On a circle placement problem, Computing, 36 (1986), 1--16.
Translating a Convex Polygon to Contain a Maximum Number of.. - Barequet, al. (1995) (2 citations) (Correct)
....Romania This problem has many of the same applications as the problems mentioned in the previous paragraphs, and has been used as a substep in some of their solutions [5, 6] Problem 1 also relates to the fixed radius search problems and to problems of optimal object placement. Chazelle and Lee [2] first solved the problem of placing a fixed radius circle to contain the largest subset of a given set S. Their algorithm requires O(n 2 ) time. Eppstein and Erickson [5] as a substep of their algorithm to find the minimum L1 diameter k subset of a given set S, note that an algorithm of ....
B. Chazelle and D.T. Lee "On a Circle Placement Problem," Computing 36 (1986) 1--16.
Iterated Nearest Neighbors and Finding Minimal Polytopes - Eppstein, Erickson (1994) (34 citations) (Correct)
.... optimal sphere cannot be forced to be tangent to d points, are handled in total time O(n d Gamma1 ) Thus, the entire sweep algorithm takes time O(n d log n) In the plane, we can solve this problem in time and space O(n 2 ) using a more complicated algorithm developed by Chazelle and Lee [8]. To find minimum circumradius sets, we apply parametric searching with Cole s weighted median strategy [10] Our sweep algorithm can be parallelized to run in O(log n) steps on O(n d ) processors. Thus, the total time is O(n d log 2 n) in general, and O(n 2 log n) in the plane. The ....
B. M. Chazelle and D. T. Lee. On a circle placement problem. Computing, 36:1--16, 1986.
Unknown - World Congresses Of (Correct)
No context found.
B.M.Chazelle and D.T.Lee,"On a Circle Placement Problem," Computing
Computing A Double-Ray Center For A Planar Point Set - Glozman, Kedem, Shpitalnik (1998) (Correct)
No context found.
B. Chazelle and D.T. Lee, "On a circle placement problem", Computing, 1(1986) 1--16.
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