Building Construction Sets by Tiling Grammar Simplification
نویسندگان
چکیده
This paper poses the problem of fabricating physical construction sets from example geometry: A construction set provides a small number of different types of building blocks from which the example model as well as many similar variants can be reassembled. This process is formalized by tiling grammars. Our core contribution is an approach for simplifying tiling grammars such that we obtain physically manufacturable building blocks of controllable granularity while retaining variability, i.e., the ability to construct many different, related shapes. Simplification is performed by sequences of two types of elementary operations: non-local joint edge collapses in the tile graphs reduce the granularity of the decomposition and approximate replacement operations reduce redundancy. We evaluate our method on abstract graph grammars in addition to computing several physical construction sets, which are manufactured using a commodity 3D printer.
منابع مشابه
Construction and Simplification of Bone Density Models
This paper presents a hierarchical tetrahedral mesh model to represent the bone density atlas. We propose and implement an efficient and automatic method to construct hierarchical tetrahedral meshes from CT data sets of bony anatomy. The tetrahedral mesh is built based on contour tiling between CT slices. The mesh is then smoothed using an enhanced Laplacian algorithm. And we approximate bone d...
متن کاملFixed-point tile sets and their applicationsI
An aperiodic tile set was first constructed by R. Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many fields, ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). We present a new construction of an aperiodic tile set that is based on Kleene’s fixed-point construction instead of geometric arguments. This const...
متن کاملTiling Problems A.1 Introduction
In this appendix, we prove the undecidability of the following problems: the constrained domino problem (proved undecidable by Wang): give a tile set and a tile as input, ask whether it is possible to form a tiling of the plane containing the given tile; the unconstrained domino problem (Berger's Theorem): the input is a tile set and the question is whether one can tile the plane with it; the p...
متن کاملFixed-point tile sets and their applications
An aperiodic tile set was first constructed by R. Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many fields, ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). We present a new construction of an aperiodic tile set that is based on Kleene’s fixed-point construction instead of geometric arguments. This const...
متن کاملMolecular Tiling and DNA Self-assembly
We examine hypotheses coming from the physical world and address new mathematical issues on tiling. We hope to bring to the attention of mathematicians the way that chemists use tiling in nanotechnology, where the aim is to propose building blocks and experimental protocols suitable for the construction of 1D, 2D and 3D macromolecular assembly. We shall especially concentrate on DNA nanotechnol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 35 شماره
صفحات -
تاریخ انتشار 2016