skip to main content
research-article
Open access

Planar Panels and Planar Supporting Beams in Architectural Structures

Published: 22 November 2022 Publication History

Abstract

In this article, we investigate geometric properties and modeling capabilities of quad meshes with planar faces whose mesh polylines enjoy the additional property of being contained in a single plane. This planarity is a major benefit in architectural design and building construction: If a structural element is contained in a plane, it can be manufactured on the ground without scaffolding and put into place as a whole. Further, the plane it is contained in serves as part of a so-called support structure. We discuss design of meshes under the requirement that one half of mesh polylines are planar (“P meshes”), and we also investigate the geometry and design of meshes where all polylines enjoy this property (“PP meshes”). We work in the space of planes and with appropriate transformations of that space. We also incorporate further properties relevant for architectural design, such as near-rectangular panels and repetitive nodes. We provide geometric insights, give explicit constructions, and show an approach to geometric modeling of both P meshes and PP meshes, in particular, the case of nearly rectangular panels.

1 Introduction

Many curved structures in architecture are composed of a grid of intersecting beams, each following the edges of a quadrilateral mesh. This article studies situations where many or all of those beams can be manufactured easier because they lie in a plane. There is a long list of actual architectural freeform skins that enjoy this property, and we point only to a few examples. Most are modelled after quad meshes with planar faces. A very practical requirement is that mesh polylines lie in horizontal planes and are thus aligned with floors, see, e.g., the Sail Tower in Haifa, Israel [Ballas 2003]. Other examples range from small structures like the 2002 Schubert Club “Bandshell” in St. Paul, Minnesota, to medium-sized domes like the roof of the Grand Reading Room, Mansueto Library, University of Chicago, to large buildings like the Sage Gateshead concert venue in the UK (Figure 2). An example where the planes are visually prominent is the Metropol Parasol in Seville, Spain, shown by Figure 3. Structures with planar beams are not restricted to the quad mesh case: A grid without local symmetries supports the glass roof over an interior courtyard at the Dutch maritime museum. And even if a structure is quad based, faces do not have to be planar, as is the case, e.g., for the Amtrak train station in Anaheim, California.
Fig. 1.
Fig. 1. This article deals with the interactive design of meshes with restrictive properties that are nevertheless highly relevant, e.g., for manufacturing. Here, we show a control structure for editing a quad mesh with planar faces where both families of mesh polylines have the property that they are entirely contained in a support plane transverse to the mesh. This so-called PP property still leaves sufficiently many degrees of freedom, so we can implement interactive geometric modeling via the colored design handles shown in the left-hand image.
Fig. 2.
Fig. 2. Quadrilateral meshes with planar polylines. The Sage Gateshead concert venue, completed in 2004 and designed by Foster+Partners, is based on a quad mesh with planar faces and planar mesh parameter lines.
Fig. 3.
Fig. 3. The Metropol Parasol in Seville, Spain, designed by Jürgen Mayer and completed 2011 features planar mesh parameter lines. The planes carrying parameter are structural elements.

1.1 Planar Beams in Shell-like Structures

1.1.1 Planarity of Long-range Elements.

A major reason for planarity of structural elements is easier manufacturing. For timber structures a popular way to fabricate curved beams is via glued laminated timber (glulam). Thin layers, usually lumber of standard sizes, are elastically bent and glued together in a curved configuration. It is also possible to make shapes exhibiting torsion that are not contained in a plane, but this process is much more involved. For steel structures, the most common method to produce curved beams is roller bending. This is a manageable task even for varying curvature but is very difficult for non-planar curves. Beams modelled after non-planar curves have to be manufactured in other, more costly, ways.

1.1.2 The P and PP Cases of Long-range Planar Beams.

In structures where beams cross each other, the actual crossings can be realized in different individual ways. It turns out that this is an important distinction and has strong implications on the global geometry of the structure. Basically, two categories have to be distinguished. We call them the P case and the PP case.
• The P case. There are structures where only one sequence of beams continues through crossings uninterrupted, while the transverse beams are short and reach only from one crossing to the next. In such a situation only beams of the first kind present manufacturing challenges so planarity has to be imposed.
• The PP case. There are also structures where all beams continue through crossings, and then planarity is imposed on all beams. The Schubert Club bandshell is an example of this [Schober 2015].
In the Seville Metropol Parasol (Figure 3), only one half of the beams continue through crossings, but planarity is imposed also on the other half. The reason for this is the efficient manufacturing of the load-bearing nodes at crossings [Schmid et al. 2011]. The same is true for the steel structure of the Sage Gateshead [Schober 2015].
Planarity of beams has also structural benefits in itself. It ensures that beams can be readily stiffened by auxiliary elements, as has been done for the interior courtyard roof of the Museum of Hamburg History [Ermias et al. 2013]. It also simplifies the fabrication of multi-layer gridshells.

1.1.3 Combining Planarity of Beams with Other Properties.

Planar beams covering a given surface are, in principle, easily found by intersecting the surface with arbitrary planes. This freedom in design can be used to achieve additional properties.
• Planarity of faces. An important property of this kind is planarity of faces. It allows cladding of the surface with planar panels. Surfaces easily admitting such planar panels are translation surfaces, where all beams are parallel translates of two generators. Only special geometric shapes can be achieved in this way, but they have been used several times, e.g., for the above-mentioned Mansueto library [Sobek and Blandini 2010] or the Hippo house in the Berlin zoo [Schober 2015]. Translation surfaces can be efficiently manufactured because of repetitive elements.
• Further properties include an intersection angle of 90° between beams, implying identical nodes and, in turn, efficient manufacturing. The Schubert Club “Bandshell” pavillion we mentioned above is an example of this [Schober 2015].
• Another property is funicularity, meaning small bending moments (up to the ideal case of self-supporting surfaces in the sense of Vouga et al. [2012]). An example combining funicularity, planar beams and planar faces is the Dutch Maritime museum [Adriaenssens et al. 2012]. We do not discuss funicularity in this article.
• Last, but not least, the designer’s wishes must be seen as constraints that are imposed on top of geometric properties like planarity of beams and of faces. E.g., for application to architectural facades, it is convenient that upper and lower edges of panels coincide with floor slabs. Imposing this property on many of the occurring planar beams is a strong restriction. We mention this special case to illustrate the fact that a succession of increasing demands reduces the designer’s freedom. Planar beams or flat faces alone do not restrict the class of available shapes, only the meshing. However, planar beams plus planar faces plus horizontal floor slabs on top of orthogonal intersection results in a very reduced class of shapes (in this case, the so-called moulding surfaces).

1.2 Contributions and Overview

We study surfaces with long-range planar beams, namely, the so-called P and PP cases of one family, respectively, two families of planar beams covering a design surface. Both are naturally discretized by means of a quad mesh with regular grid combinatorics. Planar beams are discretized as planar mesh polylines (isolated combinatorial singularities occur when individual regular patches are pasted together). Planar beams are, in principle, easy to achieve, since all we have to do is to intersect the design surface with suitable planes. Interesting questions arise if additional properties are required.
Consequently, this article restricts itself to the case of planar faces. The individual contributions of this article are the following:
We investigate the P and PP properties for quad meshes with planar faces and completely describe meshes with the PP property (Section 3.1).
We study the property of orthogonal intersection of polylines. We argue why this case is best represented by conical meshes and show how to constructively access all possible shapes of such meshes (Sections 4.1, 4.2 for the PP and P cases, respectively)
Our methodology is based on the geometry of planes. We therefore give an introduction to Laguerre geometry (Section 2.1). We also employ torsion-free support structures that were previously proposed in the study of meshes with planar faces. This leads to a new device called the weighted face image (Section 2.2).
We discuss different kinds of transformations of meshes that keep the relevant properties we are interested in (Sections 2.3.5, 4.3).
We discuss different methods of geometric design for meshes. Besides optimization, we make the design space user-friendly by starting from easily accessible and controllable initial shapes and by using transformations for navigation.
The P and PP properties discussed in the present article restrict the available meshes, even the available shapes, if combined with other properties relevant to architecture. They are thus difficult to achieve by optimization. For this reason, our article extensively discusses explicit constructions of such meshes and how to enable their geometric design.

1.3 Previous Work

The geometric topics touched upon in this article are more or less classical. Applications of Laguerre geometry to geometric design have been presented by Pottmann and Peternell [1998], and their role in discrete differential geometry is shown by Bobenko and Suris [2007]. Generally, planes instead of points have been used as basic elements of geometric design in several places, e.g., in the dual approach to developable surfaces by Pottmann and Wallner [1999].
A main topic of our article is representing geometric shapes by planar sections. This has been investigated from the viewpoint of human perception and minimalist representation of shapes [McCrae et al. 2011]. Assembly by interlocking planar pieces is the topic of Schwartzburg and Pauly [2013].
Our work is about representing geometric shapes by meshes with certain specific properties, namely, planar mesh polylines, planar faces, and in addition to that, near-orthogonal intersection of edges. Analogous objects in differential geometry are surfaces with planar parameter lines, with conjugate parameter lines, and in addition to that, with principal parameter lines. The combination of planarity and conjugacy was first studied by Darboux [1896, vol. IV, ch. IX]. He derived the representation we employ in Section 3.1.3.
The more special orthogonal case (surfaces with one or two families of planar principal curvature lines) had been thoroughly studied earlier. Monge [1809] constructed a great variety of such surfaces as sweeping surfaces via the motion of a rotation-minimizing frame. A special case (rotation-minimizing frame of a planar curve) yields the so-called moulding surfaces. For rotation-minimizing frames, we refer, e.g., to Bergou et al. [2008] and Wang et al. [2008]. Joachimsthal’s 1846 result states that the angle between a planar curvature line and its tangent planes is constant. Bonnet [1853], Lemonier [1868], and Serret [1853] used this to determine the equations of such surfaces. Darboux [1896] showed how his representation of planar+conjugate parametrizations specializes to the orthogonal case. We will present a discrete version of his result in Section 4.1.
Planar beams and planar faces in freeform architectural skins have recently started to attract interest. Design of special surfaces with one family of principal curvature lines for architectural applications is the topic of Mesnil et al. [2018]. Tellier [2020] and Tellier et al. [2019] employed the classical result by Darboux [1896] and used a discrete model of the Gauss map to obtain circular meshes with planar mesh polylines in both directions. This already represents an approach to the case of meshes with planar beams plus planar faces and near-orthogonal edges. It is the direct motivation for our work, where we broaden the theory and aim at direct and more intuitive methods of design. The main advance of our work compared to Tellier [2020] is to consider the P case besides the PP case, as well as easier and more comprehensive design methods.
Finally, we mention prior work on a different subject (the so-called multi-nets), which has an overlap with our work. Bobenko et al. [2020] contains a characterization of meshes with planar faces and planar parameter lines as so-called multi-Q* nets.

2 Geometric Basics

Here, we recap the Laguerre geometry of planes (Section 2.1), describing both planes and spheres as its basic elements, Laguerre transformations of both spheres and planes, and Laguerre transformations of smooth surfaces.
Section 2.2 introduces the weighted face image, which provides a new viewpoint of torsion-freee support structures. It allows us to express the P and PP properties in terms of the shape of dual faces.
Section 2.3 discusses how further geometric properties (like orthogonality) are expressed in terms of the weighted face image.

2.1 Laguerre Geometry

Geometric arguments in this article often are concerned with spheres and planes. It is therefore convenient to make use of the well-developed methods of Laguerre geometry whose basic entities are spheres, planes, and contact between them. A brief introduction to this topic is given by Pottmann and Peternell [1998]. For a more comprehensive account see Cecil [1992].
Both spheres and planes are endowed with an orientation by the choice of a unit normal vector field; oriented contact involves contact in the usual sense plus agreement of unit normal vectors in the point of contact. Formally, two oriented planes are in contact if their unit normal vectors agree (the point of contact is at infinity). A Laguerre transformation is defined as a permutation of the planes, plus a permutation of the spheres, such that oriented contact is preserved. Points are spheres of zero radius. Laguerre transforms in general do not preserve this zero radius property. Points may be mapped to spheres.

