{"id":"https://openalex.org/W1749015247","doi":"https://doi.org/10.1109/robot.1986.1087478","title":"An efficient parallel solution for Euclidean shortest path in three dimensions","display_name":"An efficient parallel solution for Euclidean shortest path in three dimensions","publication_year":1986,"publication_date":"1986-01-01","ids":{"openalex":"https://openalex.org/W1749015247","doi":"https://doi.org/10.1109/robot.1986.1087478","mag":"1749015247"},"language":"en","primary_location":{"id":"doi:10.1109/robot.1986.1087478","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.1986.1087478","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 1986 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113569764","display_name":"Chanderjit Bajaj","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"C. Bajaj","raw_affiliation_strings":["Purdue University, West Lafayette, IN"],"affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, IN","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5113569764"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":2.4314,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.88263711,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1897","last_page":"1900"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.8455648422241211},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7206015586853027},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48147621750831604},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4763624668121338},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.46568432450294495},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.45566409826278687},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.44699984788894653},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4339746832847595},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42384853959083557},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4165729880332947},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3490818738937378},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3050920367240906},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28038790822029114},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06333202123641968}],"concepts":[{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.8455648422241211},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7206015586853027},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48147621750831604},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4763624668121338},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.46568432450294495},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.45566409826278687},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.44699984788894653},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4339746832847595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42384853959083557},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4165729880332947},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3490818738937378},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3050920367240906},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28038790822029114},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06333202123641968},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/robot.1986.1087478","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.1986.1087478","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 1986 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1602815913","https://openalex.org/W1997955180","https://openalex.org/W2009056209","https://openalex.org/W2024693023","https://openalex.org/W2062881752","https://openalex.org/W2071025762","https://openalex.org/W2163178194","https://openalex.org/W4299512035","https://openalex.org/W6636124307"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2018146256","https://openalex.org/W2347245430","https://openalex.org/W2112429204","https://openalex.org/W2562562750","https://openalex.org/W2377950158","https://openalex.org/W2156431668","https://openalex.org/W4200172719","https://openalex.org/W2198982833"],"abstract_inverted_index":{"We":[0,28],"describe":[1,54,88],"an":[2,55],"efficient":[3,56],"parallel":[4,57],"solution":[5,96],"for":[6,50],"the":[7,11,23,30,34,38,94],"problem":[8],"of":[9,25,80],"finding":[10],"shortest":[12,44],"Euclidean":[13],"path":[14,45],"between":[15],"two":[16],"points":[17],"in":[18,22,36,42,97],"three":[19],"dimensional":[20],"space":[21],"presence":[24],"polyhedral":[26,84],"obstacles.":[27],"consider":[29],"important":[31],"case":[32,52],"where":[33],"order":[35],"which":[37],"obstacles":[39],"are":[40,70],"encountered":[41],"this":[43,51],"is":[46],"known.":[47],"In":[48],"particular":[49],"we":[53,86],"numerical":[58],"iterative":[59],"method":[60,91],"on":[61],"a":[62,89],"concurrent-read":[63],"exclusive-write":[64],"synchronous":[65],"shared-memory":[66],"model.":[67],"The":[68],"iterations":[69],"essentially":[71],"convergent":[72],"non-linear":[73],"block":[74],"Gauss-Seidel.":[75],"For":[76],"special":[77],"relative":[78],"orientations":[79],"the,":[81],"say":[82],"n,":[83],"obstacles,":[85],"further":[87],"direct":[90],"that":[92],"gives":[93],"exact":[95],"O(log":[98],"n)":[99],"time":[100],"using":[101],"n":[102],"processors.":[103]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}