Algorithms for Diametral Pairs and Convex Hulls That Are Optimal, Randomized, and Incremental

Kenneth L. Clarkson, Peter W. Shor. Algorithms for Diametral Pairs and Convex Hulls That Are Optimal, Randomized, and Incremental. In Symposium on Computational Geometry. pages 12-17, 1988. [doi]

@inproceedings{ClarksonS89,
  title = {Algorithms for Diametral Pairs and Convex Hulls That Are Optimal, Randomized, and Incremental},
  author = {Kenneth L. Clarkson and Peter W. Shor},
  year = {1988},
  doi = {10.1145/73393.73395},
  url = {http://doi.acm.org/10.1145/73393.73395},
  tags = {incremental},
  researchr = {https://researchr.org/publication/ClarksonS89},
  cites = {0},
  citedby = {0},
  pages = {12-17},
  booktitle = {Symposium on Computational Geometry},
}