Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{abrahamsen:LIPIcs:2015:5131, author = {Mikkel Abrahamsen}, title = {{An Optimal Algorithm for the Separating Common Tangents of Two Polygons}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {198208}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897835}, ISSN = {18688969}, year = {2015}, volume = {34}, editor = {Lars Arge and J{\'a}nos Pach}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5131}, URN = {urn:nbn:de:0030drops51313}, doi = {10.4230/LIPIcs.SOCG.2015.198}, annote = {Keywords: planar computational geometry, simple polygon, common tangent, optimal algorithm, constant workspace} }
Keywords:  planar computational geometry, simple polygon, common tangent, optimal algorithm, constant workspace  
Seminar:  31st International Symposium on Computational Geometry (SoCG 2015)  
Issue Date:  2015  
Date of publication:  11.06.2015 