Jeeeun Kim, C. Zheng, Haruki Takahashi, M. Gross, Daniel Ashbrook, Tom Yeh
We present Compositional 3D Printing, recasting the 3D printer as a tool for expression that responds to real-time design decisions, analogous to composing a piece of music using a mixer. Our paradigm supports a wide range of inputs and interactions for designers, to be used in the moment; not only before printing, but anytime during production. We propose the design space of this digital fabrication paradigm, and outline methods and technical details with which researchers and practitioners can expand this space.
{"title":"Compositional 3D printing: expanding & supporting workflows towards continuous fabrication","authors":"Jeeeun Kim, C. Zheng, Haruki Takahashi, M. Gross, Daniel Ashbrook, Tom Yeh","doi":"10.1145/3213512.3213518","DOIUrl":"https://doi.org/10.1145/3213512.3213518","url":null,"abstract":"We present Compositional 3D Printing, recasting the 3D printer as a tool for expression that responds to real-time design decisions, analogous to composing a piece of music using a mixer. Our paradigm supports a wide range of inputs and interactions for designers, to be used in the moment; not only before printing, but anytime during production. We propose the design space of this digital fabrication paradigm, and outline methods and technical details with which researchers and practitioners can expand this space.","PeriodicalId":268751,"journal":{"name":"Proceedings of the 2nd Annual ACM Symposium on Computational Fabrication","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117202325","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
E. Moore, M. Porter, Ioannis Karamouzas, V. Zordan
This paper presents an exploration of computer-controlled embroidery design and stitching with the goal of making purposeful, precision changes to material properties of a base elastic textile. Two techniques are proposed for adding stitches through designed microstructural cells and stitch-level planning. For the latter, a novel path planning algorithm is proposed to serialize stitches that is similar to a greedy solution for the travelling salesman problem with a set of domain-specific constraints that dictate edge cost. We show the efficacy of the concept through a set of simple design examples that undergo mechanical load testing and discuss the value of the technique in future applications using computational design.
{"title":"Precision control of tensile properties in fabric for computational fabrication","authors":"E. Moore, M. Porter, Ioannis Karamouzas, V. Zordan","doi":"10.1145/3213512.3213514","DOIUrl":"https://doi.org/10.1145/3213512.3213514","url":null,"abstract":"This paper presents an exploration of computer-controlled embroidery design and stitching with the goal of making purposeful, precision changes to material properties of a base elastic textile. Two techniques are proposed for adding stitches through designed microstructural cells and stitch-level planning. For the latter, a novel path planning algorithm is proposed to serialize stitches that is similar to a greedy solution for the travelling salesman problem with a set of domain-specific constraints that dictate edge cost. We show the efficacy of the concept through a set of simple design examples that undergo mechanical load testing and discuss the value of the technique in future applications using computational design.","PeriodicalId":268751,"journal":{"name":"Proceedings of the 2nd Annual ACM Symposium on Computational Fabrication","volume":"47 33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126840010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Industrial knitting machines form fabric by manipulating loops of yarn held on hundreds of hook-shaped needles. Transfer planning algorithms generate a sequence of machine instructions that move loops between their current needles and given target needles. In this paper we describe how to compute the run-time cost of a transfer plan in terms of machine passes, and compare the plans generated by several existing and new transfer planning algorithms under this metric over a a large benchmarking set of transfer operations taken from example flat lace patterns, along with synthetically generated patterns.
{"title":"Efficient transfer planning for flat knitting","authors":"Jenny Lin, V. Narayanan, J. McCann","doi":"10.1145/3213512.3213515","DOIUrl":"https://doi.org/10.1145/3213512.3213515","url":null,"abstract":"Industrial knitting machines form fabric by manipulating loops of yarn held on hundreds of hook-shaped needles. Transfer planning algorithms generate a sequence of machine instructions that move loops between their current needles and given target needles. In this paper we describe how to compute the run-time cost of a transfer plan in terms of machine passes, and compare the plans generated by several existing and new transfer planning algorithms under this metric over a a large benchmarking set of transfer operations taken from example flat lace patterns, along with synthetically generated patterns.","PeriodicalId":268751,"journal":{"name":"Proceedings of the 2nd Annual ACM Symposium on Computational Fabrication","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133644605","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The recently revived interest in thin shell architecture demands an efficient method to quickly prototype non-developable surface models for design evaluation. This paper focus on improving the traditional papercraft technique of approximating smooth surfaces with discretised planar meshes. The necessary step to unfold strips of planar faces often creates many separate pieces. These pieces require tedious manual work in gluing and assembling them together. The addition of gluing tabs also results in an aesthetically unpleasing underside of the surface. This paper proposes a double-shell construction to overcome the challenges of edge jointing and eliminate the need for gluing tabs. A double-shell is created using two sets of unfolded planar strips that were split at different seams. When the two sides are folded and glued back together, the folded connections bridge the seams on another side and vice versa. Spray-on contact adhesive can be globally applied to the underside of each set, thereby speeding up the assembly process. Models of trimmed and untrimmed NURBS surfaces and triangular mesh surfaces are constructed using this method as demonstration. Quantitative and qualitative effect of model size and paper thickness are explored to provide baseline application parameters. As a result, this method allows anyone with a laser or drag knife cutter to rapidly create mesh models that are easy to assemble and aesthetically clean on both sides.
{"title":"Prototyping non-developable paper models without gluing tabs","authors":"Pok Yin Victor Leung","doi":"10.1145/3213512.3213513","DOIUrl":"https://doi.org/10.1145/3213512.3213513","url":null,"abstract":"The recently revived interest in thin shell architecture demands an efficient method to quickly prototype non-developable surface models for design evaluation. This paper focus on improving the traditional papercraft technique of approximating smooth surfaces with discretised planar meshes. The necessary step to unfold strips of planar faces often creates many separate pieces. These pieces require tedious manual work in gluing and assembling them together. The addition of gluing tabs also results in an aesthetically unpleasing underside of the surface. This paper proposes a double-shell construction to overcome the challenges of edge jointing and eliminate the need for gluing tabs. A double-shell is created using two sets of unfolded planar strips that were split at different seams. When the two sides are folded and glued back together, the folded connections bridge the seams on another side and vice versa. Spray-on contact adhesive can be globally applied to the underside of each set, thereby speeding up the assembly process. Models of trimmed and untrimmed NURBS surfaces and triangular mesh surfaces are constructed using this method as demonstration. Quantitative and qualitative effect of model size and paper thickness are explored to provide baseline application parameters. As a result, this method allows anyone with a laser or drag knife cutter to rapidly create mesh models that are easy to assemble and aesthetically clean on both sides.","PeriodicalId":268751,"journal":{"name":"Proceedings of the 2nd Annual ACM Symposium on Computational Fabrication","volume":"329 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133534695","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A predominant issue in the design and fabrication of highly non-convex polyhedral structures through self-folding, has been the collision of surfaces due to inadequate controls and the computational complexity of folding-path planning. We propose a method that creates linearly foldable polyhedral nets, a kind of unfoldings with linear collision-free folding paths. We combine the topological and geometric features of polyhedral nets into a hypothesis fitness function for a genetic-based unfolder and use it to map the polyhedral nets into a low dimensional space. An efficient learning strategy is used to optimize the fitness function to produce the optimal nets. We experimentally demonstrate that the proposed method can find linearly foldable nets for highly non-convex polyhedra with substantial complexity. The technique presented in the paper will provide a powerful tool to enable designers, materials engineers, roboticists, to name just a few, to make physically conceivable structures through self-assembly by eliminating the common self-collision issue. It also simplifies the design of the control mechanisms when making deployable shape morphing devices. Additionally, our approach makes foldable papercraft more accessible to younger children and provides chances to enrich their education experiences.
{"title":"Synthesis of fast and collision-free folding of polyhedral nets","authors":"Y. Hao, Yunhyeong Kim, Jyh-Ming Lien","doi":"10.1145/3213512.3213517","DOIUrl":"https://doi.org/10.1145/3213512.3213517","url":null,"abstract":"A predominant issue in the design and fabrication of highly non-convex polyhedral structures through self-folding, has been the collision of surfaces due to inadequate controls and the computational complexity of folding-path planning. We propose a method that creates linearly foldable polyhedral nets, a kind of unfoldings with linear collision-free folding paths. We combine the topological and geometric features of polyhedral nets into a hypothesis fitness function for a genetic-based unfolder and use it to map the polyhedral nets into a low dimensional space. An efficient learning strategy is used to optimize the fitness function to produce the optimal nets. We experimentally demonstrate that the proposed method can find linearly foldable nets for highly non-convex polyhedra with substantial complexity. The technique presented in the paper will provide a powerful tool to enable designers, materials engineers, roboticists, to name just a few, to make physically conceivable structures through self-assembly by eliminating the common self-collision issue. It also simplifies the design of the control mechanisms when making deployable shape morphing devices. Additionally, our approach makes foldable papercraft more accessible to younger children and provides chances to enrich their education experiences.","PeriodicalId":268751,"journal":{"name":"Proceedings of the 2nd Annual ACM Symposium on Computational Fabrication","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131649406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Proceedings of the 2nd Annual ACM Symposium on Computational Fabrication","authors":"","doi":"10.1145/3213512","DOIUrl":"https://doi.org/10.1145/3213512","url":null,"abstract":"","PeriodicalId":268751,"journal":{"name":"Proceedings of the 2nd Annual ACM Symposium on Computational Fabrication","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131376548","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：