Go to the corresponding LIPIcs Volume Portal 
De Carufel, JeanLou ; Dumitrescu, Adrian ; Meulemans, Wouter ; Ophelders, Tim ; Pennarun, Claire ; Tóth, Csaba D. ; Verdonschot, Sander
pdfformat: 

@InProceedings{decarufel_et_al:LIPIcs:2019:10426, author = {JeanLou De Carufel and Adrian Dumitrescu and Wouter Meulemans and Tim Ophelders and Claire Pennarun and Csaba D. T{\'o}th and Sander Verdonschot}, title = {{Convex Polygons in Cartesian Products}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {22:122:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771047}, ISSN = {18688969}, year = {2019}, volume = {129}, editor = {Gill Barequet and Yusu Wang}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10426}, URN = {urn:nbn:de:0030drops104267}, doi = {10.4230/LIPIcs.SoCG.2019.22}, annote = {Keywords: Erd{\"o}sSzekeres theorem, Cartesian product, convexity, polyhedron, recursive construction, approximation algorithm} }
Keywords:  ErdösSzekeres theorem, Cartesian product, convexity, polyhedron, recursive construction, approximation algorithm  
Collection:  35th International Symposium on Computational Geometry (SoCG 2019)  
Issue Date:  2019  
Date of publication:  11.06.2019 