On Geometric Algorithms that use the Furthest-Point Voronoi Diagram

[1]  Ray A. Jarvis,et al.  On the Identification of the Convex Hull of a Finite Set of Points in the Plane , 1973, Inf. Process. Lett..

[2]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[3]  Michael Ian Shamos,et al.  Geometric complexity , 1975, STOC.

[4]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[5]  David P. Dobkin,et al.  On a general method for maximizing and minimizing among certain geometric problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[6]  Wesley E. Snyder,et al.  Finding the Extrema of a Region , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Godfried T. Toussaint,et al.  PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY. , 1980 .

[8]  Franco P. Preparata,et al.  A New Approach to Planar Point Location , 1981, SIAM J. Comput..

[9]  Godfried T. Toussaint,et al.  On the multimodality of distances in convex polygons , 1982 .

[10]  Godfried T. Toussaint,et al.  A Counterexample to a Diameter Algorithm for Convex Polygons , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[12]  Godfried T. Toussaint.  The symmetric all-furthest- neighbor problem , 1983 .

[13]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..