2.1.1 Laguerre Transformations of Spheres.

We encode a sphere with center (x, y, z) and signed radius r by the vector
\begin{align} &X=(x,y,z,r)\in {\mathbb {R}}^4. \end{align}
(1)
We think of a sphere endowed with normal vectors pointing outwards if r > 0, and inwards if r < 0. We introduce the Minkowski inner product and squared distance in \({\mathbb {R}}^4\) by letting
\begin{align} &#x00026;\ left\ llangle X_1,X_2 \ right\ rrangle= x_1x_2+y_1y_2+z_1z_2-r_1r_2 = X_1^T J X_2, \\ \nonumber \nonumber &#x00026;d^2(X_1,X_2) = \ left\ llangleX_1-X_2,X_1-X_2 \ right\ rrangle, \quad \text{where}\ J=\operatorname{diag}(1,1,1,-1). \end{align}
(2)
It is easy to see that \(\sqrt {d^2(X_1,X_2)}\) is the tangential distance of spheres, measured between the contact points of a plane that is in oriented contact with both; see inset figure. Contact of oriented spheres is expressed by
\begin{align*} d^2(X_1,X_2)= 0. \end{align*}
It is known that in this coordinate representation, a Laguerre transform acts as an affine mapping XλAX + T, where λ is a nonzero factor, \(A\in {\mathbb {R}}^{4\times 4}\) is a matrix obeying ATJA = J, and \(T\in {\mathbb {R}}^4\).

2.1.2 Laguerre Transformations of Planes and Normal Vectors.

Planes are entities of Laguerre geometry, so a Laguerre transformation can be applied to them. It is known that parallel planes are mapped to parallel planes by a Laguerre transformation. It therefore makes sense to ask in what way Laguerre transforms act on normal vectors. It turns out that this action is that of a Möbius transform of the unit sphere S2: We describe a point (x, y, z) in \({\mathbb {R}}^3\) by homogeneous coordinates X = (x1: x2: x3: x4) where \(x={x_1\over x_4}\), \(y={x_2\over x_4}\), \(z={x_3\over x_4}\). In these coordinates, the unit sphere is described by
\begin{align} X\in S^2 \iff X^T JX =0,\ \text{where} \ J=\operatorname{diag}(1,1,1,-1). \end{align}
(3)
A Möbius transform of the unit sphere reads XAX, where \(A\in {\mathbb {R}}^{4\times 4}\) obeys ATJA = J. The matrix A is the same as the one occurring in Section 2.1.1.

2.1.3 Laguerre Transforms of Smooth and Discrete Surfaces.

Applying a Laguerre transformation to the points of a smooth surface Φ, as well as to planes and spheres tangent to Φ, one gets spheres and planes tangent to a well-defined image surface Φ′ [Cecil 1992].
As to meshes, Laguerre transformations act on the face planes. To recover the vertices of the transformed mesh, we need to intersect face planes again. This procedure works only for special meshes, fortunately the conical meshes are among those [Liu et al. 2006]. We will be using Laguerre transforms later in this article (see Figures 19, 24). Here, we only mention that the passage from a mesh to an offset mesh at constant face-face distance is also an example of a Laguerre transform.
Laguerre transforms operating on surfaces are known to map principal curvature lines to principal curvature lines [Cecil 1992]. We will be concerned with surfaces where principal curvature lines are contained in planes. They, too, are preserved:
Proposition 2.1.
A Laguerre transformation maps a planar curvature line c to a planar curvature line c* on the image surface.
The proof makes use of the following form of Joachimsthal’s theorem, see, e.g., do Carmo [1976, p. 152]:
Proposition 2.2.
Consider the normal vector field n(t) along a principal curvature line c(t) in a surface. If the curve lies in a plane with normal vector e, then the angle ∢(n(t), e) is constant. Conversely, existence of e with this property implies that the curve c lies in a plane.
Proof of Proposition 2.1
If n(t) are the unit normal vectors along c(t), then Proposition 2.2 says that n(t) traces out a circle in the unit sphere S2. A Laguerre transform maps normal vectors by way of a Möbius transform, preserving circles. So the normal vector field n*(t) of c*(t) is a circle. Proposition 2.2 in reverse shows that c* lies in a plane.□

2.2 Torsion-free Support Structures

Pottmann et al. [2007] propose the term torsion-free support structure for a certain arrangement of planes along the edges of the mesh. The topic of the present article represents a special case of this, namely, one where many of the occurring planes are the same. We found that a more general look at torsion-free support structures yields insights valuable for our special case. Therefore, the text below contains a theoretical discussion that first applies to a more general setting and only later is specialized to our case. Basically, we introduce a certain version of homogeneous coordinates for the planes of a mesh from which we can read off geometric properties.

2.2.1 Torsion-free Support Structures and Their Weighted Face Images.

Consider a polyhedral mesh M = (V, E, F). The plane carrying the face fiF has an equation of the form
\begin{align*} n_i \cdot x + d_i =0, \end{align*}
where ni is a normal vector. We consider the vector
\begin{align} {\mathord {\sf f}}_i = \big [{\textstyle {n_i\atop d_i}}\big ]\in {\mathbb {R}}^4 \end{align}
(4)
as coordinates of this plane. It is unique up to a nonzero factor. Once the factor is chosen, \({\mathord {\sf f}}_i\) is called a weighted plane. It turns out that weighted planes allow us to formulate new properties of so-called torsion-free support structures. Following Pottmann et al. [2007], we define:
Definition 2.3.
A torsion-free support structure associated with M consists of a node axis Ai passing through each vertex vi, and a supporting plane σij for each edge vivj that contains both axes Ai and Aj. To avoid degeneracies, we require that σij does not contain the faces adjacent to the edge vivj.
Proposition 2.4 (Definition and Properties of Weighted Face Image).
Consider a simply connected polyhedral mesh M equipped with a torsion-free support structure where every edge vivj is associated with a support plane σij. We require that neighboring faces do not lie in the same plane. We can choose weighted plane coordinates \({\mathord {\sf f}}_j\) of faces and \({\mathord {\sf s}}_{ij}\) of supporting planes such that
\begin{align} {\mathord {\sf s}}_{ij}={\mathord {\sf f}}_r - {\mathord {\sf f}}_l, \end{align}
(5)
whenever the edge vivj is the intersection of faces fl, fr.
We now construct the weighted face image MF of M as a combinatorial dual of M that is contained in \({\mathbb {R}}^4\). The coordinate vectors \({\mathord {\sf f}}_j\) of faces of M serve as vertices of MF.
Then the faces of MF are planar.
Proof.
Since the faces fl, fr and the edge plane σij have a straight line intersection, we can achieve Equation (5) locally for each edge by multiplying plane coordinates with appropriate factors. We can also propagate Equation (5) through a sequence of edges. Now consider the cycle of faces f1, …, fk around a vertex v. Assume that Equation (5) holds for all edges fifi + 1, 1 ≤ i < k. The planes \({\mathord {\sf f}}_i-{\mathord {\sf f}}_{i+1}\) associated with these edges contain the vertex v and in fact contain all points v + λa on the node axis passing through v. This amounts to two independent linear conditions imposed on the vectors \({\mathord {\sf f}}_i-{\mathord {\sf f}}_{i+1}\). The plane \({\mathord {\sf f}}_1-{\mathord {\sf f}}_k\) by construction passes through the edge f1fk and it obeys the aforementioned conditions, since
\begin{align*} {\mathord {\sf f}}_1-{\mathord {\sf f}}_k = ({\mathord {\sf f}}_2-{\mathord {\sf f}}_1)+ \cdots + ({\mathord {\sf f}}_{k}-{\mathord {\sf f}}_{k-1}). \end{align*}
Thus, the plane \({\mathord {\sf f}}_1-{\mathord {\sf f}}_k\) contains the node axis and coincides with the support plane of the edge f1fk. This shows that propagation of Equation (5) is consistent around each vertex and, by simple connectedness, is consistent globally.
The edges of the dual face in MF corresponding to v are given by vectors \({\mathord {\sf f}}_i-{\mathord {\sf f}}_{i+1}\) (indices modulo k). Because of the two linear conditions mentioned above, these edges lie in a two-dimensional plane.□
Given MF, a torsion-free support structure is derived via Equation (5). Scaling of MF with a nonzero factor does not change the torsion-free support structure, but apart from that, MF and the support structure determine each other uniquely:
Proposition 2.5.
Consider a generic mesh \(\widetilde{M}\) in \({\mathbb {R}}^4\) whose faces lie in 2D planes. Then there exists a mesh M equipped with a torsion-free support structure whose weighted face image equals \(\widetilde{M}\).
Proof.
The combinatorics of M are dual to those of \(\widetilde{M}\). We directly read off the face planes of M from the corresponding dual vertices of \(\widetilde{M}\). To reconstruct a vertex v from adjacent face planes \({\mathord {\sf f}}_1,\ldots ,{\mathord {\sf f}}_k\), we must solve the linear system \((v,1)\cdot ({\mathord {\sf f}}_1,\ldots ,{\mathord {\sf f}}_k)=0\). The dimension 2 requirement generically implies a unique solution v; we appeal to genericity to avoid a discussion of cases. The edge vectors \({\mathord {\sf f}}_1-{\mathord {\sf f}}_2,\ldots\) correspond to planes that intersect in a straight line, because their span is two-dimensional. Thus these coordinates correspond to the planes of a torsion-free support structure.□

2.2.2 The Weighted Normal Image of a Mesh.

The weighted face image MF of M is now used to construct the so-called weighted normal image MN of M. This happens by forgetting the fourth coordinate, projecting MF onto a mesh MN in \({\mathbb {R}}^3\), which we call the normal image of M. Like MF it is a combinatorial dual of M, and its faces are planar.
Note that the vertices of MN are normal vectors, but not necessarily unit normal vectors. If they were, then we would call MN a Gauss image, in the tradition of differential geometry.
The auxiliary meshes MF and MN each have a particular purpose. First, the mesh MF serves to encode the support structure we endow the original mesh M with. Second, special properties of M like planar polylines will be expressed in terms of much better accessible properties of MF. E.g., M has two families of planar polylines if MF is generated by translation (Proposition 3.1). The additional level of abstraction caused by MF living in \({\mathbb {R}}^4\) is compensated by the now much easier access to the planar polylines property.
Properties involving angles can be read off the normal image MN that lives in dimension 3; e.g., applications may demand a support structure orthogonal to the base mesh M. This is expressed by MN being spherical (Section 2.3.2). Right angles in the support structure’s nodes correspond to MN being principal (Section 2.3.4). MN is an important technical device in our extensive discussion of conical PP meshes (Section 4.1). Finally, for interactive design, we need as many geometric transformations as possible that can be applied to support structures. These likewise can be derived from MF (Sections 2.2.3, 2.3.5).

2.2.3 F-transforms and Parallel Meshes.

Polyhedral meshes M, M′ with the same combinatorics are called F-transforms of each other if corresponding edges e, e′ are co-planar. They are called parallel meshes (Combescure transforms) if corresponding edges are even parallel [Bobenko and Suris 2008]; see Figure 4. In the architectural context, M and M′ are seen as a two-layer structure where the inner and outer surface have variable distance from each other [Pottmann et al. 2007]. In such a situation, the planes carrying corresponding edges e, e′ obviously constitute a torsion-free support structure for both M, M′. If M, M′ are F-transforms of each other, then Proposition 2.4 implies that the respective face images \(M_F,M_F^{\prime }\) are parallel meshes.
Fig. 4.
Fig. 4. Meshes are F-transforms if they share a support structure. Their respective face images are parallel meshes . Here, three F-transforms (shown by yellow, red, and black edges) have been created by simply parallel translating the face image MF of a base mesh M.

