{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:27:21Z","timestamp":1742984841894,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030227432"},{"type":"electronic","value":"9783030227449"}],"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-22744-9_44","type":"book-chapter","created":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T17:29:16Z","timestamp":1559928556000},"page":"562-576","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Time-Dependent Link Travel Time Approximation for Large-Scale Dynamic Traffic Simulations"],"prefix":"10.1007","author":[{"suffix":"Jr.","given":"Genaro","family":"Peque","sequence":"first","affiliation":[]},{"given":"Hiro","family":"Harada","sequence":"additional","affiliation":[]},{"given":"Takamasa","family":"Iryo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"key":"44_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-05465-5_8","volume-title":"Robust and Online Large-Scale Optimization","author":"D Delling","year":"2009","unstructured":"Delling, D., Wagner, D.: Time-dependent route planning. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 207\u2013230. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05465-5_8"},{"key":"44_CR2","unstructured":"Delling, D., Schultes, D., Wagner, D.: Highway hierarchies star. In: 9th DIMACS Implementation Challenge (2006)"},{"issue":"11","key":"44_CR3","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1016\/j.imavis.2012.06.010","volume":"30","author":"D Prasad","year":"2012","unstructured":"Prasad, D., Leung, M., Quek, C., Cho, S.: A novel framework for making dominant point detection methods non-parametric. Image Vis. Comput. 30(11), 843\u2013859 (2012)","journal-title":"Image Vis. Comput."},{"issue":"2","key":"44_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10514-007-9034-y","volume":"23","author":"V Nguyen","year":"2007","unstructured":"Nguyen, V., Gachter, S., Martinelli, A., Tomatis, N., Siegwart, R.: A comparison of line extraction algorithms using 2D range data for indoor mobile robotics. Auton. Robot. 23(2), 97 (2007)","journal-title":"Auton. Robot."},{"key":"44_CR5","unstructured":"Visvalingam, M. Whyatt, J.: Line generalisation by repeated elimination of the smallest area. Technical report, Discussion Paper, Cartographic Information Systems Research Group (CISRG), The University of Hull 10 (1992)"},{"key":"44_CR6","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/S0146-664X(72)80017-0","volume":"1","author":"U Ramer","year":"1972","unstructured":"Ramer, U.: An iterative procedure for the polygonal approximation of plane curves. Comput. Graph. Image Process. 1, 244\u2013256 (1972)","journal-title":"Comput. Graph. Image Process."},{"issue":"2","key":"44_CR7","doi-asserted-by":"publisher","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","volume":"10","author":"D Douglas","year":"1973","unstructured":"Douglas, D., Peucker, T.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Can. Cartogr. 10(2), 112\u2013122 (1973)","journal-title":"Can. Cartogr."},{"key":"44_CR8","volume-title":"Pattern Classification and Scene Analysis","author":"R Duda","year":"1973","unstructured":"Duda, R., Hart, P.: Pattern Classification and Scene Analysis. Wiley, New York (1973)"},{"issue":"12","key":"44_CR9","doi-asserted-by":"publisher","first-page":"1535","DOI":"10.1016\/0031-3203(92)90126-4","volume":"25","author":"Y Sato","year":"1992","unstructured":"Sato, Y.: Piecewise linear approximation of plane curves by perimeter optimization. Pattern Recognit. 25(12), 1535\u20131543 (1992)","journal-title":"Pattern Recognit."},{"key":"44_CR10","doi-asserted-by":"publisher","DOI":"10.5334\/baw","volume-title":"The Multi-Agent Transport Simulation MATSim","author":"A Horni","year":"2016","unstructured":"Horni, A., Nagel, K., Axhausen, K.: The Multi-Agent Transport Simulation MATSim. Ubiquity Press, London (2016)"},{"key":"44_CR11","unstructured":"Krajzewicz, D., Hertkorn, G., Rossel, C., Wagner, P.: SUMO (Simulation of Urban MObility) - an open-source traffic simulation. In: Al-Akaidi, A. (ed.) Proceedings of the 4th Middle East Symposium on Simulation and Modelling (MESM 2002), Sharjah, United Arab Emirates, pp. 183\u2013187 (2002)"},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"Smith, L., Beckman, R., Baggerly, K., Anson, D., Williams, M..: TRANSIMS: TRansportation ANalysis and SIMulation System: Project Summary and Status (1995)","DOI":"10.2172\/88648"},{"issue":"4","key":"44_CR13","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/T-C.1974.223961","volume":"C-23","author":"I Tomek","year":"1974","unstructured":"Tomek, I.: Two algorithms for piecewise-linear continuous approximation of functions of one variable. IEEE Trans. Comput. C-23(4), 445\u2013448 (1974)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"44_CR14","first-page":"159","volume":"9","author":"H Imai","year":"1987","unstructured":"Imai, H., Iri, M.: An optimal algorithm for approximating a piecewise linear function. J. Inf. Process. 9(3), 159\u2013162 (1987)","journal-title":"J. Inf. Process."},{"key":"44_CR15","unstructured":"Neubauer, S.: Space Efficient approximation of piecewise linear functions. Student Research Project (Studienarbeit), Universitat Karlsruhe (TH) (2009)"},{"issue":"1","key":"44_CR16","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0734-189X(86)90127-1","volume":"35","author":"S Suri","year":"1986","unstructured":"Suri, S.: A linear time algorithm with minimum link paths inside a simple polygon. Comput. Vis. Graph. Image Process. 35(1), 99\u2013110 (1986)","journal-title":"Comput. Vis. Graph. Image Process."},{"key":"44_CR17","doi-asserted-by":"crossref","unstructured":"Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.: Linear time algorithms for visibility and shortest path problems inside simple polygons. In SCG 1986: Proceedings of the Second Annual Symposium on Computational Geometry, New York, NY, USA, pp. 1\u201313 (1986)","DOI":"10.1145\/10515.10516"},{"issue":"6","key":"44_CR18","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.comgeo.2013.12.005","volume":"47","author":"J Mitchell","year":"2014","unstructured":"Mitchell, J., Polishchuk, V., Sysikaski, M.: Minimum-link paths revisited. Comput. Geom. 47(6), 651\u2013667 (2014)","journal-title":"Comput. Geom."},{"issue":"2","key":"44_CR19","first-page":"80","volume":"8","author":"I Kostitsyna","year":"2016","unstructured":"Kostitsyna, I., Loffler, M., Polishchuk, V., Frank, S.: On the complexity of minimum-link path problems. J. Comput. Geom. 8(2), 80\u2013108 (2016)","journal-title":"J. Comput. Geom."},{"key":"44_CR20","unstructured":"Chiu, Y.C., et al.: Dynamic traffic assignment: a primer. Transportation Research Circular E-C153, Transportation Research Board, Washington, DC (2011)"},{"issue":"4","key":"44_CR21","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1287\/trsc.29.4.305","volume":"29","author":"G Cantarella","year":"1995","unstructured":"Cantarella, G., Cascetta, E.: Dynamic processes and equilibrium in transportation networks: towards a unifying theory. Transp. Sci. 29(4), 305\u2013329 (1995)","journal-title":"Transp. Sci."},{"key":"44_CR22","volume-title":"Problem-Solving Methods in Artificial Intelligence","author":"N Nilsson","year":"1971","unstructured":"Nilsson, N.: Problem-Solving Methods in Artificial Intelligence. McGraw Hill, New York (1971)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22744-9_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:53:12Z","timestamp":1686099192000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22744-9_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030227432","9783030227449"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22744-9_44","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":"8 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Faro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"12 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}