{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:45:52Z","timestamp":1742913952451,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030895426"},{"type":"electronic","value":"9783030895433"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89543-3_20","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:03:25Z","timestamp":1634781805000},"page":"231-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Consistent Simplification of Polyline Tree Bundles"],"prefix":"10.1007","author":[{"given":"Yannick","family":"Bosch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Sch\u00e4fer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2601-6452","authenticated-orcid":false,"given":"Joachim","family":"Spoerhase","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabine","family":"Storandt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7398-718X","authenticated-orcid":false,"given":"Johannes","family":"Zink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,20]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1007\/978-3-540-78773-0_54","volume-title":"LATIN 2008: Theoretical Informatics","author":"S Bereg","year":"2008","unstructured":"Bereg, S., Jiang, M., Wang, W., Yang, B., Zhu, B.: Simplifying 3D polygonal chains under the discrete Fr\u00e9chet distance. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 630\u2013641. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78773-0_54"},{"key":"20_CR2","unstructured":"Bosch, Y., Sch\u00e4fer, P., Spoerhase, J., Storandt, S., Zink, J.: Consistent simplification of polyline tree bundles. CoRR abs\/2008.10583 (2021). arXiv:2108.10790"},{"key":"20_CR3","doi-asserted-by":"publisher","unstructured":"Buchin, M., Kilgus, B., K\u00f6lzsch, A.: Group diagrams for representing trajectories. In: Proceedings of the 11th ACM SIGSPATIAL International Workshop on Computational Transportation Science, pp. 1\u201310 (2018). https:\/\/doi.org\/10.1145\/3283207.3283208","DOI":"10.1145\/3283207.3283208"},{"key":"20_CR4","doi-asserted-by":"publisher","unstructured":"Chan, W.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). https:\/\/doi.org\/10.1142\/s0218195996000058","DOI":"10.1142\/s0218195996000058"},{"issue":"2","key":"20_CR5","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). https:\/\/doi.org\/10.3138\/fm57-6770-u75u-7727","journal-title":"Cartographica"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-319-21840-3_29","volume-title":"Algorithms and Data Structures","author":"C Fan","year":"2015","unstructured":"Fan, C., Filtser, O., Katz, M.J., Wylie, T., Zhu, B.: On the chain pair simplification problem. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 351\u2013362. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21840-3_29"},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"Fan, C., Filtser, O., Katz, M.J., Zhu, B.: On the general chain pair simplification problem. In: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2016.37","DOI":"10.4230\/LIPIcs.MFCS.2016.37"},{"issue":"4","key":"20_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(93)90022-2","volume":"46","author":"MM Halld\u00f3rsson","year":"1993","unstructured":"Halld\u00f3rsson, M.M.: Approximating the minimum maximal independence number. Inf. Process. Lett. 46(4), 169\u2013172 (1993). https:\/\/doi.org\/10.1016\/0020-0190(93)90022-2","journal-title":"Inf. Process. Lett."},{"key":"20_CR9","doi-asserted-by":"publisher","unstructured":"He, S., et al.: RoadRunner: improving the precision of road network inference from GPS trajectories. In: Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 3\u201312 (2018). https:\/\/doi.org\/10.1145\/3274895.3274974","DOI":"10.1145\/3274895.3274974"},{"key":"20_CR10","unstructured":"Hershberger, J., Snoeyink, J.: Speeding up the Douglas-Peucker line-simplification algorithm. In: Proceedings of the 5th International Symposium on Spatial Data Handling (SDH 1992), pp. 134\u2013143 (1992)"},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Imai, H., Iri, M.: Polygonal approximations of a curve-formulations and algorithms. In: Machine Intelligence and Pattern Recognition, vol. 6, pp. 71\u201386. Elsevier (1988). https:\/\/doi.org\/10.1016\/b978-0-444-70467-2.50011-4","DOI":"10.1016\/b978-0-444-70467-2.50011-4"},{"key":"20_CR12","unstructured":"MobilityData IO: OpenMobilityData. https:\/\/transitfeeds.com\/"},{"key":"20_CR13","unstructured":"OpenStreetMap contributors: Planet dump retrieved from https:\/\/planet.osm.org (2017)"},{"key":"20_CR14","doi-asserted-by":"publisher","unstructured":"Spoerhase, J., Storandt, S., Zink, J.: Simplification of polyline bundles. In: Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020) (2020). https:\/\/doi.org\/10.4230\/LIPIcs.SWAT.2020.35","DOI":"10.4230\/LIPIcs.SWAT.2020.35"},{"issue":"1","key":"20_CR15","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1179\/000870493786962263","volume":"30","author":"M Visvalingam","year":"1993","unstructured":"Visvalingam, M., Whyatt, J.D.: Line generalisation by repeated elimination of points. Cartogr. J. 30(1), 46\u201351 (1993). https:\/\/doi.org\/10.1179\/000870493786962263","journal-title":"Cartogr. J."},{"issue":"6","key":"20_CR16","doi-asserted-by":"publisher","first-page":"1372","DOI":"10.1109\/tcbb.2013.17","volume":"10","author":"T Wylie","year":"2013","unstructured":"Wylie, T., Zhu, B.: Protein chain pair simplification under the discrete Fr\u00e9chet distance. IEEE\/ACM Trans. Comput. Biol. Bioinfom. 10(6), 1372\u20131383 (2013). https:\/\/doi.org\/10.1109\/tcbb.2013.17","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinfom."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89543-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:10:28Z","timestamp":1634782228000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89543-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030895426","9783030895433"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89543-3_20","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":"20 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"24 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2021","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":"cocoon2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2021\/","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":"131","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":"56","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":"43% - 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.1","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":"2.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)"}}]}}