Computing and Fabricating Multiplanar Models

被引:35
作者
Chen, Desai [1 ]
Sitthi-amorn, Pitchaya [1 ]
Lan, Justin T. [1 ]
Matusik, Wojciech [1 ]
机构
[1] MIT CSAIL, Cambridge, MA USA
基金
美国国家科学基金会;
关键词
Approximation algorithms;
D O I
10.1111/cgf.12050
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We present a method for converting computer 3D models into physical equivalents. More specifically, we address the problem of approximating a 3D textured mesh using a small number of planar polygonal primitives that form a closed surface. This simplified representation allows us to easily manufacture individual components using computer controlled cutters (e.g., laser cutters or CNC machines). These polygonal pieces can be assembled into the final 3D model using internal planar connectors that are manufactured simultaneously. Our shape approximation algorithm iteratively assigns mesh faces to planar segments and slowly deforms these faces towards corresponding segments. This approach ensures that the output for a given closed mesh is still a closed mesh and avoids introducing self-intersections. After this step we also compute the shape of polygonal connectors that internally hold the whole mesh surface. Both the polygonal surface elements and connectors can be manufactured in a single cutting pass. We validate the use of our method by computing and manufacturing a variety of textured polyhedral models.
引用
收藏
页码:305 / 315
页数:11
相关论文
共 36 条
[1]   Designing effective step-by-step assembly instructions [J].
Agrawala, M ;
Phan, D ;
Heiser, J ;
Hayrnaker, J ;
Klingner, J ;
Hanrahan, P ;
Tversky, B .
ACM TRANSACTIONS ON GRAPHICS, 2003, 22 (03) :828-837
[2]  
[Anonymous], 2007, P 18 ANN ACM SIAM S
[3]   Fast approximate energy minimization via graph cuts [J].
Boykov, Y ;
Veksler, O ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) :1222-1239
[4]   An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision [J].
Boykov, Y ;
Kolmogorov, V .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (09) :1124-1137
[5]  
Bridson R, 2002, ACM T GRAPHIC, V21, P594, DOI 10.1145/566570.566623
[6]   A comparison of mesh simplification algorithm [J].
Cignoni, P ;
Montani, C ;
Scopigno, R .
COMPUTERS & GRAPHICS-UK, 1998, 22 (01) :37-54
[7]  
Cohen J., 1998, Computer Graphics. Proceedings. SIGGRAPH 98 Conference Proceedings, P115, DOI 10.1145/280814.280832
[8]  
Cohen J., 1997, P 8 C VIS 97 LOS AL, p[395ff, 2]
[9]   Variational shape approximation [J].
Cohen-Steiner, D ;
Alliez, P ;
Desbrun, M .
ACM TRANSACTIONS ON GRAPHICS, 2004, 23 (03) :905-914
[10]  
Cutler Barbara, 2007, Proceedings Graphics Interface 2007, P11, DOI 10.1145/1268517.1268522