{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:59:57Z","timestamp":1725703197693},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642326493"},{"type":"electronic","value":"9783642326509"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32650-9_30","type":"book-chapter","created":{"date-parts":[[2012,10,3]],"date-time":"2012-10-03T14:19:21Z","timestamp":1349273961000},"page":"292-299","source":"Crossref","is-referenced-by-count":1,"title":["Piecewise Linear Approximation of n-Dimensional Parametric Curves Using Particle Swarms"],"prefix":"10.1007","author":[{"given":"Christopher Wesley","family":"Cleghorn","sequence":"first","affiliation":[]},{"given":"Andries P.","family":"Engelbrecht","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Burden, R.L. and Faires, J.D.: Numerical Analysis. Brooks Cole (2007)"},{"key":"30_CR2","unstructured":"Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proceedings of the IEEE International Joint Conference on Neural Networks, pp. 1942\u20131948 (1995)"},{"key":"30_CR3","unstructured":"Kennedy, J., Mendes, R.: Population Structure and Particle Performance. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1671\u20131676 (2002)"},{"key":"30_CR4","unstructured":"Peer, E.S., van den Bergh, F., Engelbrecht, A.P.: Using Neighborhoods with the Guaranteed Convergence PSO. In: Proceedings of the IEEE Swarm Intelligence Symposium, pp. 235\u2013242 (2003)"},{"issue":"5","key":"30_CR5","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0031-3203(80)90031-X","volume":"12","author":"J. Sklansky","year":"1980","unstructured":"Sklansky, J., Gonzalez, V.: Fast polygonal approximation of digitized curves. Pattern Recognition\u00a012(5), 327\u2013331 (1980)","journal-title":"Pattern Recognition"},{"issue":"2","key":"30_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0167-8655(00)00088-X","volume":"22","author":"M. Salotti","year":"2001","unstructured":"Salotti, M.: An efficient algorithm for the optimal polygonal approximation of digitized curves. Pattern Recognition Letters\u00a022(2), 215\u2013221 (2001)","journal-title":"Pattern Recognition Letters"},{"key":"30_CR7","unstructured":"do Carmo, M.: Differential Geometry of Curves and Surfaces. Prentice-Hall (1976)"},{"issue":"3","key":"30_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1590\/S0104-65001997000100003","volume":"3","author":"L. Velho","year":"1997","unstructured":"Velho, L., de Figueiredo, L.H., Gomes, J.: Journal of the Brazilian Computer Society\u00a03(3), 1\u201314 (1997)","journal-title":"Journal of the Brazilian Computer Society"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Imamoto, A., Tang, B.: A Recursive Descent Algorithm for Finding the Optimal Minimax Piecewise Linear Approximation of Convex Functions. In: Advances in Electrical and Electronics Engineering, pp. 287\u2013289 (2008)","DOI":"10.1109\/WCECS.2008.42"},{"key":"30_CR10","unstructured":"Manis, G., Papakonstantinou, G., Tsanakas, P.: Optimal Piecewise Linear Approximation of Digitized Curves. In: Proceedings of International Conference on Digital Signal Processing, pp. 1079\u20131081 (1997)"},{"key":"30_CR11","unstructured":"Horst, J.A., Beichl, I.: A Simple Algorithm for Eficient Piecewise Linear Approximation of Space Curves. In: Proceedings of International Conference on Image Processing, pp. 744\u2013747 (1997)"},{"issue":"8","key":"30_CR12","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1109\/TC.1977.1674918","volume":"25","author":"T. Pavlidis","year":"1977","unstructured":"Pavlidis, T.: Polygonal Approximations by Newton\u2019s Method. IEEE Transactions on Computers\u00a025(8), 800\u2013807 (1977)","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"30_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/TPAMI.1986.4767753","volume":"PAMI-8","author":"J.G. Dunham","year":"1986","unstructured":"Dunham, J.G.: Optimum uniform piecewise linear approximation of planar curves. IEEE Transactionson Pattern Analysis and Machine Intelligence\u00a0PAMI-8(1), 67\u201375 (1986)","journal-title":"IEEE Transactionson Pattern Analysis and Machine Intelligence"},{"issue":"73","key":"30_CR14","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1090\/S0025-5718-1961-0119390-6","volume":"15","author":"H. Stone","year":"1961","unstructured":"Stone, H.: Approximation of Curves by Line Segments. Mathematics of Computation\u00a015(73), 40\u201347 (1961)","journal-title":"Mathematics of Computation"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Engelbrecht, A.P.: Particle Swarm Optimization: Velocity Initialization. Accepted for IEEE Congress on Eevolutionary Computation (2012)","DOI":"10.1109\/CEC.2012.6256112"}],"container-title":["Lecture Notes in Computer Science","Swarm Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32650-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T00:27:12Z","timestamp":1557188832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32650-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642326493","9783642326509"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32650-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}