2.3 Geometric Properties of Support Structures

In applications, geometric properties such as the angle beween edges or the angle between planes often is an issue and corresponding constraints enter our design problem. This section discusses several such properties that might be imposed on torsion-free support structures.

2.3.1 The Analogy between Discrete and Smooth Differential Geometry.

In our discussion of geometric properties, we are guided by the analogy between discrete and continuous objects, and we draw on known results from differential geometry. The analogies we use in the immediately following paragraphs are summarized by the following table:
meshsurface,
quad meshparametrization of surface,
quad mesh with planar facesconjugate parametrization,
circular or conical meshprincipal parametrization.
These analogies assume fairness, i.e., the edges of meshes approximate first derivatives, and whenever second-order properties are concerned, we assume that second-order differences approximate second derivatives. Under these assumptions, a quad mesh with planar faces approximates a conjugate parametrization, while the circular and conical properties imply that this parametrization is close to principal [Liu et al. 2006].

2.3.2 Right Angles Between Support Structure and Panels.

The first property we study concerns the angle between support planes and panels. In applications this might be required to be close to 90 degrees. In the weighted normal image MN, the normal vectors of these items are represented by dual edges, respectively, dual vertices—a dual vertex ni here is interpreted as the vector \(\overrightarrow{on_i}\) attached to the origin. We conclude: The right angle requirement is expressed by a spherical shape of MN, because only then edges and vertices are orthogonal.

2.3.3 Principal Meshes—Conical and Circular Meshes.

A mesh with planar faces is conical if the faces adjacent to a vertex vi touch a common cone of revolution. The axis Ai of this cone serves as node axis of a torsion-free support structure; the corresponding supporting planes σij of edges are bisectors of adjacent faces [Liu et al. 2006]. These properties imply that the normal vectors ni occurring in the weighted normal image MN are unit vectors; this is because then
\begin{align*} s_{ij} = n_i-n_j \end{align*}
computes exactly the normal vector of the bisecting support plane. Thus, MN is inscribed in the unit sphere. Faces of MN are planar and so have circumcircles; we conclude MN is a circular mesh.
Remark 2.1.
A principal curvature line parametrization of a surface can be discretized in several ways, and it seems a bit arbitrary to prefer the conical meshes over other choices, e.g., circular meshes. However, it typically does not matter which version of principal meshes we use. By choosing one particular property, say, the conical property, we will not lose generality as far as approximation of the continuous situation is concerned.

2.3.4 Right Angles in Nodes.

After the preparations in Section 2.3.3, we turn to another property imposed on torsion-free support structures, namely, a near-orthogonal intersection of supporting planes. This question does not concern M itself; it addresses only the support structure associated with it. We say such a support structure has orthogonal nodes.
Interestingly, this property means that the weighted normal image MN is principal. To see this, observe that orthogonality of support planes means orhogonality of their respective normal vectors. These normal vectors occur as edges of MN, so edges of MN are approximately orthogonal. MN already has planar faces, and the additional orthogonality property now means it is principal. We are free to impose any of the available properties expressing principality. In this particular case it is convenient to require that MN is a circular mesh.

2.3.5 Transformations of Torsion-free Support Structures.

It is an old geometer’s trick to transfer objects from one space to another to benefit from the latter’s transformations. The following paragraphs describe how this idea can be applied to torsion-free support structures.
We may subject a mesh M with torsion-free support structure to projective transformations without destroying the support structure property. The group of projective transformations of 3-space is 15-dimensional. However, transfer to the face image MF via Proposition 2.4 yields a mesh in 4-dimensional space and a much greater set of transformations: Applying a 4D projective transformation (with its 24 degrees of freedom) to MF does not destroy the relevant properties. We can then employ Proposition 2.5 and turn the transformed face image back into a mesh plus support structure—see Figure 5.
Fig. 5.
Fig. 5. The mesh and torsion-free support structure at left is being modified by applying a projective mapping in 4-space to its weighted face image MF. After introducing homogeneous coordinates, this transformation is expressed by multiplication with a matrix.
Remark 2.2 (Isotropic Möbius Transforms for Support Structures with Orthogonal Nodes).
In Section 2.3.4, we discussed support structures with orthogonal nodes—they were characterized by MN being circular. An alternative characterization is that the face image MF projects onto a circular mesh MN when we forget the 4th coordinate.
There is a 16-dimensional group of isotropic Möbius transformations in 4-space that preserve the property of four points “lying in a plane and projecting onto a circular quad.” Any such transformation can be applied to MF without destroying the right-angled node property. Figure 6 shows an example. For the formulae, we refer to Pottmann and Peternell [1998].
Fig. 6.
Fig. 6. Support structures with orthogonal nodes. These two support structures are connected by an isotropic Möbius transform acting on their respective 4D circular face images MF, \(M_F^{\prime }\). The orthogonal nodes property is visible only for such nodes where the axis is a projecting ray.

3 Meshes with Planar Supporting Beams

3.1 P meshes and PP meshes

This section introduces the P and PP properties, which are the main focus of this article. All involved meshes are polyhedral, i.e., they have planar faces.

3.1.1 Definition of the P and PP Property.

Consider a polyhedral quad mesh that locally has the combinatorics of a regular grid. Vertices vi, j are indexed by integers i, j. We call it a P mesh if there is a sequence of planes Ui such that
\begin{align*} v_{i,j} \in U_i \quad \text{for all}\ i, j, \end{align*}
that is, one family of mesh polylines is planar. We could just as well have required existence of planes Wj such that vi, jWj. The mesh is called a PP mesh if there are planes Ui and Wj such that
\begin{align*} v_{i,j} \in U_i\cap W_j, \quad \text{for all}\ i, j. \end{align*}
In a PP mesh, all mesh parameter lines are planar. The planes carrying parameter lines can be taken as part of a support structure.
For the following considerations, we are indexing faces by their lowest corner, so the vertices of the face fi, j are vi, j, vi + 1, j, vi + 1, j + 1, vi, j + 1.
We construct the weighted face image MF according to Section 2.2.1. It has vertices \({\mathord {\sf f}}_{i,j}\). Planes Ui and Wj are support planes in the sense of Section 2.2.1. According to Equation (4) and Proposition 2.4, the coordinates of support planes occur as edges of MF. Thus, the P mesh condition translates to
\begin{align*} {\mathord {\sf f}}_{i,j+1}-{\mathord {\sf f}}_{i,j} =\lambda _{i,j} {\mathord {\sf u}}_i, \end{align*}
where \({\mathord {\sf u}}_i\) is the homogeneous coordinate vector of the plane Ui. Geometrically, this means that faces of MF are trapezoids. For a PP mesh, we also have
\begin{align*} {\mathord {\sf f}}_{i+1,j}-{\mathord {\sf f}}_{i,j} =\mu _{i,j} {\mathord {\sf w}}_j, \end{align*}
where \({\mathord {\sf w}}_j\) are coordinates of planes Wj. The faces of MF are parallelograms. This means that MF is a discrete translation net.
In the PP mesh case, edges \(\lambda _{i,j}{\mathord {\sf u}}_i\) depend only on the index i, and edges \(\mu _{i,j}{\mathord {\sf w}}_j\) depend only on the index j. By relabelling these vectors \({\mathord {\sf u}}_i\) and \({\mathord {\sf w}}_j\), respectively, we get
\begin{align} {\mathord {\sf f}}_{i+1,j}- {\mathord {\sf f}}_{i,j} = {\mathord {\sf u}}_i, \quad {\mathord {\sf f}}_{i,j+1}- {\mathord {\sf f}}_{i,j} = {\mathord {\sf w}}_j. \end{align}
(6)
We have shown:
Proposition 3.1.
If a mesh M has the P property, then its face image MF has faces that are trapezoids. If M has even the PP property, then the faces of MF are parallelograms, and thus MF is generated by translating one mesh parameter line along a transverse mesh parameter line.

3.1.2 Construction of P meshes and PP meshes from Initial Values.

Computing PP meshes can be reduced to the problem of finding vertices vij constrained to lines lij = UiWj (this idea can also be used for computing P meshes, where lines lijUj are variables, and has been employed by Mesnil et al. [2017]). Once the lines lij are fixed, vertices can be uniquely propagated from Cauchy initial values, say, vi, 0 and v0, j (see Figure 7). It is, however, difficult to control the final shape via those initial values.
Fig. 7.
Fig. 7. Theoretical construction of a PP mesh from Cauchy initial data if planes planes U0, U1, … and W0, W1, … are given. The vertex vi + 1, j + 1 is found from vi, j, vi, j + 1, vi + 1, j by intersecting the plane spanned by these three vertices with the straight line Ui + 1Wj + 1.
Equation (6) immediately implies that
\begin{align} {\mathord {\sf f}}_{i,j} = {\mathord {\sf f}}_{i,0}+{\mathord {\sf f}}_{0,j}-{\mathord {\sf f}}_{0,0}. \end{align}
(7)
This yields an explicit dependence of vertices on Cauchy initial data. Geometric modelling based on Equation (7) is much more stable than intersecting lines and planes, which is likely to even break down when the sign of Gaussian curvature changes. However, it requires to appropriately initialize weighted plane coordinates at the boundary. We deal with the actual geometric design in Section 3.2.

3.1.3 Relation of PP Meshes to Bisector Surfaces.

