{"id":"https://openalex.org/W2737354767","doi":"https://doi.org/10.1109/icra.2017.7989141","title":"An improved toolpath generation algorithm for fused filament fabrication","display_name":"An improved toolpath generation algorithm for fused filament fabrication","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2737354767","doi":"https://doi.org/10.1109/icra.2017.7989141","mag":"2737354767"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2017.7989141","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2017.7989141","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Robotics and Automation (ICRA)","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/A5028884558","display_name":"Samuel Lensgraf","orcid":null},"institutions":[{"id":"https://openalex.org/I114832834","display_name":"Tulane University","ror":"https://ror.org/04vmvtb21","country_code":"US","type":"education","lineage":["https://openalex.org/I114832834"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Samuel Lensgraf","raw_affiliation_strings":["Department of Computer Science, Tulane University, New Orleans, LA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Tulane University, New Orleans, LA","institution_ids":["https://openalex.org/I114832834"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063192197","display_name":"Ramgopal R. Mettu","orcid":"https://orcid.org/0000-0001-9479-9156"},"institutions":[{"id":"https://openalex.org/I114832834","display_name":"Tulane University","ror":"https://ror.org/04vmvtb21","country_code":"US","type":"education","lineage":["https://openalex.org/I114832834"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ramgopal R. Mettu","raw_affiliation_strings":["Tulane University Law School, New Orleans, LA, US"],"affiliations":[{"raw_affiliation_string":"Tulane University Law School, New Orleans, LA, US","institution_ids":["https://openalex.org/I114832834"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028884558"],"corresponding_institution_ids":["https://openalex.org/I114832834"],"apc_list":null,"apc_paid":null,"fwci":1.1877,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.80904958,"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":"1181","last_page":"1187"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9968000054359436,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9968000054359436,"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/T10789","display_name":"Interactive and Immersive Displays","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1709","display_name":"Human-Computer Interaction"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9922000169754028,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7556452751159668},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6369028687477112},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6336548924446106},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.575419545173645},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5732626914978027},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5703245401382446},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5700527429580688},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4702027440071106},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4686521887779236},{"id":"https://openalex.org/keywords/layer","display_name":"Layer (electronics)","score":0.46541738510131836},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.43824371695518494},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2210819125175476},{"id":"https://openalex.org/keywords/materials-science","display_name":"Materials science","score":0.06413647532463074}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7556452751159668},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6369028687477112},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6336548924446106},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.575419545173645},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5732626914978027},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5703245401382446},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5700527429580688},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4702027440071106},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4686521887779236},{"id":"https://openalex.org/C2779227376","wikidata":"https://www.wikidata.org/wiki/Q6505497","display_name":"Layer (electronics)","level":2,"score":0.46541738510131836},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.43824371695518494},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2210819125175476},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.06413647532463074},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2017.7989141","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2017.7989141","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.47999998927116394,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1480355964","https://openalex.org/W1548993723","https://openalex.org/W1966875817","https://openalex.org/W2042986967","https://openalex.org/W2059222268","https://openalex.org/W2066566133","https://openalex.org/W2088398985","https://openalex.org/W2118555864","https://openalex.org/W2141056356","https://openalex.org/W2144137528","https://openalex.org/W2145778119","https://openalex.org/W2182693437","https://openalex.org/W2415791156","https://openalex.org/W2793770790","https://openalex.org/W2997027240","https://openalex.org/W6632805685"],"related_works":["https://openalex.org/W4252122881","https://openalex.org/W134055995","https://openalex.org/W2009796757","https://openalex.org/W4302819359","https://openalex.org/W1973873435","https://openalex.org/W4244487479","https://openalex.org/W1963627056","https://openalex.org/W2769220156","https://openalex.org/W1981191225","https://openalex.org/W4232431455"],"abstract_inverted_index":{"Widely-used":[0],"methods":[1,104],"for":[2,159],"toolpath":[3,39,116],"planning":[4],"in":[5,40,46],"fused":[6],"filament":[7],"fabrication":[8],"slice":[9],"the":[10,38,82,106,146,152],"input":[11,162],"3D":[12,41],"model":[13],"into":[14],"2D":[15],"layers":[16],"and":[17,36,76,90],"construct":[18],"a":[19,28,57,69,97,119,131,142,160],"toolpath.":[20],"In":[21,64],"prior":[22,94],"work":[23],"(ICRA":[24],"2016)":[25],"we":[26,67],"gave":[27],"simple":[29],"greedy":[30,83],"algorithm":[31,50,71,86],"that":[32,72],"changed":[33],"this":[34,65],"paradigm":[35],"constructed":[37],"by":[42],"printing":[43],"local":[44,88],"features":[45],"their":[47],"entirety.":[48],"This":[49,125],"significantly":[51,78],"improved":[52],"upon":[53],"layer-based":[54,103],"methods,":[55],"achieving":[56,96],"34%":[58],"mean":[59],"reduction":[60,99],"of":[61,100,109],"wasted":[62],"motion.":[63],"paper":[66],"give":[68,140],"new":[70],"is":[73],"more":[74],"robust":[75],"achieves":[77],"better":[79],"performance":[80],"than":[81],"approach.":[84],"Our":[85],"utilizes":[87],"search":[89],"nearly":[91],"doubles":[92],"our":[93],"improvement,":[95],"mean/median":[98],"62%":[101],"over":[102,110],"on":[105,145],"same":[107],"benchmark":[108],"400":[111],"models.":[112],"We":[113],"also":[114],"study":[115],"optimality":[117],"using":[118],"novel":[120],"integer":[121],"linear":[122,132],"programming":[123,133],"formulation.":[124],"formulation":[126],"allows":[127],"us":[128,141,151],"to":[129,154],"solve":[130],"relaxation":[134],"that,":[135],"while":[136],"computationally":[137],"intensive,":[138],"can":[139],"lower":[143],"bound":[144],"optimal":[147],"solution":[148,157],"quality,":[149],"giving":[150],"ability":[153],"rigorously":[155],"characterize":[156],"quality":[158],"given":[161],"model.":[163]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}