{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:24:34Z","timestamp":1766377474708,"version":"3.48.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030929305"},{"type":"electronic","value":"9783030929312"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92931-2_26","type":"book-chapter","created":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T11:14:17Z","timestamp":1640171657000},"page":"358-371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Embedding Ray Intersection Graphs and\u00a0Global Curve Simplification"],"prefix":"10.1007","author":[{"given":"Mees","family":"van de Kerkhof","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0544-2257","authenticated-orcid":false,"given":"Irina","family":"Kostitsyna","sequence":"additional","affiliation":[]},{"given":"Maarten","family":"L\u00f6ffler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,23]]},"reference":[{"issue":"3","key":"26_CR1","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s00454-008-9132-4","volume":"43","author":"MA Abam","year":"2010","unstructured":"Abam, M.A., de Berg, M., Hachenberger, P., Zarei, A.: Streaming algorithms for line simplification. Discret. Comput. Geom. 43(3), 497\u2013515 (2010)","journal-title":"Discret. Comput. Geom."},{"issue":"3\u20134","key":"26_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00453-005-1165-y","volume":"42","author":"PK Agarwal","year":"2005","unstructured":"Agarwal, P.K., Har-Peled, S., Mustafa, N., Wang, Y.: Near linear time approximation algorithm for curve simplification. Algorithmica 42(3\u20134), 203\u2013219 (2005)","journal-title":"Algorithmica"},{"issue":"2","key":"26_CR3","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/s00453-001-0096-5","volume":"33","author":"G Barequet","year":"2002","unstructured":"Barequet, G., Chen, D.Z., Daescu, O., Goodrich, M.T., Snoeyink, J.: Efficiently approximating polygonal paths in three and higher dimensions. Algorithmica 33(2), 150\u2013167 (2002)","journal-title":"Algorithmica"},{"issue":"4","key":"26_CR4","first-page":"243","volume":"25","author":"M de Berg","year":"1998","unstructured":"de Berg, M., van Kreveld, M., Schirra, S.: Topologically correct subdivision simplification using the bandwidth criterion. Cartogr. Geogr. Inf. Syst. 25(4), 243\u2013257 (1998)","journal-title":"Cartogr. Geogr. Inf. Syst."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Buzer, L.: Optimal simplification of polygonal chain for rendering. In: Proceedings of 23rd Annual ACM Symposium on Computational Geometry (SoCG), pp. 168\u2013174 (2007)","DOI":"10.1145\/1247069.1247102"},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.37236\/6040","volume":"24","author":"S Cabello","year":"2017","unstructured":"Cabello, S., Jej\u010di\u010d, M.: Refining the hierarchies of classes of geometric intersection graphs. Electron. J. Combin. 24(1), 1\u201333 (2017)","journal-title":"Electron. J. Combin."},{"issue":"2","key":"26_CR7","doi-asserted-by":"publisher","first-page":"273","DOI":"10.7155\/jgaa.00470","volume":"22","author":"J Cardinal","year":"2018","unstructured":"Cardinal, J., Felsner, S., Miltzow, T., Tompkins, C., Vogtenhuber, B.: Intersection graphs of rays and grounded segments. J. Graph Algorithms Appl. 22(2), 273\u2013295 (2018)","journal-title":"J. Graph Algorithms Appl."},{"key":"26_CR8","unstructured":"Chalopin, J., Gon\u00e7alves, D., Ochem, P.: Planar graphs are in 1-string. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 609\u2013617 (2007)"},{"issue":"1","key":"26_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1142\/S0218195996000058","volume":"6","author":"S Chan","year":"1996","unstructured":"Chan, S., Chin, F.: Approximation of polygonal curves with minimum number of line segments or minimum error. Int. J. Comput. Geom. Appl. 6(1), 59\u201377 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"3","key":"26_CR10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.comgeo.2004.09.003","volume":"32","author":"DZ Chen","year":"2005","unstructured":"Chen, D.Z., Daescu, O., Hershberger, J., Kogge, P.M., Mi, N., Snoeyink, J.: Polygonal path simplification with angle constraints. Comput. Geom. 32(3), 173\u2013187 (2005)","journal-title":"Comput. Geom."},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(89)90059-8","volume":"32","author":"P Damaschke","year":"1989","unstructured":"Damaschke, P.: The Hamiltonian circuit problem for circle graphs is NP-complete. Inf. Process. Lett. 32(1), 1\u20132 (1989)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"26_CR12","doi-asserted-by":"publisher","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","volume":"10","author":"DH Douglas","year":"1973","unstructured":"Douglas, D.H., Peucker, T.K.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Cartographica 10(2), 112\u2013122 (1973)","journal-title":"Cartographica"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0095-8956(76)90022-8","volume":"21","author":"G Ehrlich","year":"1976","unstructured":"Ehrlich, G., Even, S., Tarjan, R.E.: Intersection graphs of curves in the plane. J. Comb. Theory. Ser. B 21, 8\u201320 (1976)","journal-title":"J. Comb. Theory. Ser. B"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Godau, M.: A natural metric for curves - computing the distance for polygonal chains and approximation algorithms. In: Proceedings of the 8th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 127\u2013136 (1991)","DOI":"10.1007\/BFb0020793"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0012-365X(91)90069-E","volume":"87","author":"IA Hartman","year":"1991","unstructured":"Hartman, I.A., Newman, I., Ziv, R.: On grid intersection graphs. Discret. Math. 87, 41\u201352 (1991)","journal-title":"Discret. Math."},{"issue":"3","key":"26_CR17","first-page":"159","volume":"9","author":"H Imai","year":"1986","unstructured":"Imai, H., Iri, M.: An optimal algorithm for approximating a piecewise linear function. J. Inf. Process. 9(3), 159\u2013162 (1986)","journal-title":"J. Inf. Process."},{"key":"26_CR18","unstructured":"Imai, H., Iri, M.: Polygonal approximations of a curve - formulations and algorithms. In: Computational Morphology: A Computational Geometric Approach to the Analysis of Form (1988)"},{"issue":"3","key":"26_CR19","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02662875","volume":"10","author":"Y Jinjiang","year":"1995","unstructured":"Jinjiang, Y., Sanming, Z.: Optimal labelling of unit interval graphs. Appl. Math. 10(3), 337\u2013344 (1995)","journal-title":"Appl. Math."},{"key":"26_CR20","unstructured":"van de Kerkhof, M., Kostitsyna, I., L\u00f6ffler, M., Mirzanezhad, M., Wenk, C.: Global curve simplification. In: Proceedings of the 27th European Symposium on Algorithms (ESA) (2019)"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"van de Kerkhof, M., Kostitsyna, I., L\u00f6ffler, M.: Embedding ray intersection graphs and global curve simplification (2021). https:\/\/arxiv.org\/abs\/2109.00042","DOI":"10.1007\/978-3-030-92931-2_26"},{"issue":"2","key":"26_CR22","first-page":"80","volume":"8","author":"I Kostitsyna","year":"2017","unstructured":"Kostitsyna, I., L\u00f6ffler, M., Polishchuk, V., Staals, F.: On the complexity of minimum-link path problems. J. Comput. Geom. 8(2), 80\u2013108 (2017)","journal-title":"J. Comput. Geom."},{"issue":"2","key":"26_CR23","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/jctb.1994.1071","volume":"62","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: Intersection graphs of segments. J. Comb. Theory, Ser. B 62(2), 289\u2013315 (1994)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"26_CR24","unstructured":"van\u00a0Kreveld, M., L\u00f6ffler, M., Wiratma, L.: On optimal polyline simplification using the Hausdorff and Fr\u00e9chet distance. In: Proceedings of the 34th International Symposium on Computational Geometry (SoCG), vol.\u00a056, pp. 1\u201314 (2018)"},{"issue":"1","key":"26_CR25","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.jctb.2012.09.004","volume":"103","author":"C McDiarmid","year":"2013","unstructured":"McDiarmid, C., M\u00fcller, T.: Integer realizations of disk and segment graphs. J. Comb. Theory, Ser. B 103(1), 114\u2013143 (2013)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"26_CR26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719802","volume-title":"Topics in Intersection Graph Theory","author":"TA McKee","year":"1999","unstructured":"McKee, T.A., McMorris, F.: Topics in Intersection Graph Theory. Society for Industrial and Applied Mathematics, USA (1999)"},{"key":"26_CR27","unstructured":"Mustata, I.: On subclasses of grid intersection graphs. Doctoral thesis, Technische Universit\u00e4t Berlin, Berlin (2014)"}],"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-92931-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T01:01:52Z","timestamp":1766365312000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92931-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030929305","9783030929312"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92931-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 December 2021","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":"T\u00fcbingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo.inf.uni-tuebingen.de\/gd2021\/","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":"74","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":"23","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":"5","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":"31% - 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.02","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":"8.6","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"}]}}