An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points

Robert L. Scot Drysdale, Asish Mukhopadhyay. An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points. Inf. Process. Lett., 105(2):47-51, 2008. [doi]

@article{DrysdaleM08,
  title = {An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points},
  author = {Robert L. Scot Drysdale and Asish Mukhopadhyay},
  year = {2008},
  doi = {10.1016/j.ipl.2007.08.004},
  url = {http://dx.doi.org/10.1016/j.ipl.2007.08.004},
  researchr = {https://researchr.org/publication/DrysdaleM08},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {105},
  number = {2},
  pages = {47-51},
}