The statement of Proposition 3.1 refers to plane coordinates in dual space, and we want to give an interpretation in terms of primal space. Equation (7) can be rewritten as
\begin{align*} {\mathord {\sf f}}_{i,j} = {\mathord {\sf g}}_i - {\mathord {\sf h}}_j, \end{align*}
e.g., by letting \({\mathord {\sf g}}_i={\mathord {\sf f}}_{i,0}\) and \({\mathord {\sf h}}_j={\mathord {\sf f}}_{0,0}-{\mathord {\sf f}}_{0,j}\). Now, we interpret \({\mathord {\sf g}}_i\) and \({\mathord {\sf h}}_j\) as coordinates not of planes, but of spheres, where a vector \({\mathord {\sf g}}=(g_1,g_2,g_3,g_4)\in {\mathbb {R}}^4\) corresponds to the sphere \(\Sigma _{{\mathord {\sf g}}}\) with equation ‖x2 + (g1, g2, g3)t · x + g4 = 0. With another sphere \(\Sigma _{{\mathord {\sf h}}}\) corresponding to \({\mathord {\sf h}}\in {\mathbb {R}}^4\), we consider the radical plane associated with \(\Sigma _{{\mathord {\sf g}}}\), \(\Sigma _{{\mathord {\sf h}}}\). Its equation is the difference
\begin{align*} \big ((g_1,g_2,g_3)^T-(h_1,h_2,h_3)^T\big)\cdot x + (g_4-h_4)=0 \end{align*}
of equations of \(\Sigma _{{\mathord {\sf g}}},\Sigma _{{\mathord {\sf h}}}\). This plane passes through the intersection \(\Sigma _{{\mathord {\sf g}}}\cap \Sigma _{{\mathord {\sf h}}}\). In the special case of zero radius, both \(\Sigma _{{\mathord {\sf g}}}\) and \(\Sigma _{{\mathord {\sf h}}}\) are reduced to points, and the radical plane is the bisector plane. Observe that the coordinates of the radical plane is just \({\mathord {\sf g}}-{\mathord {\sf h}}\), so we can say that the weighted face image consists of the radical planes of spheres \(\Sigma _{{\mathord {\sf g}}_i}\) and spheres \({\Sigma _{{\mathord {\sf h}}_j}}\).
The reason we invoke this interpretation is that it leads to a geometrically interesting special case of PP meshes: With a polyline of zero-radius spheres \({\mathord {\sf g}}_i\) and another such polyline \({\mathord {\sf h}}_j\), the definition \({\mathord {\sf f}}_{i,j}={\mathord {\sf g}}_i-{\mathord {\sf h}}_j\) yields the weighted face image of a PP mesh whose face planes bisect the given two polylines; see Figure 8. The PP mesh can therefore be considered as a discrete bisector surfaces of two polylines.
Fig. 8.
Fig. 8. PP meshes as bisector surfaces. At left, the face planes \({\mathord {\sf f}}_{i,j}\) of a PP mesh M are bisecting the vertices of two polylines \({\mathord {\sf g}}_i\) and \({\mathord {\sf h}}_j\) that are actually spheres of zero radius. At right, these vertices swell and become true spheres. Then bisector planes become radical planes, and M is replaced by a parallel mesh. We visualize the sphere \({\mathord {\sf g}}_i\) by means of a channel surface tangent to them, and the same for \({\mathord {\sf h}}_j\).
A change in the radius of the involved spheres changes the 4th coordinate in vectors \({\mathord {\sf g}}_i\) and \({\mathord {\sf h}}_j\), but not the normal vectors of the planes \({\mathord {\sf f}}_{ij}\), which are represented by coordinates 1,2,3. Thus, changing the radii means that the PP mesh constructed in this way is replaced by a parallel mesh. The analogous continuous construction was proposed by Darboux [1896].
Remark 3.1.
Bisectors have been studied by Elber and Kim [1998] and Peternell [2000], mainly from an algebraic perspective. The PP property is not mentioned, but is already apparent in simple cases: The bisector of two straight lines is a hyperbolic paraboloid, which has parabolas as planar + conjugate parameter lines. Similarly, the supercyclide occurring as a bisector of two circles [Peternell 2000] features conics as parameter lines.
Remark 3.2 (.
The Multi-net Property of PP Meshes) The explicit representation of Equation (7) shows the following: When we delete an entire row of dual vertices in MF and recompute the base mesh M by intersecting the remaining face planes, we get a PP mesh again. The same is true for columns. This is a dual version of the multi-net property, which is the subject of Bobenko et al. [2020].

3.2 Interactive Editing of PP Meshes

3.2.1 The Principle of Design by Tangent Planes.

The geometric design of PP quad meshes is based on Proposition 3.1 and the explicit representation of vertices \({\mathord {\sf f}}_{i,j}\) of the weighted face image by Equation (7). For design purposes, it will be good to think of the face coordinates \({\mathord {\sf f}}_{i,j}\) as discrete samples of smooth functions:
\begin{align} {\mathord {\sf f}}_{i,j}={\mathord {\sf f}}(u_i,v_j), \ \text{where}\ {\mathord {\sf f}}(u,v)=\underbrace{{\mathord {\sf f}}(u,0)}_{\text{ $=:{\mathord {\sf g}}(u)\vphantom{g(u)h(u)}$}} + \underbrace{{\mathord {\sf f}}(0,v)}_{\text{ $=:{\mathord {\sf h}}(v)\vphantom{g(u)h(u)}$}} - \underbrace{{\mathord {\sf f}}(0,0)}_{\text{ $=:{\mathord {\sf c}}\vphantom{g(u)h(u)}$}}. \end{align}
(8)
Note that \({\mathord {\sf g}}(0)={\mathord {\sf h}}(0)={\mathord {\sf c}}\). The continuous surface x(u, v) whose tangent planes are \({\mathord {\sf f}}(u,v)\) is reconstructed by intersecting \({\mathord {\sf f}}(u,v)\) with partial derivatives \({\mathord {\sf f}}_u,{\mathord {\sf f}}_v\). We symbolically write
\begin{align} x(u,v)={\mathord {\sf f}}\times {\mathord {\sf f}}_u\times {\mathord {\sf f}}_v =({\mathord {\sf g}}(u)+{\mathord {\sf h}}(v)-{\mathord {\sf c}})\ \times \ {\mathord {\sf g}}^{\prime }(u)\ \times \ {\mathord {\sf h}}^{\prime }(v). \end{align}
(9)
The prime indicates derivatives. We see that all points of the v parameter line x(u0, v) are contained in the plane \({\mathord {\sf g}}^{\prime }(u_0)\); it is a support plane of this parameter line. Likewise, \({\mathord {\sf h}}^{\prime }(v_0)\) is the supporting plane of the u parameter line x(u, v0)—see Figure 9.
Fig. 9.
Fig. 9. A surface x(u, v) with the PP property is constructed as envelope of its tangent planes \({\mathord {\sf f}}(u,v)={\mathord {\sf g}}(u)+{\mathord {\sf h}}(v)-{\mathord {\sf c}}\). The supporting planes of the u and v parameter lines are given by partial derivatives \({\mathord {\sf f}}_v={\mathord {\sf h}}^{\prime }(v)\) and \({\mathord {\sf f}}_u={\mathord {\sf g}}^{\prime }(u)\), respectively. Labels γ0, γ01, γ1 identify control elements discussed later.
The PP mesh whose face planes \({\mathord {\sf f}}_{i,j}\) are samples of \({\mathord {\sf f}}(u,v)\) has the very same support planes \({\mathord {\sf g}}^{\prime }(u_i)\) and \({\mathord {\sf h}}^{\prime }(v_j)\). Note that the vertices of the mesh are not samples of the surface x(u, v); the sample property applies to planes.
Figure 10 illustrates a simple case of interactive design based on this approach. Given are curves c(u) (red, contained in a plane ε) and d(v) (blue, contained in a plane φ). With m(u), n(v) as unit normal vectors of these curves within ε, φ, respectively, we let \({\mathord {\sf f}}(u,v)=\big [{m(u)+n(v)-m_0\atop m_0\cdot c_0-m(u)\cdot c(u)-n(v) \cdot d(v)}\big ]\). It is easy to check that the surface x(u, v) constructed via Equation (9) interpolates both curves if some conditions are met: ε, φ are orthogonal, the curves meet in a common point c0 ∈ ε∩φ and have a common normal vector m0 there. A PP mesh is derived from \({\mathord {\sf f}}(u,v)\) by sampling. We have thus reduced the interactive design of PP meshes to the interactive design of 2D curves.
Fig. 10.
Fig. 10. A PP mesh whose weighted face planes \({\mathord {\sf f}}_{i,j}\) are samples of a smooth dual surface \({\mathord {\sf f}}(u,v)\). We here show the support structure of the mesh and the primal surface x(u, v) derived from \({\mathord {\sf f}}(u,v)\) according to Equation (9).

3.2.2 A Bézier Curve Approach to Geometric Design of PP Meshes.

