Computing the largest empty convex subset of a set of points

David Avis, David Rappaport. Computing the largest empty convex subset of a set of points. In Joseph O Rourke, editor, Proceedings of the First Annual Symposium on Computational Geometry, 1985, Baltimore, Maryland, USA, June 5-7, 1985. pages 161-167, ACM, 1985. [doi]

@inproceedings{AvisR85,
  title = {Computing the largest empty convex subset of a set of points},
  author = {David Avis and David Rappaport},
  year = {1985},
  doi = {10.1145/323233.323255},
  url = {http://doi.acm.org/10.1145/323233.323255},
  researchr = {https://researchr.org/publication/AvisR85},
  cites = {0},
  citedby = {0},
  pages = {161-167},
  booktitle = {Proceedings of the First Annual Symposium on Computational Geometry, 1985, Baltimore, Maryland, USA, June 5-7, 1985},
  editor = {Joseph O Rourke},
  publisher = {ACM},
  isbn = {0-89791-163-6},
}