{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:15:51Z","timestamp":1743038151533,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030140847"},{"type":"electronic","value":"9783030140854"}],"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-14085-4_19","type":"book-chapter","created":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T16:39:58Z","timestamp":1550853598000},"page":"234-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees"],"prefix":"10.1007","author":[{"given":"Marcos","family":"Oropeza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,23]]},"reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/s00454-012-9403-y","volume":"48","author":"BM \u00c1brego","year":"2012","unstructured":"\u00c1brego, B.M., Cetina, M., Fern\u00e1ndez-Merchant, S., Lea\u00f1os, J., Salazar, G.: On $$\\le k$$-edges, crossings, and halving lines of geometric drawings of $$K_n$$. Discrete Comput. Geom. 48(1), 192\u2013215 (2012)","journal-title":"Discrete Comput. Geom."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.jcta.2017.04.003","volume":"151","author":"BM \u00c1brego","year":"2017","unstructured":"\u00c1brego, B.M., Fern\u00e1ndez-Merchant, S.: The rectilinear local crossing number of $$K_n$$. J. Combin. Theory Ser. A 151, 131\u2013145 (2017)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00373-007-0704-5","volume":"23","author":"O Aichholzer","year":"2007","unstructured":"Aichholzer, O., Hackl, T., Huemer, C., Hurtado, F., Krasser, H., Vogtenhuber, B.: On the number of plane geometric graphs. Graphs Combin. 23(1), 67\u201384 (2007)","journal-title":"Graphs Combin."},{"issue":"1\u20132","key":"19_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1142\/S0218195917600044","volume":"27","author":"O Aichholzer","year":"2017","unstructured":"Aichholzer, O., Kusters, V., Mulzer, W., Pilz, A., Wettstein, M.: An optimal algorithm for reconstructing point set order types from radial orderings. Int. J. Comput. Geom. Appl. 27(1\u20132), 57\u201384 (2017)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"3","key":"19_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.comgeo.2004.12.010","volume":"37","author":"O Aichholzer","year":"2007","unstructured":"Aichholzer, O., Reinhardt, K.: A quadratic distance bound on sliding between crossing-free spanning trees. Comput. Geom. 37(3), 155\u2013161 (2007)","journal-title":"Comput. Geom."},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Aloupis, G., Iacono, J., Langerman, S., Ozkan, \u00d6., Wuhrer, S.: The complexity of order type isomorphism. In: Proceedings of 25th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 405\u2013415. SIAM (2014)","DOI":"10.1137\/1.9781611973402.30"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65(1), 21\u201346 (1996)","journal-title":"Discrete Appl. Math."},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-319-42634-1_37","volume-title":"Computing and Combinatorics","author":"S Bald","year":"2016","unstructured":"Bald, S., Johnson, M.P., Liu, O.: Approximating the maximum rectilinear crossing number. In: Dinh, T.N., Thai, M.T. (eds.) COCOON 2016. LNCS, vol. 9797, pp. 455\u2013467. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42634-1_37"},{"key":"19_CR9","first-page":"376","volume":"23","author":"A Cayley","year":"1889","unstructured":"Cayley, A.: A theorem on trees. Q. J. Math. 23, 376\u2013378 (1889)","journal-title":"Q. J. Math."},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0012-365X(98)00372-0","volume":"204","author":"P Flajolet","year":"1999","unstructured":"Flajolet, P., Noy, M.: Analytic combinatorics of non-crossing configurations. Discrete Math. 204(1), 203\u2013229 (1999)","journal-title":"Discrete Math."},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-319-50106-2_32","volume-title":"Graph Drawing and Network Visualization","author":"J Fox","year":"2016","unstructured":"Fox, J., Pach, J., Suk, A.: Approximating the rectilinear crossing number. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 413\u2013426. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_32"},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0166-218X(91)90068-8","volume":"31","author":"JE Goodman","year":"1991","unstructured":"Goodman, J.E., Pollack, R.: The complexity of point configurations. Discrete Appl. Math. 31(2), 167\u2013180 (1991)","journal-title":"Discrete Appl. Math."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-1-4614-0110-0_16","volume-title":"Thirty Essays on Geometric Graph Theory","author":"M Hoffmann","year":"2013","unstructured":"Hoffmann, M., Schulz, A., Sharir, M., Sheffer, A., T\u00f3th, C.D., Welzl, E.: Counting plane graphs: flippability and its applications. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 303\u2013325. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_16"},{"issue":"3","key":"19_CR14","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/s00454-015-9750-6","volume":"55","author":"C Keller","year":"2016","unstructured":"Keller, C., Perles, M.A.: Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph. Discrete Comput. Geom. 55(3), 610\u2013637 (2016)","journal-title":"Discrete Comput. Geom."},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55611-7","volume-title":"Axioms and Hulls","year":"1992","unstructured":"Knuth, D.E. (ed.): Axioms and Hulls. LNCS, vol. 606. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55611-7"},{"issue":"7","key":"19_CR16","doi-asserted-by":"publisher","first-page":"1676","DOI":"10.1016\/j.ejc.2009.03.005","volume":"30","author":"J Kyn\u010dl","year":"2009","unstructured":"Kyn\u010dl, J.: Enumeration of simple complete topological graphs. Eur. J. Combin. 30(7), 1676\u20131685 (2009)","journal-title":"Eur. J. Combin."},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1007\/978-3-319-77404-6_60","volume-title":"LATIN 2018: Theoretical Informatics","author":"TL Nichols","year":"2018","unstructured":"Nichols, T.L., Pilz, A., T\u00f3th, C.D., Zehmakan, A.N.: Transition operations over plane trees. In: Bender, M.A., Farach-Colton, M., Mosteiro, M.A. (eds.) LATIN 2018. LNCS, vol. 10807, pp. 835\u2013848. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77404-6_60"},{"issue":"4","key":"19_CR18","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1007\/s00454-017-9912-9","volume":"59","author":"A Pilz","year":"2018","unstructured":"Pilz, A., Welzl, E.: Order on order types. Discrete Comput. Geom. 59(4), 886\u2013922 (2018)","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14085-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,19]],"date-time":"2023-03-19T01:08:52Z","timestamp":1679188132000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14085-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030140847","9783030140854"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14085-4_19","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":"23 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DGCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discrete Geometry for Computer Imagery","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marne-la-Vall\u00e9e","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"26 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dgci2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dgci2019.sciencesconf.org\/","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":"50","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":"38","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":"0","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":"76% - 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","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":"1-2","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"}]}}