Geometric modelling based on Equations (8) and (9) hinges on the choice of curves \({\mathord {\sf g}}(u)\) and \({\mathord {\sf h}}(v)\) that lie in \({\mathbb {R}}^4\) and are not accessible visually. We show how to nevertheless perform geometric modeling via controls that can be interactively handled by the user. We use a curve \({\mathord {\sf g}}(u)\) that is the concatenation of quadratic segments \({\mathord {\sf g}}^{(0)},{\mathord {\sf g}}^{(1)},\ldots\) Each segment is determined by control points \({\mathord {\sf g}}_i,{\mathord {\sf g}}_{i,i+1},{\mathord {\sf g}}_{i+1}\):
\[\begin{eqnarray*} {\mathord {\sf g}}^{(i)}(u) &#x00026; = (1-u)^2{\mathord {\sf g}}_i + 2u(1-u){\mathord {\sf g}}_{i,i+1} + u^2{\mathord {\sf g}}_{i+1} \quad (0\le u\le 1). \nonumber \nonumber \end{eqnarray*}\]
Figure 11 shows an example. It is easy to verify that the segments fit together in a tangent-continuous way if and only if points
\begin{align} {\mathord {\sf g}}_{i-1,i},\ {\mathord {\sf g}}_i,\ {\mathord {\sf g}}_{i,i+1} \end{align}
(10)
are lying on a straight line, in that order (if the order is reversed, then the union of segments has a cusp). Similarly, the curve \({\mathord {\sf h}}(v)\) is defined by control points \({\mathord {\sf h}}_0\), \({\mathord {\sf h}}_{01},\ldots\) To meet the requirement that \({\mathord {\sf g}}(0)={\mathord {\sf h}}(0)\), we choose \({\mathord {\sf g}}_0={\mathord {\sf h}}_0\), but otherwise curves \({\mathord {\sf g}},{\mathord {\sf h}}\) are independent from each other.
Fig. 11.
Fig. 11. Left: Control points c0, c01, c1, … for a spline curve consisting of segments c(0)(t), c(1)(t), … that fit together with tangent continuity. We also indicate vectors \(\vec{t}_i\) indicating the direction of the curve when passing through the point ci. Right: Analogous control structure γ0, γ01, γ1, … for a spline in plane space. In our setting, the planes τi related to the spline’s tangents serve as support planes and are intuitive handles for modeling.
For the actual design, we cannot expect the user to select control elements \({\mathord {\sf g}}_0,{\mathord {\sf g}}_{01},{\mathord {\sf g}}_1,\ldots\) in the four-dimensional space of weighted planes. Instead, the user picks an arrangement of planes γ0, γ01, γ1, … as shown in Figure 11, right. If weighted plane coordinates are to obey Equation (10), then the corresponding planes
\begin{align*} \gamma _{i,i-1},\ \gamma _{i},\ \gamma _{i,i+1} \end{align*}
must intersect in a common line. The user also chooses a plane τi passing through that same line, which eventually serves as a supporting plane of the generated PP mesh.
To reconstruct a tangent-continuous union of curve segments from these data, we choose weighted plane coordinates \(\bar{{\mathord {\sf g}}}_i, \bar{{\mathord {\sf g}}}_{i,i+1},\bar{{\mathord {\sf t}}}_i\) for planes γi, γi, i + 1, τi, respectively. We then find control points as required by a recursive re-weighting procedure. We let \({\mathord {\sf g}}_0:=\bar{{\mathord {\sf g}}}_0\) and solve
\begin{align*} {\mathord {\sf g}}_0 + \mu _0\bar{{\mathord {\sf t}}}_0 &#x00026;= \lambda _{01}\bar{{\mathord {\sf g}}}_{01}, &#x00026; {\mathord {\sf g}}_{01} &#x00026;:= \lambda _{01}\bar{{\mathord {\sf g}}}_{01} \\ {\mathord {\sf g}}_{01}+\nu _0\bar{{\mathord {\sf t}}}_0 &#x00026;= \lambda _1\bar{{\mathord {\sf g}}}_{01}, &#x00026; {\mathord {\sf g}}_1 &#x00026;:= \lambda _1\bar{{\mathord {\sf g}}}_1 \end{align*}
(with unkonwn coefficients μi, νi, λi, λi, i + 1), and so on for \({\mathord {\sf g}}_{12},{\mathord {\sf g}}_2,\ldots\) The control points computed in this way define curve segments fitting together to form the tangent-continuous curve \({\mathord {\sf g}}(u)\). It is constructed such that the derivatives at the endpoints of segments correspond to the plane coordinates of planes τi.
Since the arrangement of planes in Figure 11 has quite a lot of constraints, we assist the user by setting up a procedure to interactively modify the arrangement, while side-conditions are maintained by an optimization running in the background. We do not describe the details here, since we do not regard it as a contribution of the present article—see Figures, 12, 13 and accompanying video.
Fig. 12.
Fig. 12. Interactive modeling with the control structure for PP meshes. Left: Initial position and user-modified position of the control elements. Right: A PP mesh derived from those.
Fig. 13.
Fig. 13. A design with planar faces exhibiting the PP property made by the spline method described by Section 3.2.2.
An analogous procedure yields the curve \({\mathord {\sf h}}(v)\). Together, using the explicit expressions given at the top of this section, they define a dual surface \({\mathord {\sf f}}(u,v)\) and, by sampling that, a PP mesh. Note that the support planes of this PP mesh are given by the derivatives of curves \({\mathord {\sf g}},{\mathord {\sf h}}\). This is why we made those support planes a design handle.
Remark 3.3.
Recall that the dual curve \({\mathord {\sf g}}(u)\) is tangent-continuous only if control points \({\mathord {\sf g}}_{i-1,i}\), \({\mathord {\sf g}}_i\), \({\mathord {\sf g}}_{i,i+1}\) lie on a straight line, in that order. It is not difficult to see that this condition is fulfilled if and only if planes γi − 1, i, γi, γi, i + 1, τi are arranged in that order, as shown by Figure 11. This is not the case for the nonconvex example of Figure 12, and indeed the curve \({\mathord {\sf g}}(u)\) features a cusp here. The user does not notice this phenomenon, which happens in the space of weighted planes.

3.3 Computing P Meshes by Optimization

The P property—planarity of only 1 family of mesh parameter lines—is a comparatively mild restriction. We found it quite easy to establish by optimization, provided we start from a mesh with planar faces already optimized for use in freeform architecture (using, e.g., the method of Tang et al. 2014). Their mesh polylines are smooth to such an extent that we experienced no obstacles in imposing the P property in addition to planarity of faces. Figures 14 and 25 show examples. The process is the following: We consider a mesh (V, E, F) with a collection S of supporting planes. Variables in optimization are vertices vV, and unit normal vectors nf, nσ of all faces fF and of supporting planes σS. By summation over all edges vw contained in the planes mentioned, we build energies
\begin{align*} E_P &#x00026;= \sum _{\sigma \in S} \sum _{vw\in \sigma \vphantom{S}} \langle n_\sigma , v-w\rangle ^2, &#x00026; E_f &#x00026;=\sum _{f\in F} \sum _{vw\in f} \langle v-w,n_f \rangle ^2, \end{align*}
which penalize deviation from those planes. We use the energy
\begin{align*} E_1= \sum \limits _{\sigma \in S} (\Vert n_\sigma \Vert ^2-1)^2 + \sum \limits _{f\in F} (\Vert n_f\Vert ^2-1)^2 \end{align*}
to force normal vectors to be of length 1. We also employ a fairness energy \(E_{\text{fair}}=\sum \nolimits _{\text{triples}\ uvw} \Vert (u-v)-(v-w)\Vert ^2\), where summation is over all successive vertices of mesh polyline where fairness is to be imposed. The total energy λPEP + λfEf + λ1E1 + λfairEfair has been minimized using a Levenberg-Marquardt method [Madsen et al. 2004]. Figures 14 and 25 show results of this optimization.
Fig. 14.
Fig. 14. An architectural design exhibiting the P property.
For the examples produced in this article, we let λfair = 0.01 and λP = λf = λ1 = 1. To evaluate the quality of results, we measure planarity of a face f by the distance δf of diagonals divided by average length of diagonals. Planarity of a mesh polyline P is expressed by the value δP, which is the maximum distance of P’s vertices from a best approximating plane, divided by the bounding box diameter of P. We summarize the results of optimization:
 max. δPavg. δPmax. δfavg. δf
Figure 141.6 · 10− 52.8 · 10− 61.4 · 10− 51.7 · 10− 6
Figure 251.2 · 10− 42.9 · 10− 51.4 · 10− 42.3 · 10− 5
We do not consider this optimization a major result of the present article, since it is very similar to other cases where global optimization of meshes is employed.

4 Principal Meshes with the P and PP Property

In architectural design, a highly visible property is that of orthogonal or near-orthogonal intersection of edges, or the near-rectangular shape of planar panels. This leads to so-called principal meshes (see Section 2.3.3). Our focus is on meshes enjoying the P or even the PP property. Among different definitions of principal meshes, we choose to work with conical meshes. This is because then we can treat the P and PP properties elegantly via the Laguerre geometry of planes.
Recall the definition and properties of a conical mesh from Section 2.3.3, in particular, the torsion-free support structure canonically associated with it. Recall also the weighted normal image of a mesh in Section 2.2.2. The weighted normal image and face image associated with the canonical support structure will be labelled \(M_N^\circ\) and \(M_F^\circ\), respectively. \(M_N^\circ\) is inscribed in the unit sphere (see Figure 15).
Fig. 15.
Fig. 15. A conical mesh M with planar parameter lines has two weighted normal images, namely, a translation net MN and a circular mesh \(M_N^\circ\), which is the projection of MN onto the unit sphere. Proposition 4.1 describes how the vertices \(n_{ij}^\circ\) of \(M_N^\circ\) arise by sampling two orthogonal pencils of circles in the unit sphere.
If M is endowed with another torsion-free support structure (e.g., if M enjoys the PP property), then another face image MF and normal vector image MN are derived from it. Since the base mesh M is still the same, corresponding vertices of MF and \(M_F^\circ\) are proportional and so are corresponding vertices of MN and \(M_N^\circ\). Thus, \(M_N^\circ\) arises from MN by normalization, i.e., projection to the unit sphere (see Figure 15). Similarly, \(M_F^\circ\) arises from MF by a projection that normalizes the first three coordinates. The existence of these projections is a strong constraint on the geometry of MF and MN, since planarity of faces must not be destroyed by the projection.
Figure 15 shows the two different weighted normal images MN, \(M_N^\circ\) associated with such a mesh M. The conical property allows us to derive one support structure, the PP property leads to another. The former leads to \(M_N^\circ\) inscribed in the unit sphere, the latter leads to MN, which is a translational net.

4.1 Conical PP Meshes

The conical condition on top of the PP property is very restrictive. It is in general not achievable by optimization—see the discussion around Figure 23. An example where we nevertheless succeeded is shown by Figure 16. Here, optimization started from a conical mesh that is the union of patches, each of which enjoys regular grid combinatorics. We managed to optimize this mesh so all the short polylines contained in individual patches become planar (in the notation of Section 3.3, we achieved δf = 10− 7, δP, max  = 2.6 · 10− 6, δP, average = 3.3 · 10− 7).
Fig. 16.
Fig. 16. A smooth union of conical PP meshes, each of which exhibits regular combinatorics, with combinatorial singularities (yellow) occurring only at corner vertices of individual PP patches. The detail at right shows the torsion-free support structure associated to the individual PP pieces.
For design, we use a different approach based on an explicit description of the shapes of achievable meshes. The weighted normal images MN, \(M_N^\circ\) mentioned in the previous paragraph can be described completely (see Cases 1, 2 below). Degrees of freedom available for design are only contained in the 4th coordinate of the weighted face image that is not yet determined by the weighted normal image.
The continuous analogue of a conical PP mesh is a surface all of whose curvature lines are planar. Recall that the surface intersects the plane carrying a curvature line under a constant angle (Proposition 2.2). Orthogonality then implies that the Gauss image must be rather special: There are two pencils of planes (with their axes being polar to each other) that intersect S2 in exactly the circles mentioned above.
The discrete version of such a situation has been studied to a certain extent [Mesnil et al. 2018; Tellier et al. 2019; Tellier 2020]. We extend this work by proving the following statement, which is also illustrated by Figure 15:
Proposition 4.1.
Consider a conical quad mesh M of regular grid combinatorics that in addition enjoys the PP property. \(M_N^\circ\), MN shall be the weighted normal images derived from these properties.
Then there are two straight lines \(l,\bar{l}\) that are polar w.r.t. the unit sphere S2, and planes αil, \(\bar{\alpha }_j\supset \bar{l}\), such that the vertices \(n_{i,j}^\circ\) of \(M_N^\circ\) are contained in \(\alpha _i\cap \bar{\alpha }_j\). In particular, the mesh parameter lines of \(M_N^\circ\) lie on circles contained in planes αi, respectively, \(\bar{\alpha }_j\).
Proof.
The proof uses projective geometry, for which we refer, e.g., to [Berger 1987, Section 14.5]. We first establish a geometric fact concerning the projection of a parallelogram pqrs onto a quad p°q°r°s° in S2. First p, q, p°, q° lie in the 2D subspace [p, q], so the straight line p°∨q° intersects the 1D subspace [qp] in a point Spq, possibly at infinity. Since edges pq and rs are parallel, [qp] = [p, q]∩[r, s]. If vertices p°, q°, r°, s° happen to be contained in a plane β, then obviously Spq = [p, q]∩[r, s]∩β. This expression remains the same if edges pq and rs are exchanged, so Srs = Spq. If pqrs shares the edge rs with another parallelogram rsuv with analogous properties, then the same argument shows that Spq = Srs = Suv.
We apply this construction inductively to a row of parallelogram faces of MN. Since \(M_N^\circ\) has planar faces, all lines \(\lbrace n_{i+1,j}^\circ \vee n_{i,j}^\circ \rbrace _{j\in {\mathbb {Z}}}\) meet in a common point Si (see Figure 15). Similarly, lines \(\lbrace n_{i,j+1}^\circ \vee n_{i,j}^\circ \rbrace _{i\in {\mathbb {Z}}}\) meet in a common point \(\bar{S}_j\).
It is known that for a quad \(n_{i,j}^\circ , n_{i+1,j}^\circ , n_{i+1,j+1}^\circ , n_{i,j+1}^\circ\), inscribed in a circle, the intersection points Si, \(\bar{S}_j\) of opposite edges are conjugate. So \(S_i,\bar{S}_j\) are conjugate also w.r.t. the unit sphere, i.e., Si lies in the polar plane of \(\bar{S}_j\). Since a single Si lies in many such polar planes (one for each j), such a configuration is only possible if there is a straight line l carrying all Si’s. Reversing the argument, the points \(\bar{S}_j\) lie on the straight line \(\bar{l}\) polar to l.
Looking back, we have established that \(n_{i,j+1}^\circ\) lies in the plane spanned by \(n_{i,j}^\circ\) and l (because Sil), and so does \(n_{i,j-1}^\circ\) (because Si − 1l). By recursion, the entire parameter line \(\lbrace n_{i,j}\rbrace _{j\in {\mathbb {Z}}}\) is contained in that plane, which is labelled αi. Similarly, each parameter line \(\lbrace n_{i,j\vphantom{{\mathbb {Z}}\vphantom{{\mathbb {Z}}}}}\rbrace _{i\in {\mathbb {Z}}}\) is contained in plane \(\bar{\alpha }_j\).□
Remark 4.1.
The polar dual \((M_N^\circ)^*\) of \(M_N^\circ\) w.r.t. the unit sphere is combinatorially equivalent to M, and its faces are, by polarity, parallel to the faces of M. Therefore, we may recover M as a parallel mesh of \((M_N^\circ)^*\). Our design methods are not based on this approach, though.

4.1.1 Explicit Computation of Conical PP Meshes.

As to the relative position of lines \(l,\bar{l}\) that occur in Proposition 4.1, there are two cases:
Case (1).
One of \(l,\bar{l}\) is outside of the unit sphere S2, the other one intersects S2 in two points. The circles carrying the mesh’s parameter lines form a pair of orthogonal pencils. This is the situation shown by Figure 15.
Case (2).
The lines \(l,\bar{l}\) both touch S2 in the same point, while being orthogonal. The circles carrying the mesh parameter lines of M form a pair of orthogonal “parabolic” pencils.
We start with case (1) and determine the possible weighted normal images MN, as shown by Figure 15. We use a coordinate system adapted to the lines \(l,\bar{l}\) such that they are given by the following equations:
\begin{align*} l: x_2=d,x_3=0, \quad \bar{l}: x_1 = 0, x_2 = 1/d,\quad \ \text{where}\ d\gt 1. \end{align*}
The 2D subspaces \(\varepsilon ,\bar{\varepsilon }\) spanned by \(l,\bar{l}\) are the x1x2 plane, respectively, the x2x3 plane.
The faces of MN are parallelograms, and by the proof of Proposition 4.1 its edges are parallel to either ε or \(\bar{\varepsilon }\). The parameter lines of MN therefore lie in planes parallel to either ε or \(\bar{\varepsilon }\), and we have
\begin{align*} n_{i,j} = \begin{bmatrix} \varphi _1(u_i)\\ \varphi _2(u_i)\\ 0 \end{bmatrix} + \begin{bmatrix} 0\\ \psi _2(v_j) \\ \psi _3(v_j) \end{bmatrix} . \end{align*}
The usage of functions φ1, …ψ3 indicates that we wish to represent the vertices of the mesh MN as discrete sample of a continuous parametric surface. This is already known to be possible for the projection \(M_N^\circ\), because its parameter lines lie on circles. Backprojection into the aforementioned planes yields conics the parameter lines of MN are samples of. An elementary calculation reveals that
\begin{align*} n_{i,j} = n(u_i,v_j), \ \text{where}\ n(u,v)= \mbox{$\begin{bmatrix} e \sin u {+\cosh v} \\ {[}-.5ex] d \cos u + \cosh v\\ {[}-.5ex]{d\cos u+} e \sinh v \end{bmatrix}$} \!, \ e=\sqrt {d^2-1}. \end{align*}
This representation has already been given by Blaschke [1929]. The plane image MF in \({\mathbb {R}}^4\) has parallelogram faces like MN, so it reads
\begin{align} {\mathord {\sf f}}_{i,j} = {\mathord {\sf f}}(u_i,v_j), \quad {\mathord {\sf f}}(u,v)= \begin{bmatrix} n(u,v) \\ g(u)+h(v) \end{bmatrix}, \end{align}
(11)
where g, h are arbitrary. As d → ∞, we achieve a rotationally symmetric case:
\begin{equation} {\mathord {\sf f}}_{i,j} = {\mathord {\sf f}}(u_i,v_j),\quad {\mathord {\sf f}}(u,v)=\big (\sin u, \cos u, \sinh v, g(u)+h(v)\big)^T. \end{equation}
(12)
The mesh MN then lies in a cylinder with rotational symmetry about the x3 axis.
In case (2), we use a similar computation. We choose \(l,\bar{l}\) as lines parallel to the x1 and x2 axis that are tangent to the unit sphere in the north pole. The result is
\begin{align} {\mathord {\sf f}}_{i,j}={\mathord {\sf f}}(u_i,v_j),\ {\mathord {\sf f}}(u,v)= \Big [u, v ,\ {u^2+ v^2-1\over 2},\ g(u) + h(v)\Big ]^T\!\!. \end{align}
(13)
Apparently, MN is inscribed in the paraboloid \(2x_3=x_1^2+x_2^2-1\). The parameter lines are samples of parabolas contained either in planes x1 = ui or in planes x2 = vj. Projection onto S2 yields the circles carrying the mesh parameter lines of \(M_N^\circ\).

4.1.2 A Representation of Conical PP Meshes Adapted for Geometric Design.

Representations (11) and (13) show that the face planes of a conical PP mesh are samples of a 2D continuous family \({\mathord {\sf f}}(u,v)\). The envelope of this family of planes is a continuous surface x(u, v) approximating the mesh. It depends on the lines \(l,\bar{l}\) and on the functions g, h. The choice of \(l,\bar{l}\) amounts to specifying the size and position of x(u, v), while functions g, h determine its shape.
Using homogeneous coordinates (x1: …: x4) corresponding to Cartesian coordinates \({1\over x_4}(x_1,x_2,x_3)\), this envelope is computed via the 3-ary cross product of \({\mathord {\sf f}}(u,v)\) with its partial derivatives, namely, \(x(u,v)= {\mathord {\sf f}}\times {\mathord {\sf f}}_u\times {\mathord {\sf f}}_v\) (see Appendix).
Choosing the functions g(u), h(v) is not a task that can be left to the designer. There is unfortunately no good intuitive relation between g, h, on the one hand, and the geometric shape of the mesh, on the other hand. To gain better insight into the right choices, and to find a path towards a design tool, we re-parameterize both \({\mathord {\sf f}}(u,v)\) and n(u, v), starting with Case 1.
We first observe that n(u, 0) = (esin u + 1, dcos u, 0) is an ellipse with focal point in the origin. It has the polar coordinate representation
\begin{align*} (r(\varphi)\cos {\varphi },r(\varphi)\sin {\varphi },0) \quad \text{with}\quad r(\varphi)=\frac{e^2(\sin {\varphi }+d)}{e^2+\cos ^2{\varphi }}. \end{align*}
Likewise, n(0, v) is a hyperbola. It is contained in the x2x3 plane and has the polar coordinate representation
\begin{align*} (0,s(\psi)\cos {\psi },s(\psi)\sin {\psi }) \quad \text{with}\quad s(\psi)=\frac{e^2(d\cos {\psi }+1)}{e^2\cos ^2{\psi }-\sin ^2{\psi }}. \end{align*}
Note that we obtain the entire hyperbola as ψ ranges from 0 to 2π. The points at infinity are attained if tan 2ψ = e2.
The weighted normal image n(u, v) is symmetric w.r.t. the horizontal x1x2 plane containing the ellipse and is also symmetric w.r.t. the x2x3 plane containing the hyperbola.
Using φ, ψ as parameters to substitute u and v, we obtain
\begin{align*} \widetilde{n}(\varphi ,\psi) = \mbox{$\begin{bmatrix} r(\varphi)\cos \varphi \\ {[}-.3ex] r(\varphi) \sin \varphi + s(\psi)\cos \psi -d-1 \\ {[}-.3ex] s(\psi) \sin {\psi } \end{bmatrix}$}. \end{align*}
We have used that rπ/2) = d ± 1 and s(0) = 1 + d, s(π) = 1 − d. The above-mentioned ellipse and hyperbola are recovered as \(\widetilde{n}(\varphi ,0)\) and \(\widetilde{n}(\pi /2, \psi)\), respectively. They meet in the point \(\widetilde{n}(\pi /2,0)=(0,d+1,0)\).
At this point it is useful to re-parametrize also the weighted face image \({\mathord {\sf f}}(u,v)\) given by Equation (11):
\begin{align*} \widetilde{{\mathord {\sf f}}}(\varphi ,\psi) = \begin{bmatrix} \widetilde{n}(\varphi ,\psi) \\ r(\varphi) \widetilde{g}(\varphi)+ s(\psi) \widetilde{h}(\psi)-a(d+1) \end{bmatrix} \ \text{where}\ a=g\left(\frac{\pi }{2}\right)=h(0). \end{align*}
In this representation, functions \(\widetilde{g}(\varphi)\) and \(\widetilde{h}(\psi)\) have a geometric meaning. Let us first look at ψ = 0. The planes \({\mathord {\sf f}}(\varphi ,0)\) have the implicit equation
\begin{align} x_1 \cos {\varphi } + x_2 \sin {\varphi } + \widetilde{g}(\varphi) =0. \end{align}
(14)
Their envelope is a vertical cylinder whose intersection with the x1x2 plane is a planar curve with support function \(\widetilde{g}(\varphi)\), as can be clearly seen from Equation (14). Analogously, the planes \({\mathord {\sf f}}(\pi /2,\psi)\) have the implicit equation
\begin{align} x_2 \cos {\psi }+x_3\sin {\psi } + \widetilde{h}(\psi)=0. \end{align}
(15)
Their envelope is a cylinder whose rulings are parallel to the x1 axis and that intersects the x2x3 plane in a curve whose support function is \(\widetilde{h}(\psi)\).
The two cylinders mentioned here are tangent to the surface x(u, v) along parameter lines x(u, 0) and x(0, v) by construction. Thus, they yield the apparent contour of the surface x(u, v) when viewed in the x3 direction and the x1 direction. However, even more is true. Since the parameter lines of x(u, v) are planar principal curvature lines, Proposition 2.2 implies that parameter lines x(u, 0) and also x(0, v) are orthogonal planar sections of the design surface x(u, v).
We have thus reduced the design of the mesh (respectively, the design of the surface x(u, v)) to the design of its principal planar sections. These can be chosen by the user. We recover the support functions \(\widetilde{g}(\phi)\) and \(\widetilde{h}(\psi)\) (see Equation (14)) and enter them in the explicit representation of the weighted face image \(\widetilde{{\mathord {\sf f}}}(\phi ,\psi)\). A conical PP mesh is recovered from \(\widetilde{{\mathord {\sf f}}}(\phi ,\psi)\) by arbitrary sampling; Figure 17 shows an example of this.
Fig. 17.
Fig. 17. Examples of conical PP meshes designed via their principal planar sections, using the explicit representations derived in Section 4.1.1 and Section 4.1.2.
A similar computation can be performed in Case 2. Here, \(n(u,0)=(u, 0, \frac{1}{2}(u^2-1))\) is a parabola with focal point in the origin. Its polar coordinate representation is (r(φ)cos φ, 0, r(φ)sin φ), with r(φ) = (sin φ + 1)/cos 2φ. Also, n(0, v) is a parabola with polar coordinate representation (0, s(ψ)cos ψ, s(ψ)sin ψ), where s(ψ) = (sin ψ + 1)/cos 2ψ. From here, the computation of conical PP meshes is analogous to Case 1.

