Two-Center Problems for a Convex Polygon (Extended Abstract)

[1]  Timothy M. Chan.  Deterministic algorithms for 2-d convex programming and 3-d online linear programming , 1997, SODA '97.

[2]  Richard Cole,et al.  Cascading divide-and-conquer: A technique for designing parallel algorithms , 1989, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[3]  Laurence Boxer,et al.  A Parallel Circle-Cover Minimization Algorithm , 1989, Inf. Process. Lett..

[4]  Alok Aggarwal,et al.  Geometric applications of a matrix-searching algorithm , 1987, SCG '86.

[5]  D. T. Lee,et al.  On a Circle-Cover Minimization Problem , 1984, Inf. Process. Lett..

[6]  Micha Sharir,et al.  The Discrete 2-Center Problem , 1997, SCG '97.

[7]  David Eppstein,et al.  Faster construction of planar two-centers , 1997, SODA '97.

[8]  Jorge Urrutia,et al.  Two-Floodlight Illumination of Convex Polygons , 1995, WADS.

[9]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[10]  Leslie G. Valiant,et al.  Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[11]  Micha Sharir,et al.  A Near-Linear Algorithm for the Planar 2-Center Problem , 1996, SCG '96.

[12]  W. L. Ruzzo,et al.  Parallel algorithms for geometric intersection graphs , 1990 .

[13]  Nimrod Megiddo,et al.  Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[14]  Leonidas J. Guibas,et al.  A linear-time algorithm for computing the voronoi diagram of a convex polygon , 1989, Discret. Comput. Geom..