@techreport{TR-DCC-92-04,
  number = {DCC-92-04},
  author = {Jacometti, Welson R.},
  title = {A Note on Primitives for the Manipulation of General Subdivisions and the Computation of {V}oronoi Diagrams},
  month = {June},
  year = {1992}, 
  institution = {Department of Computer Science, University of Campinas},
  note = {In English, 8 pages.
    \par\selectlanguage{english}\textbf{Abstract}
      We note that a few modifications to the Guibas and Stolfi's
      algorithm for Nearest-Neighbor Delaunay Triangulation produce an
      algorithm for the Farthest-Neighbor Delaunay Triangulation (a
      triangulation of the convex hull of the set of points) that,
      like the original, runs in optimal $O(n \log n)$ time and linear
      space.
  }
}