{"status":"public","_id":"7994","file":[{"date_updated":"2020-07-14T12:48:06Z","date_created":"2020-06-23T11:06:23Z","file_id":"8006","file_size":592661,"relation":"main_file","access_level":"open_access","checksum":"93571b76cf97d5b7c8aabaeaa694dd7e","file_name":"2020_LIPIcsSoCG_Arroyo.pdf","creator":"dernst","content_type":"application/pdf"}],"volume":164,"publication_status":"published","quality_controlled":"1","department":[{"_id":"UlWa"}],"alternative_title":["LIPIcs"],"type":"conference","ddc":["510"],"article_processing_charge":"No","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"title":"Extending drawings of graphs to arrangements of pseudolines","date_published":"2020-06-01T00:00:00Z","date_created":"2020-06-22T09:14:21Z","file_date_updated":"2020-07-14T12:48:06Z","scopus_import":"1","article_number":"9:1 - 9:14","author":[{"full_name":"Arroyo Guevara, Alan M","orcid":"0000-0003-2401-8670","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","last_name":"Arroyo Guevara","first_name":"Alan M"},{"first_name":"Julien","last_name":"Bensmail","full_name":"Bensmail, Julien"},{"full_name":"Bruce Richter, R.","first_name":"R.","last_name":"Bruce Richter"}],"month":"06","citation":{"ama":"Arroyo Guevara AM, Bensmail J, Bruce Richter R. Extending drawings of graphs to arrangements of pseudolines. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.9","chicago":"Arroyo Guevara, Alan M, Julien Bensmail, and R. Bruce Richter. “Extending Drawings of Graphs to Arrangements of Pseudolines.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.9.","mla":"Arroyo Guevara, Alan M., et al. “Extending Drawings of Graphs to Arrangements of Pseudolines.” 36th International Symposium on Computational Geometry, vol. 164, 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.9.","apa":"Arroyo Guevara, A. M., Bensmail, J., & Bruce Richter, R. (2020). Extending drawings of graphs to arrangements of pseudolines. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.9","ieee":"A. M. Arroyo Guevara, J. Bensmail, and R. Bruce Richter, “Extending drawings of graphs to arrangements of pseudolines,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.","ista":"Arroyo Guevara AM, Bensmail J, Bruce Richter R. 2020. Extending drawings of graphs to arrangements of pseudolines. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 9:1-9:14.","short":"A.M. Arroyo Guevara, J. Bensmail, R. Bruce Richter, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020."},"date_updated":"2023-02-23T13:22:12Z","day":"01","year":"2020","language":[{"iso":"eng"}],"intvolume":" 164","publication_identifier":{"issn":["18688969"],"isbn":["9783959771436"]},"conference":{"name":"SoCG: Symposium on Computational Geometry","location":"Zürich, Switzerland","start_date":"2020-06-22","end_date":"2020-06-26"},"ec_funded":1,"doi":"10.4230/LIPIcs.SoCG.2020.9","publication":"36th International Symposium on Computational Geometry","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"oa_version":"Published Version","license":"https://creativecommons.org/licenses/by/4.0/","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","abstract":[{"lang":"eng","text":"In the recent study of crossing numbers, drawings of graphs that can be extended to an arrangement of pseudolines (pseudolinear drawings) have played an important role as they are a natural combinatorial extension of rectilinear (or straight-line) drawings. A characterization of the pseudolinear drawings of K_n was found recently. We extend this characterization to all graphs, by describing the set of minimal forbidden subdrawings for pseudolinear drawings. Our characterization also leads to a polynomial-time algorithm to recognize pseudolinear drawings and construct the pseudolines when it is possible."}],"external_id":{"arxiv":["1804.09317"]},"oa":1,"has_accepted_license":"1"}