American Psychological Association 6th edition

Amato, N. M. (1995). Finding a closest visible vertex pair between two polygons. Algorithmica: An International Journal in Computer Science, 14(2), 183-201. https://doi.org/10.1007/bf01293668

ISO-690 (author-date, English)

AMATO, N. M., 1995. Finding a closest visible vertex pair between two polygons. Algorithmica: An International Journal in Computer Science. 1 August 1995. Vol. 14, no. 2, p. 183-201. DOI 10.1007/bf01293668.

Modern Language Association 9th edition

Amato, N. M. „Finding a Closest Visible Vertex Pair Between Two Polygons“. Algorithmica: An International Journal in Computer Science, Bd. 14, Nr. 2, August 1995, S. 183-01, https://doi.org/10.1007/bf01293668.

Mohr Siebeck - Recht (Deutsch - Österreich)

Amato, N. M.: Finding a closest visible vertex pair between two polygons, Algorithmica: An International Journal in Computer Science 1995, 183-201.

Emerald - Harvard

Amato, N.M. (1995), „Finding a closest visible vertex pair between two polygons“, Algorithmica: An International Journal in Computer Science, Vol. 14 No. 2, S. 183-201.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.