{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:57:46Z","timestamp":1743155866921,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030358013"},{"type":"electronic","value":"9783030358020"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35802-0_8","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"101-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Minimal Representations of Order Types by Geometric Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2364-0583","authenticated-orcid":false,"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9688-9489","authenticated-orcid":false,"given":"Martin","family":"Balko","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5307-7106","authenticated-orcid":false,"given":"Michael","family":"Hoffmann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4908-4703","authenticated-orcid":false,"given":"Jan","family":"Kyn\u010dl","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1948-5840","authenticated-orcid":false,"given":"Wolfgang","family":"Mulzer","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3147-0083","authenticated-orcid":false,"given":"Irene","family":"Parada","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6059-1821","authenticated-orcid":false,"given":"Alexander","family":"Pilz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1657-9796","authenticated-orcid":false,"given":"Manfred","family":"Scheucher","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3102-4166","authenticated-orcid":false,"given":"Pavel","family":"Valtr","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7166-4467","authenticated-orcid":false,"given":"Birgit","family":"Vogtenhuber","sequence":"additional","affiliation":[]},{"given":"Emo","family":"Welzl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Balko, M., Hoffmann, M., Kyn\u010dl, J., Mulzer, W., Parada, I., Pilz, A., Scheucher, M., Valtr, P., Vogtenhuber, B., Welzl, E.: Minimal representations of order types by geometric graphs (2019). http:\/\/arxiv.org\/abs\/1908.05124","DOI":"10.1007\/978-3-030-35802-0_8"},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1137\/16M1069171","volume":"46","author":"S Alamdari","year":"2017","unstructured":"Alamdari, S., Angelini, P., Barrera-Cruz, F., Chan, T.M., Da Lozzo, G., Di Battista, G., Frati, F., Haxell, P., Lubiw, A., Patrignani, M., Roselli, V., Singla, S., Wilkinson, B.T.: How to morph planar graph drawings. SIAM J. Comput. 46(2), 824\u2013852 (2017). https:\/\/doi.org\/10.1137\/16M1069171","journal-title":"SIAM J. Comput."},{"key":"8_CR3","first-page":"5","volume":"21","author":"J Blanc","year":"2011","unstructured":"Blanc, J.: The best polynomial bounds for the number of triangles in a simple arrangement of $$n$$ pseudo-lines. Geombinatorics 21, 5\u201317 (2011). https:\/\/edoc.unibas.ch\/47402","journal-title":"Geombinatorics"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF02187702","volume":"1","author":"J Bokowski","year":"1986","unstructured":"Bokowski, J., Sturmfels, B.: On the coordinatization of oriented matroids. Discret. Comput. Geom. 1, 293\u2013306 (1986). https:\/\/doi.org\/10.1007\/BF02187702","journal-title":"Discret. Comput. Geom."},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"353","DOI":"10.7155\/jgaa.00132","volume":"10","author":"S Cabello","year":"2006","unstructured":"Cabello, S.: Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. J. Graph Algorithms Appl. 10(2), 353\u2013363 (2006). https:\/\/doi.org\/10.7155\/jgaa.00132","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.7155\/jgaa.00407","volume":"21","author":"V Dujmovi\u0107","year":"2017","unstructured":"Dujmovi\u0107, V.: The utility of untangling. J. Graph Algorithms Appl. 21(1), 121\u2013134 (2017). https:\/\/doi.org\/10.7155\/jgaa.00407","journal-title":"J. Graph Algorithms Appl."},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Felsner, S., Goodman, J.E.: Pseudoline arrangements. In: T\u00f3th, C.D., O\u2019Rourke, J., Goodman, J.E. (eds.) Handbook of Discrete and Computational Geometry, pp. 125\u2013157, 3rd edn. CRC Press (2017). https:\/\/doi.org\/10.1201\/9781315119601","DOI":"10.1201\/9781315119601"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/PL00009485","volume":"23","author":"S Felsner","year":"2000","unstructured":"Felsner, S., Weil, H.: A theorem on higher Bruhat orders. Discret. Comput. Geom. 23(1), 121\u2013127 (2000). https:\/\/doi.org\/10.1007\/PL00009485","journal-title":"Discret. Comput. Geom."},{"issue":"3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/0212032","volume":"12","author":"JE Goodman","year":"1983","unstructured":"Goodman, J.E., Pollack, R.: Multidimensional sorting. SIAM J. Comput. 12(3), 484\u2013507 (1983). https:\/\/doi.org\/10.1137\/0212032","journal-title":"SIAM J. Comput."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnbaum, B.: Arrangements and spreads. AMS (1972). https:\/\/bookstore.ams.org\/cbms-10\/","DOI":"10.1090\/cbms\/010"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1111\/j.1749-6632.1985.tb14536.x","volume":"440","author":"H Harborth","year":"1985","unstructured":"Harborth, H.: Some simple arrangements of pseudolines with a maximum number of triangles. Ann. N. Y. Acad. Sci. 440(1), 31\u201333 (1985). https:\/\/doi.org\/10.1111\/j.1749-6632.1985.tb14536.x","journal-title":"Ann. N. Y. Acad. Sci."},{"key":"8_CR12","unstructured":"Levi, F.: Die Teilung der projektiven Ebene durch Gerade oder Pseudogerade. Ber. Math.-Phys. Kl. S\u00e4chs. Akad. Wiss. Leipzig 78, 256\u2013267 (1926). (in German)"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/0097-3165(89)90003-4","volume":"50","author":"D Ljubi\u0107","year":"1989","unstructured":"Ljubi\u0107, D., Roudneff, J.P., Sturmfels, B.: Arrangements of lines and pseudolines without adjacent triangles. J. Comb. Theory. Ser. A 50(1), 24\u201332 (1989). https:\/\/doi.org\/10.1016\/0097-3165(89)90003-4","journal-title":"J. Comb. Theory. Ser. A"},{"key":"8_CR14","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/BFb0082792","volume-title":"Topology and Geometry \u2014 Rohlin Seminar","author":"NE Mnev","year":"1988","unstructured":"Mnev, N.E.: The universality theorems on the classification problem of configuration varieties and convex polytopes varieties. In: Viro, O.Y., Vershik, A.M. (eds.) Topology and Geometry \u2014 Rohlin Seminar. LNM, vol. 1346, pp. 527\u2013543. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/BFb0082792"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01166556","volume":"64","author":"G Ringel","year":"1956","unstructured":"Ringel, G.: Teilungen der Ebene durch Geraden oder topologische Geraden. Math. Z. 64, 79\u2013102 (1956)","journal-title":"Math. Z."},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0012-365X(86)90016-6","volume":"60","author":"JP Roudneff","year":"1986","unstructured":"Roudneff, J.P.: On the number of triangles in simple arrangements of pseudolines in the real projective plane. Discret. Math. 60, 243\u2013251 (1986). https:\/\/doi.org\/10.1016\/0012-365X(86)90016-6","journal-title":"Discret. Math."},{"issue":"4","key":"8_CR17","doi-asserted-by":"publisher","first-page":"561","DOI":"10.2307\/2045427","volume":"92","author":"Z F\u00fcredi","year":"1984","unstructured":"F\u00fcredi, Z., Pal\u00e1sti, I.: Arrangements of lines with a large number of triangles. Proc. Am. Math. Soc. 92(4), 561\u2013566 (1984). https:\/\/doi.org\/10.2307\/2045427","journal-title":"Proc. Am. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35802-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:02:52Z","timestamp":1701133372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kam.mff.cuni.cz\/gd2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"113","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12.55","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}