Mixed honeycomb pushing refinement

We generalize the honeycomb scheme, dualize it and combine both the primal and the dual scheme into self-dual subdivision schemes for convex polyhedra which generate surfaces without line segments different from the honeycomb scheme, which generates surfaces having line and even planar segments

Wire mesh design

We present a computational approach for designing wire meshes, i.e., freeform surfaces composed of woven wires arranged in a regular grid. To facilitate shape exploration, we map material properties of wire meshes to the geometric model of Chebyshev nets. This abstraction is exploited to build an efficient optimization scheme. While the theory of Chebyshev nets suggests a highly constrained design space, we show that allowing controlled deviations from the underlying surface provides a rich shape space for design exploration. Our algorithm balances globally coupled material constraints with aesthetic and geometric design objectives that can be specified by the user in an interactive design session. In addition to sculptural art, wire meshes represent an innovative medium for industrial applications including composite materials and architectural façades. We demonstrate the effectiveness of our approach using a variety of digital and physical prototypes with a level of shape complexity unobtainable using previous methods

Smooth Subdivision Surfaces: Mesh Blending and Local Interpolation

Subdivision surfaces are widely used in computer graphics and animation. Catmull-Clark subdivision (CCS) is one of the most popular subdivision schemes. It is capable of modeling and representing complex shape of arbitrary topology. Polar surface, working on a triangle-quad mixed mesh structure, is proposed to solve the inherent ripple problem of Catmull-Clark subdivision surface (CCSS). CCSS is known to be C1 continuous at extraordinary points. In this work, we present a G2 scheme at CCS extraordinary points. The work is done by revising CCS subdivision step with Extraordinary-Points-Avoidance model together with mesh blending technique which selects guiding control points from a set of regular sub-meshes (named dominative control meshes) iteratively at each subdivision level. A similar mesh blending technique is applied to Polar extraordinary faces of Polar surface as well. Both CCS and Polar subdivision schemes are approximating. Traditionally, one can obtain a CCS limit surface to interpolate given data mesh by iteratively solving a global linear system. In this work, we present a universal interpolating scheme for all quad subdivision surfaces, called Bezier Crust. Bezier Crust is a specially selected bi-quintic Bezier surface patch. With Bezier Crust, one can obtain a high quality interpolating surface on CCSS by parametrically adding CCSS and Bezier Crust. We also show that with a triangle/quad conversion process one can apply Bezier Crust on Polar surfaces as well. We further show that Bezier Crust can be used to generate hollowed 3D objects for applications in rapid prototyping. An alternative interpolating approach specifically designed for CCSS is developed. This new scheme, called One-Step Bi-cubic Interpolation, uses bicubic patches only. With lower degree polynomial, this scheme is appropriate for interpolating large-scale data sets. In sum, this work presents our research on improving surface smoothness at extraordinary points of both CCS and Polar surfaces and present two local interpolating approaches on approximating subdivision schemes. All examples included in this work show that the results of our research works on subdivision surfaces are of high quality and appropriate for high precision engineering and graphics usage

Graph Rotation Systems for Physical Construction of Large Structures

In this dissertation, I present an approach for physical construction of large structures. The approach is based on the graph rotation system framework. I propose two kinds of physical structures to represent the shape of design models. I have developed techniques to generate developable panels from any input polygonal mesh, which can be easily assembled to get the shape of the input polygonal mesh. The first structure is called plain woven structures. I have developed the ?projection method? to convert mathematical weaving cycles on any given polygonal mesh to developable strip panels. The width of weaving strips varies so that the surface of the input model can be covered almost completely. When these strip panels are assembled together, resulting shape resembles to a weaving in 3-space. The second structure is called band decomposition structures. I have developed a method to convert any given polygonal mesh into star-like developable elements, which we call vertex panels. Assembling vertex panels results in band decomposition structures. These band decomposition structures correspond to 2D-thickening of graphs embedded on surfaces. These band decompositions are contractible to their original graph. In a 2D-thickening, each vertex thickens to a polygon and each edge thickens to a band. Within the resulting band decomposition, each polygon corresponds to a vertex and each band corresponds to an edge that connects two vertex polygons. Since the approach is based on graph rotation system framework, the two structures do not have restrictions on design models. The input mesh can be of any genus. The faces in the input mesh can be triangle, quadrilateral, and any polygon. The advantages of this kind of large physical structure construction are low-cost material and prefabrication, easy assemble. Our techniques take the digital fabrication in a new direction and create complex and organic 3D forms. Along the theme of architecture this research has great implication for structure design and makes the more difficult task of construction techniques easier to understand for the fabricator. It has implications to the sculpture world as well as architecture

Surface parameterization over regular domains

Surface parameterization has been widely studied and it has been playing a critical role in many geometric processing tasks in graphics, computer-aided design, visualization, vision, physical simulation and etc. Regular domains, such as polycubes, are favored due to their structural regularity and geometric simplicity. This thesis focuses on studying the surface parameterization over regular domains, i.e. polycubes, and develops effective computation algorithms. Firstly, the motivation for surface parameterization and polycube mapping is introduced. Secondly, we briefly review existing surface parameterization techniques, especially for extensively studied parameterization algorithms for topological disk surfaces and parameterizations over regular domains for closed surfaces. Then we propose a polycube parameterization algorithm for closed surfaces with general topology. We develop an efficient optimization framework to minimize the angle and area distortion of the mapping. Its applications on surface meshing, inter-shape morphing and volumetric polycube mapping are also discussed

