The complexity of computing minimum separating polygons

Peter Eades, David Rappaport. The complexity of computing minimum separating polygons. Pattern Recognition Letters, 14(9):715-718, 1993. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.