{"id":"https://openalex.org/W2949485541","doi":"https://doi.org/10.1016/j.cad.2019.06.002","title":"Path Planning of a Type of Porous Structures for Additive Manufacturing","display_name":"Path Planning of a Type of Porous Structures for Additive Manufacturing","publication_year":2019,"publication_date":"2019-06-19","ids":{"openalex":"https://openalex.org/W2949485541","doi":"https://doi.org/10.1016/j.cad.2019.06.002","mag":"2949485541"},"language":"en","primary_location":{"id":"doi:10.1016/j.cad.2019.06.002","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.cad.2019.06.002","pdf_url":null,"source":{"id":"https://openalex.org/S4210171473","display_name":"Computer-Aided Design","issn_l":"0010-4485","issn":["0010-4485","1879-2685"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer-Aided Design","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/A5036422892","display_name":"Xiaoya Zhai","orcid":"https://orcid.org/0000-0002-5209-8738"},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaoya Zhai","raw_affiliation_strings":["School of Mathematical Sciences, University of Science and Technology of China, Hefei, Anhui 230026, PR China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, University of Science and Technology of China, Hefei, Anhui 230026, PR China","institution_ids":["https://openalex.org/I126520041"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032285268","display_name":"Falai Chen","orcid":"https://orcid.org/0000-0002-9898-5922"},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Falai Chen","raw_affiliation_strings":["School of Mathematical Sciences, University of Science and Technology of China, Hefei, Anhui 230026, PR China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, University of Science and Technology of China, Hefei, Anhui 230026, PR China","institution_ids":["https://openalex.org/I126520041"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032285268"],"corresponding_institution_ids":["https://openalex.org/I126520041"],"apc_list":null,"apc_paid":null,"fwci":1.7866,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.88379881,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"115","issue":null,"first_page":"218","last_page":"230"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9993000030517578,"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.9993000030517578,"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/T12190","display_name":"Innovations in Concrete and Construction Materials","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T10783","display_name":"Additive Manufacturing and 3D Printing Technologies","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.6514873504638672},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.5399676561355591},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5345064401626587},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5299818515777588},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5282021164894104},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.4879574179649353},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48219671845436096},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4594271183013916},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.45869180560112},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3880327045917511},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36194556951522827},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3266918957233429},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.22597211599349976}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.6514873504638672},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.5399676561355591},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5345064401626587},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5299818515777588},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5282021164894104},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.4879574179649353},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48219671845436096},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4594271183013916},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.45869180560112},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3880327045917511},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36194556951522827},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3266918957233429},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.22597211599349976},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.cad.2019.06.002","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.cad.2019.06.002","pdf_url":null,"source":{"id":"https://openalex.org/S4210171473","display_name":"Computer-Aided Design","issn_l":"0010-4485","issn":["0010-4485","1879-2685"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer-Aided Design","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W987860885","https://openalex.org/W1584202471","https://openalex.org/W1971354628","https://openalex.org/W1980807331","https://openalex.org/W1982322689","https://openalex.org/W2016403530","https://openalex.org/W2021494129","https://openalex.org/W2039166960","https://openalex.org/W2046095156","https://openalex.org/W2060640461","https://openalex.org/W2070942838","https://openalex.org/W2079545962","https://openalex.org/W2080642260","https://openalex.org/W2088362341","https://openalex.org/W2116175081","https://openalex.org/W2137726847","https://openalex.org/W2146968309","https://openalex.org/W2150593711","https://openalex.org/W2162232298","https://openalex.org/W2232710831","https://openalex.org/W2473797470","https://openalex.org/W2592526180","https://openalex.org/W2621334237","https://openalex.org/W2738609291","https://openalex.org/W2765367911","https://openalex.org/W2794243394","https://openalex.org/W3003181218","https://openalex.org/W4249957004","https://openalex.org/W6649568774"],"related_works":["https://openalex.org/W2377402383","https://openalex.org/W2380835401","https://openalex.org/W2381912691","https://openalex.org/W2350381577","https://openalex.org/W2353618196","https://openalex.org/W2348074676","https://openalex.org/W2385033175","https://openalex.org/W2374043190","https://openalex.org/W2363298784","https://openalex.org/W2367402697"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}