Polyhedral Meshes (PM’s) have gained popularity in recent years due to several new methods that render their construction relatively easy. Typically, a designer creates a traditional free-form surface and then applies a meshing scheme that generates an approximating mesh consisting of only planar faces. Of course, the focus of these schemes, e.g. [14, 27], is to generate good approximations, and this is done using very specific (regular) types of mesh topologies. It may well be that these are the only topologies that can approximate general smooth surfaces well. However, the topology of the mesh itself has its own artistic value: a triangular meshing of a surface will not have the same ”look” as a quad or hex meshing. Yet, as mentioned, the cases where a smooth surface can be faithfully meshed into a PM are limited. Hence, we propose a different strategy: instead of constructing the final PM based on a design of a surface, we explore the space of possible PM’s with a given topology. Such a PM is called a realization of the topology.
Our approach is based on the observation that the complicated manifold of PM’s with a given topology can be decomposed into overlapping, linear spaces, each of which is maximal - adding a base PM to the space will introduce non-PMs to the space. The advantage of linear spaces lies in the simplicity of exploring them: PM’s in such a space may be designed by forming linear combinations of a spanning set of basic PM’s. The disadvantage is that the dimensionality of these spaces is much smaller than that of the complete manifold of PM’s. Thus, proving that they are indeed maximal is crucial. By switching between spaces, it is possible to reach any PM in the manifold. We will refer to the PM’s of a spanning set simply as shapes.
The use of linear spaces can be incorporated into well-known mesh deformation methods, such as as-rigid/similar-as-possible . In addition, we propose three types of shapes aimed at different levels of design, exposing the possibilities and limitations for deforming a given PM; the reason for their names will subsequently become clear. Eigenshapes are globally smooth shapes at different frequencies
akin to the eigenvectors of the Laplacian.Sparse shapes are based on the smallest groups of vertices that can move together without impairing the planarity of the faces of the PM. Finally, fundamental shapes allow a single vertex to be moved with minimal change to other vertices while preserving planarity.
1.1 Related work
Meshing and Planarization. The creation of polyhedral meshes is an active field of research. The most common problem is to mesh, or remesh, a free-form into a PM. The approach used by Cohen-Steiner et al.  is to try to fit a limited number of planes to the surface and then intersect them. The surface is first partitioned into a user-defined number of almost flat regions, for each of which a plane is fitted. These planes, called shapes proxies, will generally not have well-defined intersection points. Thus, the faces they produce are only close to being planar. Cutler and Whiting  added an iterative optimization process to the algorithm that guarantees that the resulting faces are planar.
In both of these systems, the user can control the number of faces and their density in the result, but cannot dictate the mesh topology (its edge structure), which can essentially be arbitrary. While this is not necessarily a drawback, in some cases a regular mesh is desirable. Liu et al.  and Wang et al.  showed how a surface may be meshed into a planar quad-dominant (PQ) mesh and a planar hexagonal (P-Hex) mesh, respectively. The two algorithms are quite similar: an almost polyhedral mesh is first generated from the surface, based on differential geometric entities (PQ meshes are based on conjugate networks and P-Hex meshes on the Dupin indicatrix.  and  elaborated on how to design better conjugate networks.) A subsequent step involves the planarization of the result: a non-linear optimization, where the vertices of the mesh are repositioned to make the faces planar. This latter step seems to dominate the runtime, and does not scale well with mesh size. Alexa and Wardetzky  demonstrated the construction of a Laplacian operator on non-triangular meshes. As a side effect of their construction, they were able to devise a related operator that measures the planarity of faces. With this new operator, they obtained a planarizing flow, that is, a geometric flow that flattens faces. In , a local/global based alternating algorithm was used to solve the planarization problem very efficiently. The improved performance enables interactive deformation of PM’s.
Mesh deformation. The problem of editing and deforming mesh geometry is one of the most studied topics in geometry processing. Most mesh deformation methods are intended to work exclusively with triangle meshes. See 
for a thorough introduction. These methods may be classified into two types, based on the type of user interaction employed. In the first type, the user directly modifies the surface using one of a number of common design metaphors. The most relevant to us are the handle-based methods (e.g.[2, 11, 20, 19]), where the user controls the deformation by moving a small number of points on the mesh. These points generate constraints for an optimization problem, whose solution is the deformed mesh. Other common design metaphors are skeleton-based and cage-based. Jacobson et al.  noted the differences between these methods and provided a hybrid method incorporating both. More intricate approaches for mesh deformation use direct control of the mesh normal and curvature instead of vertex positions [8, 7].
Handle-based deformation has also been used in the context of PM’s. In , the manifold of polyhedral meshes was discussed in detail. The idea was to approximate this manifold by an osculant, which is much easier to explore. In this framework, deformation of a PM using positional constraints was made possible; however, computing the osculant is time-consuming and the deformation only approximately preserves the planarity of faces.  uses the same technique to derive a curve-based deformation.
Recently, Vaxman 
described a linear space of PM’s by allowing affine transformations per face. In this work, it was proposed to use it instead of the entire manifold, simplifying the math considerably. In fact, this linear space is a special case of the linear spaces to be described in this paper. The main drawback of using this space is its small number of degrees of freedom (dimension). For example, the number of degrees of freedom of a quad PM is about half the size of its boundary, so when the mesh has no boundary, only the trivial, global, transformations are possible (e.g. global rotations). Hexagonal PM’s will have only 12 degrees of freedom, regardless of the existence of a boundary. In other words, specifying the geometry of 4 vertices of a PM with hexagonal topology uniquely determines the rest of the PM. Pottmann et al. described another linear space of PM’s, called parallel meshes. It is also a special case of the spaces to be described in this paper.
A second type of mesh deformation is indirect. These include various methods that improve the quality of a mesh, such as smoothing and enhancing features. More relevant to us are methods that are used to add variation to a mesh, or to create a collection of meshes based on a single mesh (e.g. ). ) has also contributed an indirect deformation approach, by designing a user interface which allows to traverse the osculant with ease. In this paper we propose eigenshapes as a way of indirectly adding variation to a PM.
1.2 Contribution and overview
In Section 2 we discuss linear subspaces of PM’s in detail. We characterize all of the possible maximal subspaces, and show how to construct them. In Section 3 we describe a number of meaningful sets of shapes for editing PM’s. In section 4 we discuss practical consideration and limitations.
2 Linear Subspaces of Polyhedral Meshes
Preliminaries. In our context, a mesh is defined by a list of vertex geometry and a list of faces. The vertex geometry can be arranged in a matrix, where is the number of vertices. We will usually denote this matrix by an upper-case letter, such as or . In other words, the vertex geometry is given by
are column 3-vectors. We denote bythe set of faces of the mesh, where each face is described as an ordered (oriented) list of vertices. In most cases, will be common to several meshes, and we will refer to them only by their matrices. Finally, we will denote the vertex coordinates of the face , which is a submatrix of , by .
Manifolds of Meshes. When two meshes have the same topology, their linear combination can be defined simply as a linear combination of their vertex geometries. In other words, two meshes and span a linear subspace of meshes defined by
We can consider the set of all meshes with n vertices and a given topology to be vectors in . Obviously, the dimension of this space is and is isometric to .
Linearly combining two meshes is meaningful because the set of all possible meshes (with a given topology) is a linear space. PM’s, on the other hand, reside in a complicated, curved submanifold in this space. Linearly combining two PM’s will usually not result in a PM, which is the cause of many of the problems in using them. It so happens that the manifold of PM’s may be covered by linear submanifolds, which we discuss next. By replacing the non-linear constraints defining the manifold of PM by linear ones, many of the problems related to PM design disappear. We emphasize two important points. First, the dimensions of the linear subspaces are much less than . Hence, making sure that they are maximal is crucial. Second, the set of linear subspaces must cover the submanifold of PM’s in such a way that any PM will be reachable from any other PM by moving through those linear spaces alone.
Linear Spaces. To investigate the linear subspaces of PM’s we first examine the linear subspaces of much simpler entities: planar polygons; they are simply PMs with a single face, so we can use the same notation. We will further simplify the discussion by assuming that the polygons are geometrically centered at the origin. This is not detrimental to the generality of the arguments, since centering is a linear operation. In addition, we will assume that the polygons are not degenerate. While degenerate polygons have a place in this theory, they do not appear in practice, and therefore cause an unnecessary complication.
Let and be two matrices representing the geometry of two planar k-gons in with vertices, centered at the origin. Let and be the unit row vectors normal to the planes defined by and respectively. Then and span a linear subspace of planar polygons iff at least one of the following holds:
Relationship of type 1: is an affine transformation of for some matrix .
Relationship of type 2: for some scalar .
: By definition,
where 0 is a zero k-vector. Assume that and span a linear subspace of planar polygons. This implies that every linear combination of them defines a plane and thus has a normal vector. In other words, for each and , there exists a vector such that
Consider the set of vectors . First, assume that it has dimension 3. Then there exist such that the ’s are not collinear. By (3), we can write
where is a matrix whose rows are . is defined similarly. Since the ’s are independent, we can invert . Hence, is an affine transformation of , which is type 1.
If the set of normals has dimension less than 3, then this set must be spanned by and . Thus, we can write (2) as
Expanding the LHS and using (1) we obtain
which, noting that is a constant, is the relationship of type 2. In the other direction, first, if and are planar and is an affine transformation of (type 1 relationship) then the rank of each of the matrices and is 2 and there exists a matrix such that . Hence, their combination
has and thus is planar.
Second, if and are planar and for some scalar (type 2 relationship), then for any scalars and we can choose and such that . Working our way backwards, this implies that
concluding that and spans a linear subspace of planar polygons.
The following corollaries follow immediately:
Corollary 1: If and are parallel planar polygons, then they span a linear subspace of planar polygons.
Corollary 2: if and are planar polygons not related by any affine transformation, yet they span a linear space of planar polygons, then the normals of their linear combinations must be linear combinations of their normals.
Using Theorem 1, it is simple to prove an analogous result for PM’s:
Let and be two PM’s in with common topology. Then and span a linear space of PM’s iff each non-triangular face of has a type 1 or type 2 relationship with the corresponding face of .
Generating subspaces. Our goal is to explore the linear subspaces of PM’s which contain a given PM, but first we need to characterize those linear subspaces. We say that a PM generates a linear subspace if that subspace contains . Given a linear subspace of PM’s generated by , Theorem 2 tells us that the relationship of each face of any to the corresponding face of must be either of type 1 or type 2. Therefore, we can generate a subspace from by first specifying, for each face of Y, which type of relationship applies, and then finding all possible that are related to in that way.
In practice, we can treat each face of as a separate planar polygon, and write a linear system for ,
where the matrix depends on and the type of relationship, and is a vectorization of the matrix . We can combine all of the small linear systems into one large linear system
and the solution space of this system, namely, the nullspace of , is exactly . The matrix may also be used since they share the same null space. We remark that can be normalized to give a Laplacian-like operator. This operator may be related to yet another differential operator described in Appendix 1, but we have yet to pursue this connection.
To construct we consider each type of relationship separately. A relationship of type 1 means that must be an affine transformation of . Thus must satisfy
As for a relationship of type 2, we start by examining its definition, . Given , the normal is also given and so we are left with , and as variables. Based on , we can further divide this into 2 sub-cases:
. In this case, we simply have,
. Note that in this case the (column) vector is in the intersection of the planes of and . We have the following decomposition for and ,
where and , and ,, are row vectors with an element for each vertex. Thus and , and the relationship of type 2 implies
which means that . We apply the cross product by to both sides to get
Let be the null space of , i.e. . We finally have that , which can also be written in the form (3). This means that in order to generate a linear subspace based on a relationship of type 2, we must first prescribe the normal or equivalently, .
Thus given a planar polygon, we can generate 3 types of linear subspaces of planar polygons. We now proceed to prove that each type of space generated for a face is maximal. Again we start with the simpler case of planar polygons.
Let be a linear subspace generated by a (non-degenerate) polygon , where is constructed as described above. Then is a maximal linear subspace of planar polygons.
First, assume that is the space of all affine transformations of . Let be a planar polygon such that . Then and must have a relationship of type 2: . We can assume w.l.o.g that and are not collinear. Let be a rotation matrix around . Then and . This implies that , or . Hence and are collinear. However, and are also collinear and this in turn means that and are collinear. Thus we have a contradiction.
The second part of the proof is subdivided to two cases. First, let be the space of all polygons which are parallel to and define similarly. cannot be related to all polygons in by an affine transformation, so assume w.l.o.g. that and have the relationship of type 2. Then applying the same rotation of strategy used previously we reach contradiction again.
Finally, we consider the case where is the space of all polygons with type 2 relationship to . To define this space we need to set another vector in the plane of , which is shared among the planes of all polygons in this space. Again, has w.l.o.g. a relations ship of type 2 to . cannot contain since by construction it would mean that . This means that there is another vector that the planes of and share. The vertices of are free to move in the direction of , and the new polygon will still be in . cannot hold a relationship of type 2 with (since and are different) and can be chosen so it will not be an affine transformation of , and we reach contradiction yet again.
In reality, to avoid having to specify an explicit normal for each face having a relationship of type 2, we used three cases when specifying relationships types for faces. The first case, which we call the affine case, is simply when all faces have type 1 relationship. In the second case, the target face normal was chosen to be identical to the source normal. The subspace generated by this case is that of all polygons which are parallel to the source polygons, hence, the parallel case. In the third case, the vertical case, all the face normals were set to the up (vertical) vector. The justification for this is the fact that many meshes, especially architectural meshes, have a prominent up direction.
Theorem 3 tells us that the construction of linear subspaces of PM’s can produce all the maximal linear subspaces. However, some linear subspaces constructed that way may not be maximal. This can happen when the constraints imposed on a face by other faces, and its own linear subspace, cause it to be in another linear subspace. For example, the red cube in Fig. 4 was deformed in the parallel subspace. In this space, each face can only be stretched in the obvious directions, which is a subset of the affine transformations of the face. Thus, the parallel subspace in that case is not maximal, since it is contained in the affine subspace. Note that by removing a single face from the cube, the linear subspaces become different. These situations are easily detectable, and the face can be reassigned. However, in our experiments we rarely encountered such situations.
It is now easy to show that there is a piecewise linear path between any two PM’s in the manifold: using the affine space generated by the two meshes, they can be projected to the same plane, where they share the parallel space. This construction however is not very useful as it does not provide any insight into the manifold itself. Nevertheless, it forms a loose ”lower bound”.
In our examples, the relationship types per face were color coded by blue, red and green for the affine, parallel and vertical cases, respectively. When more than a single relationship type is used to generate the subspace, it is referred to as a mixed space. We note here that in the case of the affine and vertical spaces, can be separated to three identical matrices, operating on , and separately. Exploiting this, the performance of the algorithms presented in the next section can be significantly improved.
Degrees of freedom. The number of degrees of freedom (NDOF) of a linear subspace of PM’s is exactly the dimension of the nullspace of
. We can estimate the NDOF in some specific cases, such as when the space is not mixed. The NDOF is then exactly the co-rank of. However, this value depends too much on the current embedding of the PM and does not give any insight into the relation to its topology. We instead provide a lower bound on the NDOF for a given PM, which can be inferred from the topology alone.
Denote by ,,,, the number of vertices, boundary vertices, edges, faces and corners of the PM, respectively. The number of variables (the mesh vertex geometry) is always . In the affine case, the number of equations is , but each face is determined by just three vertices. Hence a lower bound on the NDOF is . Similarly, in the parallel case the lower bound is , and in the vertical case it is .
We can use the generalized Euler formula, , where is the number of boundaries, and is the genus of the mesh, and the fact that to obtain
Plugging this into the formulas for the NDOF yields an expression that does not depend on and . For (semi-) regular graphs, can also be expressed using and and vice-versa, which may give more intuitive results. Additionally, we define the number of free vertices (NFV) as the NDOF divided by 3. The NFV roughly gives the number of vertices that can be fixed independently. We list the minimal NVF for quad and hex meshes for both cases in Table 1.
The table shows that the minimal NFV for quad meshes in the affine and parallel cases is determined by the size of the boundary. In fact, our experiments show that, apart from very symmetric cases like spheres or tori, the minimal NFV for the affine case is the true NFV, up to a global transformation. This means that there is very little that can be done with closed quad meshes in the affine case. The situation is even worse for hex meshes: unless the mesh is just a strip of hexagons, the minimal NFV will be negative.
In fact, we prove in Appendix 2 that the actual NFV is 3 for any 3-regular mesh without a boundary. A trick that can be used to increase the NFV is to apply a half-edge subdivision to the hex mesh (see inset). Technically, the new mesh will not be a hex mesh, but it might retain the ”look” of the original hex mesh, and the minimal NFV will be much higher. As for the parallel case, it is easy to show that for closed 3-regular PM’s, the NFV is exactly .
|Quad mesh||Hex mesh|
3 Exploring Linear Subspaces
Overview. Once all faces of the mesh have relationship types assigned to them and the matrix is computed, we can begin the exploration of . While we can do this by simply computing an orthogonal basis for , it may not be very useful: this basis will contain random PM’s. Instead, we discuss ways to create more meaningful shapes, which are targeted toward different levels of editing.
Eigenshapes.  proposed to explore the manifold of PM’s not by explicitly setting positional constraints, but by traversing the neighborhood of the PM. This is done by choosing a few directions (two or three for easy navigation) on the osculant which match the manifold the best. Using linear subspaces, we do not have to worry about going far away from the manifold, which allows us to be more adventurous with the exploration. We propose using the PM’s ”harmonics” as a basis for exploration. More precisely, we use the eigenvectors of the Laplacian constrained to the linear space, which we call eigenshapes. These are defined by the constrained Rayleigh quotient:
The solution to this problem is found in  as the eigenvectors of where . See implementation details in Section 4 on how to compute the eigenshapes efficiently. To effectively visualize the eigenshapes and to explore them efficiently, we suggest the following idea: add the eigenshapes to the source PM and apply a ”band-pass-filter” to it. By sliding the filter we can quickly see how eigenshapes of different frequencies affect the PM (Fig. 11)
Sparse shapes. Habbecke and Kobelt  discussed editing of constrained meshes, where their goal was to be able to reposition a vertex while making as little as possible change to the rest of the mesh and satisfy the constraints. This addresses the well-known problem of editing with constraints, where making a change in one portion of a mesh damages the work that was already done elsewhere in the mesh. Their approach is based on linearizing the constraints and finding sparse solutions to the linearized system. The same strategy can be used to deform PM’s and in fact, one of the constraints treated in  is the planarity of faces. In terms of basic shapes, in order to be able to move just a small set of vertices, a shape where most of the vertices lie on the origin is needed. These sparse shapes are just sparse vectors in . To find sparse solutions, Habbecke and Kobelt employ the Orthogonal Matching Pursuit (OMP) algorithm , and the same can be done to find sparse shapes.
For many subspaces, the only sparse shapes that can be found are not sparse at all. For example, the affine space for quad meshes contains truly sparse shapes only for very symmetric cases (Fig. 5). In these cases approximate sparse shapes - shapes that are not in the linear subspace but close to it - can be found instead. For comparison, the accurate sparse shape in the middle of Fig. 6 has , and the approximate sparse shape has . The original PM was produced by planarizing a deformed torus, which had .
Fundamental shapes. While a sparse shape changes only a small number of vertices, it can still be non-local, moving vertices on opposite sides of the PM. In many cases a shape with more locality is required; one that perhaps moves all vertices, but to a lesser extent. To elaborate, suppose a vertex has been selected. We may then define the fundamental shape associated with as the solution to the optimization problem
where is a vector whose only non-zero elements are the ones corresponding to and is a regularization term. Of course, both the distance function and the regularization terms can be replaced by other similar functions.
. PM’s can be deformed directly, and the handle-based approach is probably the most natural metaphor to use (excluding, perhaps, the recent curve-based approach). This was studied in detail in  and  for the case of PM’s in the affine case only, where an As-Rigid/Similar-As-Possible (ARAP/ASAP) deformation was computed within the resulting subspace. The well-known solution to the ARAP/ASAP deformation problem uses an alternating local/global scheme [13, 20]. The only difference when applying this to PM’s is that the constraints defining the linear subspace must be satisfied when solving the global steps. In Fig. 7 we used the same method as in  to deform in an ASAP way a half sphere hex mesh in the non-mixed spaces. The boundary was kept fixed and one vertex on the top was moved slightly higher. The affine subspace allows only global transformations and the parallel subspace produced self-intersections almost immediately. The vertical subspace produced pleasing, nontrivial results.
Dual exploration. Every polyhedron admits a family of dual polyhedra, most notably the polar dual , having the property that the vector to each of the dual vertices is parallel to the corresponding primal face. Usually polar duals are associated only with star-shaped polyhedrons, since otherwise the polar dual may self-intersect. Here we ignore this and associate polar duals with general, non-convex PM’s. Obviously the polar dual associated with a PM is itself a PM, so the ideas presented in this paper apply also to the space of polar duals to a given PM. This essentially means that we can explore the subspace of the PM based on its face normals instead of the vertex positions. Although the subspaces defined using the face normals are linear, since they are the same as the linear spaces of polar duals, they are not linear with respect to the vertices of the primal mesh. The reason is that the duality transformation is not linear. Still, it involves only solving a sparse linear system and can be done in real time.
The benefit of dual exploration of PM subspaces is that this gives a completely different number of DOFs compared to the primal space, based on the normal of the faces instead of the vertices. As an extreme example, the duals of any 3-regular meshes are triangle meshes, which trivially preserve planarity. Hence, editing a 3-regular mesh in the normal domain is also trivial: any choice of normal will result in a valid PM. Fig. 9 shows the dual deformation of two PM’s. The results there could not have been achieved using only one primal linear space.
4 Discussion and Future Work
Implementation details. Most of the software implementation was done in MATLAB, and was wrapped as a plugin for Autodesk Maya, for its user interface. The matrix was built by constructing face-by-face. as defined here is already not full rank, so we reduced the number of equations per-face using SVD. The construction takes less than a second for meshes with approximately a thousand faces.
To compute the eigenshapes, a sparse QR decomposition was used to generate an orthonormal basisof , then any in can be written as for some , and
which is solved using the eigendecomposition of . This approach gives much better precision and performance than the formula in 
, since pseudoinverse computation is avoided and full size singular value decomposition is replaced with a much smaller eigenvalue decomposition. For the handle-based deformation, the relevant matrices were decomposed in a preprocessing step. We did not invest much effort to use the best possible decomposition and carefully tune the parameters. Specifically, we used LDL decomposition for the initial mesh approximation step, but a sparse QR decomposition for the global steps in the ARAP/ASAP deformation, due to numerical instabilities caused by LDL there.
Limitations. Our assumption is that the initial PM has planar faces. Otherwise, many of the calculations made are not well-defined. Of course, the planarity of faces can only be up to some numerical precision. We have found that the affine case is less sensitive to non-planar faces than the other cases. The mesh in Fig. 11 does not have planar faces, yet the eigenshapes computed for it in the affine space do not cause them to be ”less” planar. On the other hand, the eigenshapes of the parallel case (not shown) quickly deteriorate the quality of the mesh.
Creating an initial PM. The linear subspaces described here need an initial PM realizing a given topology to be generated from. The simplest way to generate such a PM is to take a non-polyhedral mesh with the given topology and project it to a plane. The original mesh can then be projected into a linear space generated from the flat mesh. The result of this, however, is usually unsatisfactory and we did not use it. Most of the PM’s in this paper were created by experimenting with the TopMod 3.0 software , where we used the variety of subdivision schemes implemented there to create elaborate meshes from simple solids. If only the mesh topology is given, then a simple ”spring-based” embedding, such as Tutte’s , should suffice.
Selecting the Right Space. There are, literally, an uncountable number of linear subspaces available for a single PM. Even if we limit ourselves to the three cases mentioned above, the number of possibilities to assign them to faces is exponential and manually assigning them is tedious. We did not investigate methods to find the optimal linear subspace to work with, or even attempt to define what exactly optimal means. A simple definition could be: the subspace with the highest dimension. Experimentally we observed that in many cases the parallel space had the largest dimensional. However, this subspace does not generate much visual variation in the overall look of the PM, compared to the other spaces. This problem remains open for now, and we reserve it for future work. In practice, switching between the non-mixed cases provided sufficient variation.
Currently we use a number of heuristics while experimenting with our system. The affine space is easier to work with when there are many DOFs, as is the case for quad meshes with boundaries. In situations where the number of DOFs is too small, this is usually caused by faces with more than four edges or vertices of degree three. These can be automatically reassigned to the other two cases to achieve more freedom. On the other hand, when using the parallel or the third case, some faces may enjoy too much freedom and misbehave while deforming. These can be reassigned to the parallel case, since it better preserves the shape of a polygon.
A related problem is how to interpolate PM that are not related by a single linear space. We have shown that any two can be connected by a succession of three linear spaces, which is not very useful for interpolation. An interesting thing to try is to approximate paths in the manifold of PM’s by linear segments using the linear subspaces.
Design pipeline. Our experiments led us to the following pipeline for designing a PM. It is important to remember that we are mere computer scientists, and not artists. For flat meshes, the first step is to afford them some height. This is done by regular deformation followed by a planarization step, or by using the affine linear subspace and applying the handle-based deformation or using the eigenshape band-pass-filter technique. The reason for not using the parallel or vertical subspaces is that they cannot ”unflatten” the PM. However, mixed spaces can also be used. Once we have a PM with some volume, the rest depends on the effect we aim to achieve. For large deformations we use the affine subspace when working on quad meshes with boundaries, and the other subspaces otherwise. To add variation or waviness to the PM, we use the eigenshapes. The affine eigenshapes are useful when the overall look of the PM needs to be maintained but the shapes of individual faces need to be changed. Using the parallel eigenshapes is an efficient way of adding variation to meshes having uniformly-sized faces. We show a variety of results in Figs. 9, 10, 11 (see also the accompanying video).
The sparse and fundamental shapes, while helping to visualize the limitations of various subspaces, have not proven very useful for the design process. The reason is that, by definition, they can only make the PM less smooth, which usually means less visually pleasing. However, we believe they are valuable as a theoretical tool for studying PM’s. One future research direction could be to use them to decide where to make small adjustments to the topology of the mesh in order to add more freedom to specific places.
-  M. Alexa and M. Wardetzky, “Discrete laplacians on general polygonal meshes,” New York, NY, USA, pp. 102:1–102:10, 2011. [Online]. Available: http://doi.acm.org/10.1145/1964921.1964997
-  M. Ben-Chen, O. Weber, and C. Gotsman, “Variational harmonic maps for space deformation,” ACM Trans. Graph., vol. 28, no. 3, pp. 34:1–34:11, Jul. 2009. [Online]. Available: http://doi.acm.org/10.1145/1531326.1531340
-  M. Botsch, L. Kobbelt, M. Pauly, P. Alliez, and B. uno Levy, Polygon Mesh Processing. AK Peters, 2010.
-  D. Cohen-Steiner, P. Alliez, and M. Desbrun, “Variational shape approximation,” in ACM SIGGRAPH 2004 Papers, ser. SIGGRAPH ’04. New York, NY, USA: ACM, 2004, pp. 905–914. [Online]. Available: http://doi.acm.org/10.1145/1186562.1015817
-  B. Cutler and E. Whiting, “Constrained planar remeshing for architecture,” in Proceedings of Graphics Interface 2007, ser. GI ’07. New York, NY, USA: ACM, 2007, pp. 11–18. [Online]. Available: http://doi.acm.org/10.1145/1268517.1268522
-  E. M. J. C. Z. M. E. Akleman, V. Srinivasan and E. Lendreneau, “Topmod: Topological mesh modeling system,” Texas A&M University, Tech. Rep., 2004.
-  M. Eigensatz and M. Pauly, “Positional, metric, and curvature control for constraint-based surface deformation.” Comput. Graph. Forum, vol. 28, no. 2, pp. 551–558, 2009.
-  M. Eigensatz, R. W. Sumner, and M. Pauly, “Curvature-domain shape processing.” Comput. Graph. Forum, vol. 27, no. 2, pp. 241–250, 2008.
-  W. Gander, G. H. Golub, and U. von Matt, “A constrained eigenvalue problem,” Linear Algebra and its Applications, vol. 114 15, no. 0, pp. 815 – 839, 1989.
-  M. Habbecke and L. Kobbelt, “Linear analysis of nonlinear constraints for interactive geometric modeling,” Comp. Graph. Forum, vol. 31, no. 2pt3, pp. 641–650, May 2012.
-  T. Igarashi, T. Moscovich, and J. F. Hughes, “As-rigid-as-possible shape manipulation,” in ACM SIGGRAPH 2005 Papers, ser. SIGGRAPH ’05. New York, NY, USA: ACM, 2005, pp. 1134–1141. [Online]. Available: http://doi.acm.org/10.1145/1186822.1073323
-  A. Jacobson, I. Baran, J. Popović, and O. Sorkine, “Bounded biharmonic weights for real-time deformation,” in ACM SIGGRAPH 2011 papers, ser. SIGGRAPH ’11. New York, NY, USA: ACM, 2011, pp. 78:1–78:8.
-  L. Liu, L. Zhang, Y. Xu, C. Gotsman, and S. J. Gortler, “A local/global approach to mesh parameterization,” in Proceedings of the Symposium on Geometry Processing, ser. SGP ’08. Eurographics Association, 2008, pp. 1495–1504.
-  Y. Liu, H. Pottmann, J. Wallner, Y.-L. Yang, and W. Wang, “Geometric modeling with conical meshes and developable surfaces,” ACM Trans. Graph., vol. 25, no. 3, pp. 681–689, Jul. 2006.
-  Y. Liu, W. Xu, J. Wang, L. Zhu, B. Guo, F. Chen, and G. Wang, “General planar quadrilateral mesh design using conjugate direction field,” ACM Trans. Graph., vol. 30, no. 6, pp. 140:1–140:10, Dec. 2011.
-  R. Poranne, E. Ovreiu, and C. Gotsman, “Interactive planarization and optimization of 3d meshes,” Comp. Graph. Forum, 2013.
-  H. Pottmann, Y. Liu, J. Wallner, A. Bobenko, and W. Wang, “Geometry of multi-layer freeform structures for architecture,” ACM Trans. Graph., vol. 26, no. 3, Jul. 2007. [Online]. Available: http://doi.acm.org/10.1145/1276377.1276458
-  J. Richter-Gebert, Realization spaces of polytopes, ser. Lecture notes in mathematics. Springer, 1996. [Online]. Available: http://books.google.co.za/books?id=K9UZAQAAIAAJ
-  O. Sorkine, D. Cohen-Or, Y. Lipman, M. Alexa, C. Rössl, and H.-P. Seidel, “Laplacian surface editing,” in Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing, ser. SGP ’04. New York, NY, USA: ACM, 2004, pp. 175–184. [Online]. Available: http://doi.acm.org/10.1145/1057432.1057456
-  O. Sorkine and M. Alexa, “As-rigid-as-possible surface modeling,” in Proceedings of the fifth Eurographics symposium on Geometry processing, ser. SGP ’07. Aire-la-Ville, Switzerland, Switzerland: Eurographics Association, 2007, pp. 109–116. [Online]. Available: http://dl.acm.org/citation.cfm?id=1281991.1282006
-  J. Tropp and A. Gilbert, “Signal recovery from random measurements via orthogonal matching pursuit,” Information Theory, IEEE Transactions on, vol. 53, no. 12, pp. 4655 –4666, dec. 2007.
-  W. T. Tutte, “How to Draw a Graph,” Proceedings of the London Mathematical Society, vol. s3-13, no. 1, pp. 743–767, 1963. [Online]. Available: http://dx.doi.org/10.1112/plms/s3-13.1.743
-  B. Vallet and B. Lévy, “Spectral Geometry Processing with Manifold Harmonics,” Computer Graphics Forum, vol. 27, no. 2, pp. 251–260, Apr. 2008. [Online]. Available: http://dx.doi.org/10.1111/j.1467-8659.2008.01122.x
-  A. Vaxman, “Modeling polyhedral meshes with affine maps,” Comp. Graph. Forum, vol. 31, no. 5, pp. 1647–1656, Aug. 2012. [Online]. Available: http://dx.doi.org/10.1111/j.1467-8659.2012.03170.x
-  W. Wang, Y. Liu, D. Yan, B. Chan, R. Ling, and F. Sun, “Hexagonal meshes with planar faces.”
-  Y.-L. Yang, Y.-J. Yang, H. Pottmann, and N. J. Mitra, “Shape space exploration of constrained meshes,” ACM Trans. Graph., vol. 30, no. 6, pp. 124:1–124:12, Dec. 2011. [Online]. Available: http://doi.acm.org/10.1145/2070781.2024158
-  M. Zadravec, A. Schiftner, and J. Wallner, “Designing quad-dominant meshes with planar faces,” Computer Graphics Forum, vol. 29, no. 5, pp. 1671–1679, 2010. [Online]. Available: http://dx.doi.org/10.1111/j.1467-8659.2010.01776.x
-  X. Zhao, C.-C. Tang, Y.-L. Yang, and H. Pottmann, “Intuitive design exploration of constrained meshes,” in Advances in Architectural Geometry 2012, L. Hesselgren et al., Eds. Springer, 2013, pp. 305–318.
We show a relation to differential equations in the case of the affine space. Assume a regular quad grid in the -plane and consider just the direction. Then can be written as a stencil:
For a 2D function , this stencil is used to find the discretization of the mixed second derivative . Just as PM’s are those that satisfy locally, functions that satisfy can be viewed as the continuous version of PM’s. These are all of the form , where and are any functions. Hence we see that in the continuous case, as in the discrete case, the solution is determined by its values on one side of the boundary.
Recall that an orthogonal dual of an embedded planar graph is an embedding of the dual graph such that primal and dual edges are orthogonal. Also recall that a lifting of a planar graph is a movement of its vertices in the -direction such that the faces remain planar. Any PM in the affine space of a PM can be reached by consecutively lifting the source PM in the , and directions. Hence, the dimension of the affine space is less than three times the dimension of the space of graph liftings. There is a known 1-1 correspondence between orthogonal duals and graph liftings up to translation and we can take advantage of their simple geometric representation to get more insight on the space of liftings. Consider any 3-regular graph. Its dual faces are all triangles. Being an orthogonal dual, each dual triangle must have a fixed shape and orientation. In addition, all triangles must be translated and scaled together. Therefore, the entire space of orthogonal duals is determined by 3 values (translation and scale). Therefore, liftings of 3-regular graphs have only 3 DOFs and as a consequence, the affine space of 3-regular graphs has dimension at most 12.