{"id":"https://openalex.org/W2027563450","doi":"https://doi.org/10.1080/0951192x.2015.1033019","title":"A rectilinear pipe routing algorithm: Manhattan visibility graph","display_name":"A rectilinear pipe routing algorithm: Manhattan visibility graph","publication_year":2015,"publication_date":"2015-04-21","ids":{"openalex":"https://openalex.org/W2027563450","doi":"https://doi.org/10.1080/0951192x.2015.1033019","mag":"2027563450"},"language":"en","primary_location":{"id":"doi:10.1080/0951192x.2015.1033019","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0951192x.2015.1033019","pdf_url":null,"source":{"id":"https://openalex.org/S57062392","display_name":"International Journal of Computer Integrated Manufacturing","issn_l":"0951-192X","issn":["0951-192X","1362-3052"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Integrated Manufacturing","raw_type":"journal-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/A5101979536","display_name":"Qiang Liu","orcid":"https://orcid.org/0000-0003-3094-8604"},"institutions":[{"id":"https://openalex.org/I166846921","display_name":"Liaoning Shihua University","ror":"https://ror.org/00k6c4h29","country_code":"CN","type":"education","lineage":["https://openalex.org/I166846921"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Qiang Liu","raw_affiliation_strings":["School of Information and Control Engineering, Liaoning Shihua University, Fushun, China","School of Information and Control Engineering, Liaoning Shihua University, Fushun, China#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Control Engineering, Liaoning Shihua University, Fushun, China","institution_ids":["https://openalex.org/I166846921"]},{"raw_affiliation_string":"School of Information and Control Engineering, Liaoning Shihua University, Fushun, China#TAB#","institution_ids":["https://openalex.org/I166846921"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101979536"],"corresponding_institution_ids":["https://openalex.org/I166846921"],"apc_list":null,"apc_paid":null,"fwci":0.7077,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.77024846,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9948999881744385,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/visibility-graph","display_name":"Visibility graph","score":0.8727177381515503},{"id":"https://openalex.org/keywords/visibility","display_name":"Visibility","score":0.6156681776046753},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5690487623214722},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5432599186897278},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5294230580329895},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.5040146708488464},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46873149275779724},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4505409300327301},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.44864070415496826},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.44389209151268005},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42432114481925964},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.34506797790527344},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3210299611091614},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30484867095947266},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12504354119300842},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10865098237991333},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07792928814888},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.0744660496711731},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.07346281409263611}],"concepts":[{"id":"https://openalex.org/C173362246","wikidata":"https://www.wikidata.org/wiki/Q8216024","display_name":"Visibility graph","level":3,"score":0.8727177381515503},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.6156681776046753},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5690487623214722},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5432599186897278},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5294230580329895},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.5040146708488464},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46873149275779724},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4505409300327301},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.44864070415496826},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.44389209151268005},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42432114481925964},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.34506797790527344},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3210299611091614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30484867095947266},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12504354119300842},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10865098237991333},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07792928814888},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.0744660496711731},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.07346281409263611},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/0951192x.2015.1033019","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0951192x.2015.1033019","pdf_url":null,"source":{"id":"https://openalex.org/S57062392","display_name":"International Journal of Computer Integrated Manufacturing","issn_l":"0951-192X","issn":["0951-192X","1362-3052"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Integrated Manufacturing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G322871187","display_name":null,"funder_award_id":"51305192","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W73629738","https://openalex.org/W97583072","https://openalex.org/W103914774","https://openalex.org/W1508968487","https://openalex.org/W1864619642","https://openalex.org/W1986460167","https://openalex.org/W2035809126","https://openalex.org/W2038669746","https://openalex.org/W2046159746","https://openalex.org/W2059887603","https://openalex.org/W2062459399","https://openalex.org/W2066836797","https://openalex.org/W2072073129","https://openalex.org/W2077273375","https://openalex.org/W2102223273","https://openalex.org/W2102444270","https://openalex.org/W2118866469","https://openalex.org/W2147386495","https://openalex.org/W2148798176","https://openalex.org/W2151051898","https://openalex.org/W2153580689","https://openalex.org/W2163178194","https://openalex.org/W2163929525","https://openalex.org/W2166751650","https://openalex.org/W2169528473","https://openalex.org/W2383247624","https://openalex.org/W4237151101","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W2743652671","https://openalex.org/W2911638885","https://openalex.org/W2032709970","https://openalex.org/W2066813664","https://openalex.org/W2094166299","https://openalex.org/W2519024191","https://openalex.org/W2963183586","https://openalex.org/W2159176266","https://openalex.org/W2555559350","https://openalex.org/W1971663816"],"abstract_inverted_index":{"Pipe":[0],"routing":[1,25,76,122],"can":[2,57],"be":[3],"briefly":[4],"formulated":[5],"as":[6],"seeking":[7],"the":[8,34,41,52,64,96,128,133],"shortest":[9,42],"collision-free":[10,43],"pipe":[11,24,121],"paths":[12,44],"while":[13],"meeting":[14],"certain":[15],"engineering":[16],"constraints.":[17],"This":[18],"article":[19,53,65],"presents":[20],"a":[21,119],"new":[22],"rectilinear":[23],"algorithm":[26,68],"called":[27],"Manhattan":[28,49],"visibility":[29],"graph":[30,84],"(MVG)":[31],"by":[32],"extending":[33],"Visibility":[35],"Graph":[36],"method":[37],"used":[38],"for":[39],"finding":[40],"in":[45,78],"Euclidean":[46],"spaces":[47],"to":[48,69,72,126],"spaces.":[50,81],"Subsequently,":[51],"proves":[54],"that":[55,86],"MVG":[56,67,104],"theoretically":[58],"guarantee":[59],"an":[60],"optimal":[61],"solution.":[62],"Further,":[63],"extends":[66],"surface":[70],"cases":[71],"meet":[73],"requirements":[74],"of":[75,99,110,132],"pipes":[77],"aero-engine":[79],"rotational":[80],"Unlike":[82],"previous":[83],"methods":[85],"commonly":[87],"yield":[88],"more":[89],"than":[90],"n":[91,94,113],"nodes":[92],"(where":[93],"is":[95],"total":[97],"number":[98],"terminals":[100],"and":[101,130],"obstacle":[102],"vertices),":[103],"significantly":[105],"reduces":[106],"computation":[107],"complexity":[108],"because":[109],"containing":[111],"only":[112],"nodes.":[114],"Finally,":[115],"numerical":[116],"computations":[117],"on":[118],"developed":[120],"system":[123],"are":[124],"performed":[125],"demonstrate":[127],"effectiveness":[129],"efficiency":[131],"proposed":[134],"method.":[135]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-08-15T07:11:24.734988","created_date":"2025-10-10T00:00:00"}