4.2 Conical P Meshes

4.2.1 Continuous Surfaces Analogous to Conical P Meshes.

For applications, already the P property may be useful, where only one of the two families of mesh parameter lines is planar. We therefore study conical P meshes in more detail. Their continuous counterparts are principal parametrizations x(u, v) of surfaces with the additional property that each v parameter line is contained in a plane W(u).
Recall Prop 2.2: The angle between the surface and W(u) is constant along the parameter line, so it is a function α(u). It follows that the v parameter lines of the unit normal vector image n(u, v) are circles. By the principal property, derivatives nu, nv are orthogonal, so the tangents of u parameter lines along a v parameter line form the rulings of a cone with a vertex s(u). See inset figure.

4.2.2 Geometry of Conical P Meshes.

The case of conical P meshes is analogous to the continuous case described in the previous paragraph, but as it turns out, only approximately so. If all mesh parameter lines \(\lbrace v_{i,j}\rbrace _{j\in {\mathbb {Z}}}\) are planar, then the first paragraph of the proof of Proposition 4.1 applies to the weighted normal image \(M_N^\circ\): The lines \(\lbrace n_{i+1,j}^\circ \vee n_{i,j}^\circ \rbrace _{j\in {\mathbb {Z}}}\) spanned by transverse edges meet in the vertex Si of a discrete cone. This situation is already shown in Figure 15. The difference to the PP case is that now we cannot conclude that all Si’s lie on a straight line. Nor are parameter lines of \(M_N^\circ\) circular.
For the applications we are interested in, meshes enjoy a certain amount of fairness, and their edges can be interpreted as derivatives. It is therefore reasonable to require that one family of mesh parameter lines of \(M_N^\circ\) is circular.

4.2.3 Design of Conical P Meshes. Channel Surfaces.

