{"id":"https://openalex.org/W6902602404","doi":"https://doi.org/10.7273/000005463","title":"ALGORITHMS FOR PATH PLANNING IN 3D PRINTING","display_name":"ALGORITHMS FOR PATH PLANNING IN 3D PRINTING","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W6902602404","doi":"https://doi.org/10.7273/000005463"},"language":"en","primary_location":{"id":"doi:10.7273/000005463","is_oa":true,"landing_page_url":"https://doi.org/10.7273/000005463","pdf_url":null,"source":{"id":"https://openalex.org/S7407053376","display_name":"Washington State University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.7273/000005463","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Gupta, Prashant","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gupta, Prashant","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.52919971,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.31470000743865967,"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.31470000743865967,"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/T10783","display_name":"Additive Manufacturing and 3D Printing Technologies","score":0.16269999742507935,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.08669999986886978,"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/eulerian-path","display_name":"Eulerian path","score":0.6567000150680542},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.6115000247955322},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5472999811172485},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5271000266075134},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5166000127792358},{"id":"https://openalex.org/keywords/polygon-mesh","display_name":"Polygon mesh","score":0.4749000072479248},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4512999951839447},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.4375},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.43309998512268066},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.4187999963760376}],"concepts":[{"id":"https://openalex.org/C43058520","wikidata":"https://www.wikidata.org/wiki/Q624580","display_name":"Eulerian path","level":3,"score":0.6567000150680542},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6115000247955322},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5557000041007996},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5472999811172485},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5271000266075134},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5166000127792358},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5059000253677368},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.4749000072479248},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4512999951839447},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44510000944137573},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.4375},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.43309998512268066},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.4187999963760376},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.3977000117301941},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.39079999923706055},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.38659998774528503},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.35409998893737793},{"id":"https://openalex.org/C558772884","wikidata":"https://www.wikidata.org/wiki/Q1508564","display_name":"Graph rewriting","level":3,"score":0.3336000144481659},{"id":"https://openalex.org/C4107886","wikidata":"https://www.wikidata.org/wiki/Q906377","display_name":"Discrete geometry","level":2,"score":0.31029999256134033},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3075999915599823},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.29760000109672546},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29030001163482666},{"id":"https://openalex.org/C62884695","wikidata":"https://www.wikidata.org/wiki/Q184871","display_name":"Euler's formula","level":2,"score":0.2892000079154968},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.2745000123977661},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.26910001039505005},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.26840001344680786},{"id":"https://openalex.org/C155846161","wikidata":"https://www.wikidata.org/wiki/Q1143367","display_name":"Graphical model","level":2,"score":0.2678000032901764},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.2653000056743622},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2596000134944916},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.2513999938964844}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.7273/000005463","is_oa":true,"landing_page_url":"https://doi.org/10.7273/000005463","pdf_url":null,"source":{"id":"https://openalex.org/S7407053376","display_name":"Washington State University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.7273/000005463","is_oa":true,"landing_page_url":"https://doi.org/10.7273/000005463","pdf_url":null,"source":{"id":"https://openalex.org/S7407053376","display_name":"Washington State University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,250],"my":[1],"thesis":[2],"we":[3,36],"have":[4,79],"addressed":[5],"the":[6,39,55,59,148,153,206,229,277,288,320,337],"questions":[7],"on":[8,215,263],"path":[9,22,34,76,238,246],"planning":[10],"in":[11,24,131,147,182,186,231],"additive":[12],"manufacturing(AM)":[13],"by":[14,45,313],"tackling":[15],"problems":[16,184,311],"related":[17],"to":[18,53,63,102,169,304],"geometry":[19,97],"and":[20,62,72,86,95,101,104,192,335],"tool":[21,33,75,222,237,245],"traversal":[23],"a":[25,115,127,138,196,200,210,219,236,251,291,297,327],"graphical":[26,30],"setting.":[27],"By":[28],"using":[29],"models":[31],"for":[32,74,98,121,266,336],"planning,":[35],"can":[37],"ensure":[38],"required":[40],"mechanical":[41],"properties":[42],"are":[43,180],"satisfied":[44],"imposing":[46],"appropriate":[47],"constraints.":[48],"The":[49],"overall":[50],"goal":[51],"is":[52,135,152,167,284,290],"characterize":[54],"mathematical":[56,82],"aspects":[57],"of":[58,70,137,142,155,205,209,228,254,260,269,308,329],"AM":[60],"problem":[61,283],"develop":[64],"efficient":[65,106,258],"algorithms":[66],"with":[67,247],"provable":[68],"guarantees":[69],"performance":[71],"quality":[73],"planning.":[77],"We":[78,108,194],"creatively":[80],"used":[81],"techniques":[83],"from":[84],"combinatorial":[85],"computational":[87,91,96],"topology,":[88],"discrete":[89],"optimization,":[90],"complexity,":[92],"graph":[93,149],"theory,":[94],"theoretical":[99],"results":[100],"design":[103],"implement":[105],"algorithms.":[107],"proposed":[109],"an":[110,158,171],"Euler":[111],"transformation":[112],"that":[113,151,198,240,276],"transforms":[114],"given":[116],"d-dimensional":[117],"cell":[118],"complex":[119],"K":[120],"d":[122],"=":[123],"2;":[124],"3":[125],"into":[126],"new":[128,201],"d-complex":[129],"^K":[130,156],"which":[132,161,216],"every":[133,145,232],"vertex":[134,146],"part":[136],"same":[139],"even":[140,159,286],"number":[141],"edges.":[143],"Hence":[144],"^G":[150,163],"1-skeleton":[154],"has":[157],"degree,":[160],"makes":[162],"Eulerian,":[164],"i.e.,":[165],"it":[166,339],"guaranteed":[168],"contain":[170],"Eulerian":[172,178],"tour.":[173],"Meshes":[174],"whose":[175],"edges":[176],"admit":[177],"tours":[179],"crucial":[181],"coverage":[183],"arising":[185],"several":[187],"applications":[188],"including":[189],"3D":[190,207,212],"printing":[191,213,271,282,310],"robotics.":[193],"developed":[195,295],"framework":[197,303,323],"creates":[199],"polygonal":[202],"mesh":[203],"representation":[204],"domain":[208,230],"layer-by-layer":[211],"job":[214],"I":[217,234,256,273,294],"identify":[218],"single,":[220],"continuous":[221,244],"paths":[223],"covering":[224],"each":[225,242],"connected":[226],"piece":[227],"layer.":[233],"present":[235],"algorithm":[239],"traverses":[241],"such":[243],"no":[248],"crossovers.":[249],"third":[252],"line":[253],"work,":[255],"explored":[257],"optimization":[259,316],"toolpaths":[261,325,341],"based":[262,301],"multiple":[264],"criteria":[265],"large":[267,306],"instances":[268,307],"3d":[270,281,309],"problems.":[272],"first":[274],"showed":[275],"minimum":[278],"turn":[279],"cost":[280],"NP-hard,":[285],"when":[287],"region":[289],"simple":[292],"polygon.":[293],"SFCDecomp,":[296],"space":[298],"filling":[299],"curve":[300],"decomposition":[302],"solve":[305],"efficiently":[312],"solving":[314],"these":[315],"subproblems":[317],"independently.":[318],"For":[319],"Buddha,":[321],"this":[322],"builds":[324,340],"over":[326,342],"total":[328],"799,716":[330],"nodes":[331,344],"across":[332,345],"169":[333],"layers,":[334],"Bunny":[338],"812,733":[343],"360":[346],"layers.":[347]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-10-10T00:00:00"}