{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:50:41Z","timestamp":1757541041836},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Visual Computer"],"published-print":{"date-parts":[[1988,11]]},"DOI":"10.1007\/bf01901194","type":"journal-article","created":{"date-parts":[[2005,7,7]],"date-time":"2005-07-07T11:11:23Z","timestamp":1120734683000},"page":"371-378","source":"Crossref","is-referenced-by-count":13,"title":["Parallel algorithms for shortest path problems in polygons"],"prefix":"10.1007","volume":"3","author":[{"given":"Hossam","family":"ElGindy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Goodrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01901194_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal A, Chazelle B, Guibas L, O'Dunlaing C, Yap C (1985) Parallel computational geometry. Proc 25th Ann Symp Foundat Comput Sci, pp 468\u2013477","DOI":"10.1109\/SFCS.1985.42"},{"key":"BF01901194_CR2","doi-asserted-by":"crossref","unstructured":"Atallah MJ, Cole R, Goodrich MT (1987) Cascading divideand-conquer: a technique for designing parallel algorithms. Proc. 28 th Ann Symp Foundat Comput Sci, pp 151\u2013160","DOI":"10.1109\/SFCS.1987.12"},{"key":"BF01901194_CR3","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1016\/0743-7315(86)90011-0","volume":"3","author":"MJ Atallah","year":"1988","unstructured":"Atallah MJ, Goodrich MT (1988) Efficient parallel solutions to some geometric problems. J Parallel Distrib Comput 3:492\u2013507","journal-title":"J Parallel Distrib Comput"},{"key":"BF01901194_CR4","unstructured":"Atallah MJ, Goodrich MT (1986) Parallel algorithms for some functions of two convex polygons. 24th Ann Allerton Conf Commun Control Comput, Urbana-Champaign (October 1986), pp 758\u2013767"},{"key":"BF01901194_CR5","doi-asserted-by":"crossref","unstructured":"Chazelle B (1982) A theorem on polygon cutting with applications. Proc 23rd Ann Symp Foundat Comput Sci, pp 339\u2013349","DOI":"10.1109\/SFCS.1982.58"},{"key":"BF01901194_CR6","unstructured":"Chow A (1980) Parallel algorithms for geometric problems. PhD Diss, Comput Sci Dept, Univ Illinois at Urbana-Champaign"},{"key":"BF01901194_CR7","unstructured":"ElGindy H (1985) Hierarchical decomposition of polygons with applications. PhD Diss, School Comput Sci, McGill Univ (June 1985)"},{"key":"BF01901194_CR8","unstructured":"ElGindy H (1986) A parallel algorithm for the shortest path problem in monotone polygons. Tech Rep MS-CIS-86-49, Dept Comput Inf Sci, School Eng Appl Sci, Univ Pennsylvania (June 1986)"},{"key":"BF01901194_CR9","unstructured":"Goodrich MT (1988) Triangulation a simple polygon in parallel. J Algorithms (in press)"},{"key":"BF01901194_CR10","doi-asserted-by":"crossref","unstructured":"Guibas L, Hershberger J, Leven D, Sharir M, Tarjan R (1986) Linear time algorithms for visibility and shortest path problems inside simple polygons. Proc 2nd Symp Comput Geom, York Heights (June 1986), pp 1\u201313","DOI":"10.1145\/10515.10516"},{"key":"BF01901194_CR11","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"DT Lee","year":"1984","unstructured":"Lee DT, Preparata FP (1984) Euclidean shortest paths in the presence of rectilinear barriers. Networks 14:393\u2013410","journal-title":"Networks"},{"key":"BF01901194_CR12","first-page":"872","volume":"33","author":"DT Lee","year":"1984","unstructured":"Lee DT, Preparata FP (1984) Computational geometry- a survey. IEEE Trans Comput C 33:872\u20131101","journal-title":"IEEE Trans Comput C"},{"key":"BF01901194_CR13","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T Lozano-Perez","year":"1979","unstructured":"Lozano-Perez T, Wesley MA (1979) An algorithm for planning collision-free paths among polyhedral obstacles. Commun ACM 22:560\u2013570","journal-title":"Commun ACM"},{"key":"BF01901194_CR14","doi-asserted-by":"crossref","unstructured":"Pan V, Reif J (1985) Efficient parallel solution of linear systems. Proc 17th ACM Symp Theor Comput, pp 143\u2013152","DOI":"10.1145\/22145.22161"},{"key":"BF01901194_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry: an introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata FP, Shamos MI (1985) Computational geometry: an introduction. Springer, Berlin Heidelberg New York"},{"key":"BF01901194_CR16","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/2514.2515","volume":"16","author":"MJ Quinn","year":"1984","unstructured":"Quinn MJ, Deo N (1984) Parallel graph algorithms. Comput Surv 16:319\u2013346","journal-title":"Comput Surv"},{"key":"BF01901194_CR17","volume-title":"Parallel algorithms for graph theoretic problems","author":"C Savage","year":"1984","unstructured":"Savage C (1984) Parallel algorithms for graph theoretic problems. PhD Diss, Math Dept, Univ. Illinois, Urbana, III"},{"key":"BF01901194_CR18","doi-asserted-by":"crossref","unstructured":"Tarjan RE, Van Wyk CJ (1986) AnO(n loglogn)-time algorithm for triangulating simple polygons. Tech Rep CS-TR-052-86, Dept Comput Sci, Princeton Univ","DOI":"10.1145\/12130.12170"},{"key":"BF01901194_CR19","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","volume":"14","author":"RE Tarjan","year":"1985","unstructured":"Tarjan RE, Vishkin U (1985) An efficient parallel biconnectivity algorithm. SIAM J Comput 14:862\u2013874","journal-title":"SIAM J Comput"},{"key":"BF01901194_CR20","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(85)90044-4","volume":"20","author":"E Welzl","year":"1985","unstructured":"Welzl E (1985) Constructing the visibility graph forn line segments inO(n 2) time. Inf Proc Lett 20:167\u2013171","journal-title":"Inf Proc Lett"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01901194.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01901194\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01901194","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T05:10:43Z","timestamp":1586322643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01901194"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["BF01901194"],"URL":"https:\/\/doi.org\/10.1007\/bf01901194","relation":{},"ISSN":["0178-2789","1432-8726"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-8726","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}