Peter Eades, David Rappaport. The complexity of computing minimum separating polygons. Pattern Recognition Letters, 14(9):715-718, 1993. [doi]
@article{EadesR93,
title = {The complexity of computing minimum separating polygons},
author = {Peter Eades and David Rappaport},
year = {1993},
doi = {10.1016/0167-8655(93)90140-9},
url = {http://dx.doi.org/10.1016/0167-8655(93)90140-9},
researchr = {https://researchr.org/publication/EadesR93},
cites = {0},
citedby = {0},
journal = {Pattern Recognition Letters},
volume = {14},
number = {9},
pages = {715-718},
}