An optimal algorithm for the separating common tangents of two polygons
Research output: Contribution to journal › Conference article › Research › peer-review
Standard
An optimal algorithm for the separating common tangents of two polygons. / Abrahamsen, Mikkel.
In: Leibniz International Proceedings in Informatics, Vol. 34, 2015, p. 198-208.Research output: Contribution to journal › Conference article › Research › peer-review
Harvard
Abrahamsen, M 2015, 'An optimal algorithm for the separating common tangents of two polygons', Leibniz International Proceedings in Informatics, vol. 34, pp. 198-208. https://doi.org/10.4230/LIPIcs.SOCG.2015.198
APA
Abrahamsen, M. (2015). An optimal algorithm for the separating common tangents of two polygons. Leibniz International Proceedings in Informatics, 34, 198-208. https://doi.org/10.4230/LIPIcs.SOCG.2015.198
Vancouver
Abrahamsen M. An optimal algorithm for the separating common tangents of two polygons. Leibniz International Proceedings in Informatics. 2015;34:198-208. https://doi.org/10.4230/LIPIcs.SOCG.2015.198
Author
Bibtex
@inproceedings{e7041ffb1d0c4b6390647d68de454407,
title = "An optimal algorithm for the separating common tangents of two polygons",
author = "Mikkel Abrahamsen",
year = "2015",
doi = "10.4230/LIPIcs.SOCG.2015.198",
language = "English",
volume = "34",
pages = "198--208",
journal = "Leibniz International Proceedings in Informatics, LIPIcs",
issn = "1868-8969",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH",
note = "null ; Conference date: 22-06-2015 Through 25-06-2015",
}
RIS
TY - GEN
T1 - An optimal algorithm for the separating common tangents of two polygons
AU - Abrahamsen, Mikkel
N1 - Conference code: 31
PY - 2015
Y1 - 2015
U2 - 10.4230/LIPIcs.SOCG.2015.198
DO - 10.4230/LIPIcs.SOCG.2015.198
M3 - Conference article
VL - 34
SP - 198
EP - 208
JO - Leibniz International Proceedings in Informatics, LIPIcs
JF - Leibniz International Proceedings in Informatics, LIPIcs
SN - 1868-8969
Y2 - 22 June 2015 through 25 June 2015
ER -
ID: 145147692