In theory, we could design a conical P mesh M from a sequence of cone vertices Si, which yields \(M_N^\circ\). M itself is found as a parallel mesh of \((M_N^\circ)^*\) according to Remark 4.1. This approach is not practical, however. We propose a different method of design in stages; from a guiding sequence of spheres to a channel surface to a general P surface. This method is based on the geometry of oriented spheres, so we will be able to use Laguerre geometry, as introduced by Section 2.1.
Step 1. The user chooses a sequence of (oriented) spheres by choosing their center and radius r. Using coordinates as in Equation (1), this data is stored as vectors (xj, yj, zj, rj) and is considered as control polygon of a B-spline curve to create a continuous family of spheres Z(t) = (z1(t), …, z4(t)). We use the tangential distance of Equation (2) to uniformly sample Z(t) and get a dense sequence of spheres Z1, Z2, …
Step 2.
We wish to find a watertight union of cones Cj that serves as a discrete envelope of the sphere sequence Zj. We determine the cone Cj by its tangency to both Zj and Zj + 1 and clip it along the planes Wj, Wj + 1 containing the respective intersection with neighbors Cj − 1 and Cj + 1. Practitioners of Laguerre geometry [Pottmann and Peternell 1998] know that the points contained in the plane Wj are exactly those spheres of radius 0 that obey
\begin{align} &#x00026; \ left\ llangleX-Z_j,H_j \ right\ rrangle=0,\ x_4 = 0, \ \text{where} \nonumber \nonumber\\ &#x00026; H_j = E_j+E_{j+1},\quad E_j = {1\over d(Z_j,Z_{j-1})}(Z_j-Z_{j-1}). \end{align}
(16)
By comparing this formula with Euclidean geometry, we see that Hj is the normal vector of a bisector plane (in the sense of the Minkowski inner product) of edges Zj − 1Zj and ZjZj + 1. This computation is preferred over computing the intersection of algebraic surfaces Cj, Cj + 1, because it is stable and it automatically yields the correct one of the two components of the complete intersection.
Step 3. We replace one cone, say, \(C_{j_0}\), by a sequence of tangent planes, clipped by planes \(W_{j_0-1}\) and \(W_{j_0}\). This yields one row in a quad mesh enjoying two planar mesh parameter lines. We propagate this construction throughout the entire sequence of cones and get a quad mesh with the P property. It is even conical, since all faces incident with a vertex vijWj are tangent to the sphere Zj. Some results can be seen in Figure 18.
Fig. 18.
Fig. 18. Design of conical P meshes via the channel surface approach of Section 4.2.3. Here, we show Steps 2+3 of the construction. In the top row, the radius function is the same for both examples shown, but the spine curve is different. In the bottom row, the reverse is true.
Step 4. Here, we ask the designer for input again. We select a plane \(W_{j_0}\) and change the circular profile curve of the channel surface to an arbitrary profile curve. It is replaced by a profile polygon whose edges are parallel to the edges of the channel surface’s profile. We incrementally propagate this change to neighbors, maintaining the property that planes Wj carry mesh parameter lines. The conical property is not destroyed, because the new mesh is parallel to the original one. Figures 19 and 20 show examples created in this way. Section 4.3 will discuss how further transformations are applied.
Fig. 19.
Fig. 19. Geometric design of conical P meshes via the channel surface approach of Section 4.2.3. Step 4 of the construction consists of choosing a profile curve and propagating it along the spine curve. Afterwards, Laguerre transforms and mesh parallelity are applied; see Section 4.3.
Fig. 20.
Fig. 20. Editing conical P meshes via changing profiles (Step 4 in the channel surface approach to design).
Remark 4.2 (.
Inflection Points in Profiles) The profile of Figure 19, right, features inflection points. Such a profile can be edgewise parallel to a convex source profile only if the latter is traversed forwards for a time, and then backwards, and so on, changing direction every time an inflection point is reached.
Remark 4.3 (.
Semi-discrete Surface Representations) The semi-discrete surface representation in Step 2 is interesting in its own right for architecture applications. It can be extended to profiles in the form of arc splines, leading to surfaces consisting of cone patches.
Remark 4.4 (.
Interpretation in Terms of Rotation-minimizing Frames) We constructed spheres Zj as a uniform sample of a curve. If this uniformity is strictly true, then Minkowski distances d(Zj − 1, Zj) are equal, and Equation (16) shows there is a Minkowski reflection σj (in the bisector plane of edges Zj − 1Zj and ZjZj + 1) which obeys σj(Zj − 1) = Zj + 1. Obviously also cones are mapped by σj(Cj − 1) = Cj. When discretizing cones in Step 3 by using their tangent planes, these, too, are related by σi. A further modification in Step 4 replaces meshes by parallel meshes (Figure 19)—we now have general discrete developables in between planes Wj, Wj + 1. Still, the passage from one to the next is performed by σi. This reveals that the evolution of profiles as shown by Figure 19 is a discrete+Minkowski version of the motion of a rotation-minimizing frame along the discrete curve {Zi}. For the RMF in general, we refer to Bergou et al. [2008], and for a treatment via reflections, see Wang et al. [2008].

4.2.4 Conical PP Meshes as Special Cases of Conical P Meshes.

The design procedure of Section 4.2.3 is capable of creating conical PP meshes. If the spine curve lies in a plane M, and all spheres Zi touch a plane T, then all spheres and cones involved are symmetric w.r.t. M, and the vertices of cones Ci lie in the line MT. The intersection of an arbitrary pair of tangent planes of Ci meets MT. For this reason the mesh constructed in Step 3 has edges that are either contained in the planes Wj or edges lying in a plane through MT. Thus, all mesh polylines are planar, and we have constructed a conical PP mesh. Examples are shown by Figure 21.
Fig. 21.
Fig. 21. Design of conical PP meshes via the channel surface approach of Sections 4.2.3 and 4.2.4. We demonstrate the results of Steps 2+3 with the additional ingredient of a common tangent plane T to ensure the PP property. The examples in the top row have the same spine curve but different plane T; for the bottom row the spine is changing, but the plane T is the same. In the language of Section 4.1.1, this belongs to Case 1.
Fig. 22.
Fig. 22. Design of conical PP meshes via the channel surface approach of Sections 4.2.3, 4.2.4. Like in Figure 21, we demonstrate the results of Steps 2+3 with an additional ingredient to ensure the PP property. We show the limit case where the two tangent planes exhibited by Figure 21 have become one vertical plane, plus the requirement of symmetry w.r.t. the horizontal plane. In the language of Section 4.1.1, this belongs to Case 2.
Another special case occurs if all spheres Zi have the same radius r. Then the cones Ci are cylinders, and propagation of a mesh along the spine curve according to Step 3 is essentially done by the movement of a rotation-minimizing frame (see Remark 4.4). We mention a third special case: If the spine curve lies in a horizontal base plane, then planes Wj are vertical. This may be useful for architectural design.

4.3 Design of Conical P Meshes by Transformations

In Section 4.2, we established the geometry of conical meshes that in addition enjoy the P property. We learned that neither mesh parallelism nor Laguerre transforms destroy these properties. Since the former do not change face normal vectors and the latter cause them to undergo a Möbius transform, we can simultaneously apply both kinds of transforms for geometric modeling without having to implement general Laguerre transforms.
We use homogeneous coordinates N = (n1: …: n4) for a normal vector \({1\over n_4}({n_1},{n_2},{n_3})\). The condition of being a unit vector reads \(n_1^2+n_2^2+n_3^2=n_4^2\) and similar to Equation (3) can be written as NTJN = 0, where \(J=\operatorname{diag}(1,1,1,-1)\). Section 2.1.2 states that a Möbius transform acts as NAN, where the matrix A obeys ATJA = J.
Consider now a conical P mesh (V, E, F). Each face f has a normal vector Nf = (n1: …: n4) and is contained in a plane. The equation of that plane, using Cartesian coordinates x = (x1, x2, x3), is written as \(\sum \nolimits _{i=1}^3 n_i x_i + n_4 d_f = 0\). In block matrix notation, this reads
\begin{align*} \big [{\textstyle {x\atop d_f}}\big ]\vphantom{|}^T \cdot N_f=0. \end{align*}
When transforming the mesh, each vertex v contained in a certain face f gets mapped to a corresponding vertex \(\bar{v}\) contained in the respective face \(\bar{f}\) with normal vector \(\bar{N}_f\) and scalar \(\bar{d}_f\). Consequently,
\begin{align} \big [{\textstyle {\bar{v}\atop \bar{d}_f}}\big ]\vphantom{|}^T \cdot AN_f = 0 \end{align}
(17)
holds whenever vf. These equations together with ATJA = J represent a system of quadratic constraints on the variables
\begin{align*} A\in {\mathbb {R}}^{4\times 4},\quad \lbrace \bar{d}_f\rbrace _{f\in F}, \quad \lbrace \bar{v}\rbrace _{v\in V}. \end{align*}
The number of these variables is 4 × 4 + |F| + 3|V|. The user’s input during interactive modeling can be incorporated as further constraints. Note that the full Laguerre transformation does not occur in this setup at all, only the Möbius transform, as it operates on normal vectors.
The constraint system described here is quadratic and could be treated by the method of guided projection [Tang et al. 2014], using a combination of proximity to the previous state and fairness as regularizer. Our implementation is even simpler. When A is considered fixed, constraints become linear. So are user-imposed position constraints, and the entire system is solved in a least-squares sense, together with the aforementioned regularizers. In this way, the parallel meshes of Figure 19 have been created. We apply the same principle with A as a variable and disregarding the constraint ATJA = J. A subsequent projection onto the set of admissible matrices can be performed via a Minkowski-polar decomposition [Higham 2003; Kintzel 2005]; see Figures 19 and 24 for examples.

5 Conclusion

In this article, we have shown many different approaches to the geometric design of meshes with planar faces equipped with various kinds of torsion-free support structures. In particular, we treated planarity of mesh parameter lines (properties P and PP) and angle conditions that lead to principal meshes. The more conditions are imposed, the more special the methods of geometric design have to be. In some highly constrained cases (conical PP meshes), we employed an analogy to the continuous case to find explicit constructions of such meshes. In other cases (PP meshes), we showed to which extent design freedom exists, and we were able to suggest a spline-based design method. Only if comparatively few special properties are imposed, straightforward global optimization can be used. This is the case where meshes already have planar faces and we wish to additionally impose the P property.
Evaluation.. In this article, we discuss the geometric design of highly constrained meshes, which is not easy with previous methods. Methods based on optimization in principle can be extended to include the P and PP properties, and indeed this works in some cases (see Section 3.3). For more highly constrained meshes, however, such as the conical meshes, simply adding the P and PP properties as optimization targets will likely not succeed; see Figure 23 for an example for making a PP mesh conical. Similarly, forcing a principal mesh to enjoy the PP property causes optimization to fail.
Fig. 23.
Fig. 23. Optimizing the PP mesh at left so in addition it becomes conical, its shape changes dramatically (center). An effort to optimize such that even the previous shape is retained is unsuccessful: The result at right exhibits self-intersections, general lack of fairness, and non-planar faces.
Fig. 24.
Fig. 24. Editing the conical P mesh at left by applying a profile change (center) and an additional Laguerre transformation (right).
Fig. 25.
Fig. 25. Tang et al. 2014 exhibit a mesh with planar faces following the shape of the Great Court roof of the British Museum. We additionally optimized it for the P property, making one half of mesh parameter lines planar.
Even if optimization succeeds, it is hardly an efficient way of design. This is not only because optimization is time-consuming; an additional reason is that a conical mesh with the P or PP property corresponds to a surface whose principal curvature lines are planar. The shapes of such meshes are therefore restricted, and achieving the P or PP property via optimization inevitably changes the shape of the mesh. It is hard to predict if optimization succeeds at all, and if it does, how much it will change the shape.
For this reason, we do not expect that previous methods for constructing conical meshes can be extended to accommodate planar polylines. The same goes for torsion-free support structures, which, like conical meshes, are in relation to principal curvature lines [Pottmann et al. 2007]. To nevertheless enable design, we developed the classification and construction results of Section 4.
Limitations. The different methods for design presented in this article each have their limitations. Optimization for the P property (Section 3.3) will likely work only if planarity of faces is already established and mesh polylines can be interpreted as fair discrete curves—otherwise, one cannot expect that straightforward optimization can achieve planar faces. This is because a mesh with planar faces is analogous to a network of conjugate curves on a surface, and so this property has implications on the mesh connectivity [Liu et al. 2006]. Other methods of design are based on faces, which can be called a dual approach to the problem (Section 3.2). Its limitations are mostly the difficulties inherent in handling dual elements, viz., planes. Finally, the highly constrained meshes discussed in Section 4 experience a fundamental geometric limitation: They can no longer assume arbitrary shapes and have to be accessed by explicit constructions. While this is certainly a limitation from the mathematical viewpoint, it may not feel like one for applications in architecture, where one interactively explores the design space.
Summing up, we hope that this comprehensive discussion together with proposals for geometric design will be helpful for the actual realization of freeform architectural designs.