The soft grid

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Architecture, 2011.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Cataloged from student submitted PDF version of thesis.Includes bibliographical references (p. 99-101).The grid in architecture is a systematic organization of space. The means that architects use to organize space are, almost by definition, rigid and totalizing. The Cartesian grid, which will serve as the antagonist of the soft grid, is geometrically and topologically unyielding on both the local and global scales. There are, however, alternatives to such hard grids. Through a series of studies, this thesis will catalog and analyze the soft girds, i.e. those that are adaptive, variable, scalable, asymmetrical and entropic. Computational tools in architecture have, in recent years, enabled designers to manage geometries that until now have been realizable only by analog means. The instrumental capacity for complex designs has lead to increased demand for soft gridding systems as is evidenced by the profusion of Voronoi diagrams, pixelations, distorted grids and Danzer tilings in student and conceptual work. However, the built scale of such projects is rarely beyond installation largely because of the difficulty in managing spatial organizations that are not essentially Cartesian. Th is thesis will lay the groundwork for a systematic understanding of the possibilities of soft grids while providing much of the computational tools to generate and manage specific examples.by Ari Kardasis.S.M

Quad Dominant 2-Manifold Mesh Modeling

In this dissertation, I present a modeling framework that provides modeling of 2D smooth meshes in arbitrary topology without any need for subdivision. In the framework, each edge of a quad face is represented by a smooth spline curve, which can be manipulated using edge vertices and additional tangential points. The overall smoothness is achieved by interpolating all four edges of any given quad across the quad surface. The framework consists of simple quad preserving operations that manipulate the principal curves of the smooth model. These operations are all variants of a generic “Curve Split" and its inverse, “Region Collapse". By only using these sets of simple operations, it is possibly to model any desired shape conveniently. I also provide implementation guidelines for these operations. In the results of this dissertation, I present three main applications for this modeling framework. The major application is modeling Mock3D shapes; shapes with well defined interior normals by interpolating the normals at the boundaries of the shape across its surface which can serve as a mock 3D model to mimic a 3D CGI look. As a second application, the framework can be used in origami modeling by allowing assignment of crease patterns across the surface of 2D shapes modelled. Finally, vectorization of reference photos via modeling figures by following their contours is presented as a third application

Non-linear subdivision of univariate signals and discrete surfaces

During the last 20 years, the joint expansion of computing power, computer graphics, networking capabilities and multiresolution analysis have stimulated several research domains, and developed the need for new types of data such as 3D models, i.e. discrete surfaces. In the intersection between multiresolution analysis and computer graphics, subdivision methods, i.e. iterative refinement procedures of curves or surfaces, have a non-negligible place, since they are a basic component needed to adapt existing multiresolution techniques dedicated to signals and images to more complicated data such as discrete surfaces represented by polygonal meshes. Such representations are of great interest since they make polygonal meshes nearly as exible as higher level 3D model representations, such as piecewise polynomial based surfaces (e.g. NURBS, B-splines...). The generalization of subdivision methods from univariate data to polygonal meshes is relatively simple in case of a regular mesh but becomes less straightforward when handling irregularities. Moreover, in the linear univariate case, obtaining a smoother limit curve is achieved by increasing the size of the support of the subdivision scheme, which is not a trivial operation in the case of a surface subdivision scheme without a priori assumptions on the mesh. While many linear subdivision methods are available, the studies concerning more general non-linear methods are relatively sparse, whereas such techniques could be used to achieve better results without increasing the size support. The goal of this study is to propose and to analyze a binary non-linear interpolatory subdivision method. The proposed technique uses local polar coordinates to compute the positions of the newly inserted points. It is shown that the method converges toward continuous limit functions. The proposed univariate scheme is extended to triangular meshes, possibly with boundaries. In order to evaluate characteristics of the proposed scheme which are not proved analytically, numerical estimates to study convergence, regularity of the limit function and approximation order are studied and validated using known linear schemes of identical support. The convergence criterion is adapted to surface subdivision via a Hausdorff distance-based metric. The evolution of Gaussian and mean curvature of limit surfaces is also studied and compared against theoretical values when available. An application of surface subdivision to build a multiresolution representation of 3D models is also studied. In particular, the efficiency of such a representation for compression and in terms of rate-distortion of such a representation is shown. An alternate to the initial SPIHT-based encoding, based on the JPEG 2000 image compression standard method. This method makes possible partial decoding of the compressed model in both SNR-progressive and level-progressive ways, while adding only a minimal overhead when compared to SPIHT

Modeling high-genus surfaces

The goal of this research is to develop new, interactive methods for creating very high genus 2-manifold meshes. The various approaches investigated in this research can be categorized into two groups -- interactive methods, where the user primarily controls the creation of the high-genus mesh, and automatic methods, where there is minimal user interaction and the program automatically creates the high-genus mesh. In the interactive category, two different methods have been developed. The first allows the creation of multi-segment, curved handles between two different faces, which can belong to the same mesh or to geometrically distinct meshes. The second method, which is referred to as ``rind modeling'', provides for easy creation of surfaces resembling peeled and punctured rinds. The automatic category also includes two different methods. The first one automates the process of creating generalized Sierpinski polyhedra, while the second one allows the creation of Menger sponge-type meshes. Efficient and robust algorithms for these approaches and user-friendly tools for these algorithms have been developed and implemented