Filters








4 Hits in 5.0 sec

Guest Editors' Foreword

Boris Aronov, Matthew J. Katz
2019 Discrete & Computational Geometry  
The 33rd International Symposium on Computational Geometry (SoCG'17) took place at The University of Queensland, St Lucia, Brisbane, Australia, as part of the CG Week, on July 4-7, 2017.  ...  This special issue of Discrete & Computational Geometry contains a selection of papers from the symposium. Of the 148 submissions to SoCG'17, 59 were accepted.  ...  Discrete & Computational Geometry (2019) 61:695-697  ... 
doi:10.1007/s00454-019-00086-x fatcat:aqnf4wqqbbcnjdil4g4o3vkr34

LIPIcs-Leibniz International Proceedings in Informatics

Boris Aronov, Matthew Katz, Boris Aronov, Matthew Katz, Reinhard Wilhelm
33rd International Symposium on Computational Geometry SoCG 2017   unpublished
Queensland, Brisbane, Australia, July 4-7, 2017.  ...  Katz Program Committee co-chair Ben-Gurion University Matias Korman Multimedia Committee chair Tohoku University 33rd International Symposium on Computational Geometry (SoCG 2017).  ...  Sponsors We are grateful to The University of Queensland for hosting and sponsoring CG week 2017, and to the National Science Foundation (NSF) for providing financial support.  ... 
fatcat:7uwe6ghchnfqpfhydywdn2zoci

Art Gallery Localization [article]

Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel Smid
2018 arXiv   pre-print
We show a tower-positioning algorithm that computes such a set T of size at most 2n/3, where n is the size of P. This improves the previous upper bound of 8n/9 towers.  ...  In 33rd International Sympo- sium on Computational Geometry, SoCG 2017, July 4-7, 2017, Brisbane, Australia, pages 3:1–3:15, 2017. [2] H-C. Chang, J. Erickson, and C. Xu.  ...  In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pages 1655–1670, 2015. [3] V. Chvátal.  ... 
arXiv:1706.06938v2 fatcat:mngnbq2zwzezjiwjhup7lxs2pq

Recognizing and Embedding Simple Optimal 2-Planar Graphs [article]

Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou
2021 arXiv   pre-print
In the area of beyond-planar graphs, i.e. graphs that can be drawn with some local restrictions on the edge crossings, the recognition problem is prominent next to the density question for the different  ...  (eds.) 33rd International Symposium on Computational Geometry, SoCG 2017, July 4-7, 2017, Brisbane, Australia. LIPIcs, vol. 77, pp. 16:1–16:16.  ...  Discrete & Computational Geometry 36(4), 527–552 (2006), http://dx.doi.org/10.1007/s00454-006-1264-9 27. Pach, J., Tóth, G.: Graphs drawn with few crossings per edge.  ... 
arXiv:2108.00665v2 fatcat:vv7lfqujyzfrvp5wb7xu7p4zmq