Appendix

Explicit Computation of Conical PP Surfaces and Their Geometric Design.

The smooth surface x(u, v) referred to in Section 4.1.2 can be computed explicitly and has the following form: In case (1), we get
\begin{align*} \begin{bmatrix} x_1\\ x_2\\ x_3\\ x_4 \end{bmatrix} = \begin{bmatrix} d[(g+h)\sin {u}\cosh {v}+\dot{g}\cos {u}\cosh {v}-\dot{h}\sin {u}\sinh {v}]+\dot{g}\\ e[(g+h)\cos {u}\cosh {v}-\dot{g}\sin {u}\cosh {v}-\dot{h}\cos {u}\sinh {v}]\\ -(g+h)\cos {u}\sinh {v}+\dot{g}\sin {u}\sinh {v}+\dot{h}\cos {u}\cosh {v}+d\dot{h}\\ -e(\cos {u}+d\cosh {v}) \end{bmatrix}. \end{align*}
The most relevant information contained in this formula is the fact that x(u, v) depends on functions g, h linearly. Case (2) is similar:
\begin{align*} {1\over x_4} \begin{bmatrix} x_1\\ x_2\\ x_3 \end{bmatrix} = {1\over u^2+v^2+1} \begin{bmatrix} (u^2-v^2-1)\dot{g}+2uv\dot{h}-2u(g+h)\\ (v^2-u^2-1)\dot{h} +2uv\dot{g} -2v(g+h)\\ 2(g+h-u\dot{g}-v\dot{h})\\ \end{bmatrix}. \end{align*}
The planes that carry parameter lines are given by the partial derivatives \({\mathord {\sf f}}_u,{\mathord {\sf f}}_v\), in direct analogy to the discrete case. In case (1), we have \({\mathord {\sf f}}_u=(e\cos {u},-d\sin {u},0,\dot{g})\), so the planes V(u) are parallel to the x3-axis and are tangent to a curve in the x1x2 plane. A similar computation shows that the planes carrying the v parameter lines read \({\mathord {\sf f}}_v=(0,\sinh v,e\cosh v,\dot{h})\). They are parallel to the x1 axis and are tangent to a certain envelope curve in the x2x3 plane.
The significance of this remark is the following: If the geometric shapes of the aforementioned curves are given, then functions \(\dot{g}(u)\), \(\dot{h}(v)\) can be reconstructed: Find the point parameter value u where \(\left[{e\cos u\atop \!-d\sin u}\right]\) is a normal vector and read off \(\dot{g}(u)\) from the curve’s tangent there; subsequently reconstruct g by integration. An analogous procedure works for h. We conclude that apart from offsets caused by the ambiguity in integration, the surface x(u, v) is uniquely determined by the shape of two 2D curves.
It is not difficult to discuss simple cases; e.g., when both curves degenerate to points, x(u, v) is a Dupin cyclide or a sphere.

Supplementary Material

planarbeams-video (planarbeams-video.mp4)
Supplementary video

References

[1]
Sigrid Adriaenssens, Laurent Ney, Eric Bodarwe, and Chris J. K. Williams. 2012. Finding the form of an irregular meshed steel and glass shell based on construction constraints. J. Archit. Eng. 18 (2012), 206–213.
[2]
Rami Ballas. 2003. The Sail Tower, Haifa, Israel. Struct. Eng. Int. 13, 3 (2003), 155–157.
[3]
Marcel Berger. 1987. Geometry II. Springer.
[4]
Miklós Bergou, Max Wardetzky, Stephen Robinson, Basile Audoly, and Eitan Grinspun. 2008. Discrete elastic rods. ACM Trans. Graph. 27, 3 (2008), 63:1–12.
[5]
Wilhelm Blaschke. 1929. Vorlesungen über Differentialgeometrie. Vol. 3. Springer.
[6]
Alexander Bobenko, Helmut Pottmann, and Thilo Rörig. 2020. Multi-nets: Classification of discrete and smooth surfaces with characteristic properties on arbitrary parameter rectangles. Discr. Computat. Geom. 63 (2020), 624–655.
[7]
Alexander I. Bobenko and Yuri B. Suris. 2007. On organizing principles of discrete differential geometry. Geometry of spheres. Russ. Math. Surv. 62 (2007), 1–43.
[8]
Alexander I. Bobenko and Yuri B. Suris. 2008. Discrete Differential Geometry. Integrable Structure. American Mathematics. Society.
[9]
Ossian Bonnet. 1853. Mémoire sur les surfaces dont les lignes de courbure sont planes ou sphériques. J. Ecole Impériale Polytechnique 20 (1853), 118–81.
[10]
Thomas Cecil. 1992. Lie Sphere Geometry. Springer.
[11]
Gaston Darboux. 1896. Leçons sur la théorie générale des surfaces. Gauthier-Villars.
[12]
Manfredo do Carmo. 1976. Differential Geometry of Curves and Surfaces. Prentice-Hall.
[13]
Gershon Elber and Myung-Soo Kim. 1998. The bisector surface of rational space curves. ACM Trans. Graph. 17, 1 (1998), 32–49.
[14]
Yerab Ermias, Bar Shabtai, and Peter Szerzo. 2013. The courtyard roof of the museum of Hamburg History. In Evolution of German Shells (2013 Course and Exhibition). Department of Civil & Environmental Engineering, Princeton University.Retrieved from http://shells.princeton.edu/Ham.html.
[15]
Nicholas Higham. 2003. J-orthogonal matrices: Properties and generation. SIAM Rev. 45 (2003), 504–519.
[16]
Ulric Kintzel. 2005. Procrustes problems in finite dimensional indefinite scalar product spaces. Lin. Algebra App. 402 (2005), 1–28.
[17]
Hippolyte-Guillaume Lemonier. 1868. Mémoire sur les Surfaces Dont les Lignes de Courbure Sont Planes ou Sphériques. Thunot, Paris.
[18]
Yang Liu, Helmut Pottmann, Johannes Wallner, Yong-Liang Yang, and Wenping Wang. 2006. Geometric modeling with conical meshes and developable surfaces. ACM Trans. Graph. 25, 3 (2006), 681–689.
[19]
Kaj Madsen, Hans Bruun Nielsen, and Ole Tingleff. 2004. Methods for Non-linear Least Squares Problems (2nd ed.). Technical University, Denmark.
[20]
James McCrae, Karan Singh, and Niloy J. Mitra. 2011. Slices: A shape-proxy based on planar sections. ACM Trans. Graph. 30, 6 (2011), 1–12.
[21]
Romain Mesnil, Cyril Douthe, Olivier Baverel, and Bruno Léger. 2017. Marionette meshes: Modelling free-form architecture with planar facets. Int. J. Space Struct. 32 (2017), 184–198.
[22]
Romain Mesnil, Cyril Douthe, Olivier Baverel, and Bruno Léger. 2018. Morphogenesis of surfaces with planar lines of curvature and application to architectural design. Autom. Construct. 95 (2018), 129–141.
[23]
Gaspard Monge. 1809. Application de l’Analyse a la Géométrie. Bernard, Paris.
[24]
Martin Peternell. 2000. Geometric properties of bisector surfaces. Graph. Models 62 (2000), 202–236.
[25]
Helmut Pottmann, Yang Liu, Johannes Wallner, Alexander Bobenko, and Wenping Wang. 2007. Geometry of multi-layer freeform structures for architecture. ACM Trans. Graph. 26, 3 (2007), 65:1–11.
[26]
Helmut Pottmann and Martin Peternell. 1998. Applications of Laguerre geometry in CAGD. Comput.-aid. Geom. Des. 15 (1998), 165–168.
[27]
Helmut Pottmann and Johannes Wallner. 1999. Approximation algorithms for developable surfaces. Comput.-aid Geom. Des. 16 (1999), 539–556.
[28]
Volker Schmid, Jan-Peter Koppitz, and Anja Thurik. 2011. Neue konzepte im holzbau mit furnierschichtholz–die holztragkonstruktion des metropol parasol in sevilla. Bautechnik 88 (2011), 707–714.
[29]
Hans Schober. 2015. Transparent Shells: Form, Topology, Structure. Ernst & Sohn.
[30]
Yuliy Schwartzburg and Mark Pauly. 2013. Fabrication-aware design with intersecting planar pieces. Comput. Graph. Forum 32 (2013), 317–326.
[31]
Jospeh-Alfred Serret. 1853. Mémoire sur les surfaces dont toutes les lignes de courbure sont planes ou sphériques. J. Math. Pures et Appliqu. 18 (1853), 113–162.
[32]
Werner Sobek and Lucio Blandini. 2010. The Mansueto library—Notes on a glazed steel grid shell from design to construction. In Challenging Glass 2. TU Delft, 179–185.
[33]
Chengcheng Tang, Xiang Sun, Alexandra Gomes, Johannes Wallner, and Helmut Pottmann. 2014. Form-finding with polyhedral meshes made simple. ACM Trans. Graph. 33, 4 (2014), 70:1–9.
[34]
Xavier Tellier. 2020. Morphogenesis of Curved Structural Envelopes under Fabrication Constraints. Ph.D. Dissertation. University Paris-Est.
[35]
Xavier Tellier, Cyril Douthe, Laurent Hauswirth, and Olivier Baverel. 2019. Surfaces with planar curvature lines: Discretization, generation and application to the rationalization of curved architectural envelopes. Autom. Construct. 106 (2019).
[36]
Etienne Vouga, Mathias Höbinger, Johannes Wallner, and Helmut Pottmann. 2012. Design of self-supporting surfaces. ACM Trans. Graph. 31, 4 (2012), 87:1–11.
[37]
Wenping Wang, Bert Jüttler, Dayue Zheng, and Yang Liu. 2008. Computation of rotation minimizing frames. ACM Trans. Graph. 27 (2008), 2:1–18.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Graphics
ACM Transactions on Graphics  Volume 42, Issue 2
April 2023
210 pages
ISSN:0730-0301
EISSN:1557-7368
DOI:10.1145/3563904
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 November 2022
Online AM: 03 September 2022
Accepted: 12 August 2022
Revised: 08 July 2022
Received: 02 November 2021
Published in TOG Volume 42, Issue 2

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Quad mesh
  2. support structure
  3. planar beams
  4. discrete differential geometry
  5. architectural geometry
  6. Laguerre geometry

Qualifiers

  • Research-article
  • Refereed

Funding Sources

  • Austrian Science Fund
  • Vienna Science and Technology Fund
  • KAUST

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1,331
  • Downloads (Last 6 weeks)133
Reflects downloads up to 08 Feb 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Login options

Full Access

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media