{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T11:15:16Z","timestamp":1698146116347},"reference-count":4,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,30]],"date-time":"2006-10-30T00:00:00Z","timestamp":1162166400000},"content-version":"vor","delay-in-days":5722,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1991,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>As parallel machines become more widely available, many existing algorithms are being converted to take advantage of the improved speed offered by such computers. However, the method by which the algorithm is distributed is crucial towards obtaining the speed\u2010ups required for many real\u2010time tasks. This paper presents three parallel implementations of the Douglas\u2014Peucker line simplification algorithm on a Sequent Symmetry computer and compares the performance of each with the original sequential algorithm.<\/jats:p>","DOI":"10.1002\/spe.4380210307","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T18:32:57Z","timestamp":1163788377000},"page":"331-336","source":"Crossref","is-referenced-by-count":8,"title":["A parallel implementation of the douglas\u2010peucker line simplification algorithm"],"prefix":"10.1002","volume":"21","author":[{"given":"Jon","family":"Vaughan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duncan","family":"Whyatt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Graham","family":"Brookes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,30]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.3138\/FM57-6770-U75U-7727"},{"issue":"1","key":"e_1_2_1_3_2","first-page":"17","article-title":"The Douglas\u2010Peucker line simplification algorithm","volume":"22","author":"Whyatt J. D.","year":"1988","journal-title":"Bulletin of The Society of University Cartographers"},{"key":"e_1_2_1_4_2","volume-title":"Guide to Parallel Programming On Sequent Computer Systems","author":"Osterhaug A.","year":"1987"},{"issue":"3","key":"e_1_2_1_5_2","first-page":"193","article-title":"The Mandelbrot set as a parallel processing benchmark","volume":"11","author":"Vaughan J. R.","year":"1989","journal-title":"University Computing"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380210307","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380210307","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T04:54:28Z","timestamp":1698036868000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380210307"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["10.1002\/spe.4380210307"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380210307","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}