Octahedral Frames for Feature-Aligned Cross-Fields
Abstract.
We present a method for designing smooth cross fields on surfaces that automatically align to sharp features of an underlying geometry. Our approach introduces a novel class of energies based on a representation of cross fields in the spherical harmonic basis. We provide theoretical analysis of these energies in the smooth setting, showing that they penalize deviations from surface creases while otherwise promoting intrinsically smooth fields. We demonstrate the applicability of our method to quad-meshing and include an extensive benchmark comparing our fields to other automatic approaches for generating feature-aligned cross fields on triangle meshes.

1. Introduction
-rotationally symmetric (RoSy) tangential vector fields over surfaces are ubiquitous in computer graphics. 2-RoSy fields can be used to generate stripe patterns due to their ambivalence to rotation by about the normal. 4-RoSy fields (cross fields) are heavily used in both surface parameterization and quadrilateral (quad) meshing, thanks to their symmetry with respect to rotations by about the surface normal.
Depending on the application, -RoSy field design algorithms must trade off between several desirable properties of the field. In almost all cases, -RoSy fields are expected to be as smooth as possible. For surfaces with boundary, constraints on how the field aligns to the boundary are common, and for artistic applications, users may wish to prescribe a sparse set of streamlines that the field must follow. For meshing applications, alignment of -RoSy fields to salient geometric features is also desirable as a means to identify or preserve mesh detail. Our focus will be on improving this latter aspect for the important case of -RoSy fields.
There are two broad strategies for achieving feature alignment. The first is to optimize only for smoothness, under the assumption that a well-chosen functional for measuring cross-field smoothness will automatically penalize fields that fail to align to geometric features. The most commonly-used smoothness functionals (including the Dirichlet energy and its variants) are intrinsic, and recover solutions that are unique only up to rotation [Knöppel et al., 2013]. These are ambivalent to isometric deformations of the surface and ignore extrinsic features such as creased folds.
An alternative strategy is to include energy terms that explicitly enforce alignment to an input guiding field of principal curvature directions during cross-field design [Knöppel et al., 2013; Brandt et al., 2018]. Drawbacks include the difficulty of robustly computing principal curvature directions on noisy meshes, the fact that forcing alignment to a guiding field based on local geometry may exclude cross-field designs that are globally more optimal, and more critically the fact that principal curvature directions are often different from features e.g. Figure 2.


Our main observation is that neither of the above strategies adequately identify those features most important to generating high-quality quad meshes. Often the surface being modelled is constructed from smooth patches that are joined along sharp extrinsic feature curves where the normal direction is discontinuous or changes rapidly. On the one hand, such features are invisible to intrinsic smoothness functionals; on the other, the orientation of the feature curves often contradict that of nearby curvature lines.
Consider the surfaces shown in Figure 2: Neither existing strategy will promote alignment to the features curves shown in red. Both of these shapes are developable away from a sparse set of cone singularities at the corners; the gaussian curvature is nearly zero at creased edges and curved facets, and so purely intrinsic approaches have no hope of aligning to the creases. Augmenting with a guiding field based on extrinsic curvature is counter-productive, as the curvature lines (blue) are not compatible with the surface’s more important crease features curves (red).
We approach feature alignment in a new way, which detects and aligns cross fields to sharp features in a stable fashion. Our method is based on an extrinsic representation of cross fields using spherical harmonic (SH) basis functions. SH functions have been used successfully in volumetric octahedral field problems for hexahedral meshing [Solomon et al., 2017; Huang et al., 2011; Ray et al., 2016], and we argue that this representation is well-suited not only for computing octahedral fields in volumes but also for field computation on surfaces. In particular, we apply an SH representation of octahedral frames, or frames of three orthogonal directions in , proposed by Huang et al. [2011]; when one of its directions is constrained to the surface normal, it exhibits the same symmetry as a two-dimensional cross. We use this fact to devise a class of cross field energies that promote intrinsic smoothness in smooth regions of the surface. Over sharp creases, however, our energy aligns the field to the crease direction, achieving automatic feature alignment without the need for explicit computation of extrinsic curvature directions or feature curves.
Contributions
In this work, we
-
•
introduce spherical harmonic functions for the computation of surface cross fields;
-
•
propose a family of field smoothness energies whose optima are feature-aligned cross fields;
-
•
provide a theoretical analysis of the behavior of a few important members of this family; and
-
•
introduce cross fields with soft normal alignment for increased versatility/robustness.
Our approach is able to extract feature-aligned fields with comparable levels of efficiency to those of purely intrinsic algorithms. We test our algorithm extensively on over 200 different meshes with results in both §6 and in supplementary materials. We leverage our algorithm to produce feature-aligned cross fields and demonstrate their usefulness for quad meshing.
2. Related Work
The generation of tangential -RoSy fields over surfaces has many applications in computer graphics ranging from surface BRDF modification [Brandt et al., 2018] to meshing [Jakob et al., 2015; Bommes et al., 2009] to texture synthesis [Knöppel et al., 2015] and sketch-based modeling [Iarussi et al., 2015; Bessmeltsev and Solomon, 2019]. Surveys of -RoSy field design methods are provided in [Vaxman et al., 2016] and [de Goes et al., 2015].
2.1. Cross Field Design
Cross fields () have been especially well-studied since their -symmetry allows them to behave like local coordinate systems, resulting in intuitive seamless surface parameterizations.
Methods to compute intrinsically-smooth cross fields with alignment and singularity constraints were studied by Ray et al. [2008], Crane et al. [2010] and Knöppel et al. [2013]. More similar to our work, Jakob et al. [2015] instead formulate an extrinsic smoothness functional on cross fields, in an attempt to automatically align to surface features. Their method penalizes an extrinsic distance between neighboring crosses that does not use a shared tangent space or connection. The resulting energy is non-convex but is minimized to local optimality, often resulting in more singularities than necessary. Huang and Ju [2016] analyze this extrinsic energy, and find that it can be decomposed into an energy expressed in terms of intrinsic twisting and alignment to extrinsic curvature directions. We perform a similar analysis of the energy we introduce in the supplemental documents.
When using cross fields for quad mesh parameterization or processing, methods [Bommes et al., 2009; Campen et al., 2016; Knöppel et al., 2013; Brandt et al., 2018] often promote feature alignment by including a loss term penalizing disagreement with curvature directions. However, as we argue in the introduction and illustrate in Figure 2, alignment to curvature directions is often less important than alignment to sharp creases. Other parameterization methods such as [Bommes et al., 2009; Bommes et al., 2013; Campen et al., 2015] allow feature alignment but just assume that such feature curves are provided as input.
2.2. Octahedral Fields and Volumetric Representations
The three-dimensional generalization of a cross field is an octahedral field. Octahedral fields are often used in volumetric problems like hexahedral meshing [Nieser et al., 2011]. A single octahedral frame consists of three mutually-orthogonal vectors and their negations. Huang et al. [2011] introduced a particularly convenient representation of an octahedral frame as a rotation of the spherical function , encoded by coefficients in the spherical harmonic (SH) basis. Ray et al. [2016] used this representation to generate volumetric normal-aligned octahedral fields, and Solomon et al. [2017] combined the SH representation with the boundary element method to remove the need for a volumetric mesh. Both of these methods use normal-alignment constraints at the surface to enforce alignment of the octahedral frame with the volume’s boundary.
While there is no canonical three-dimensional generalization of arbitrary -RoSy fields, the spherical harmonic representation allows for frames that mimic the symmetries of all platonic solids [Shen et al., 2016], including octahedral fields [Solomon et al., 2017; Liu et al., 2018; Corman and Crane, 2019]. Algebraic characterization of the orbit of under the space of rotations as a subset of all possible SH coefficients was presented by Palmer et al. [2019] and Chemin et al. [2018].
3. Preliminaries
Since our formulation relies heavily on both the spherical harmonic representation of octahedral frames and vectorial total variation, we present a preliminary introduction to these topics.
3.1. Spherical Harmonic (SH) Octahedral Frames
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/a63885a1-750c-4e6b-bdf8-d85aa4c063af/x1.png)
As introduced by Huang et al. [2011], the canonical axis-aligned octahedral frame can be represented by spherical harmonics as a function written as where denotes the basis for real spherical harmonics. The function can be understood as the scaled projection of onto the fourth band () of spherical harmonics. Written differently, we can encode as a vector of coefficients in the full basis of fourth-band spherical harmonics :
The space of octahedral frames can be described as all rotations of the canonical octahedral frame, that is, the orbit of under the group of 3D rotations [Palmer et al., 2019, Definition 3.5]. We write this via exponentiation of the Lie algebra elements: the set of octahedral frames is
where and are the angular momentum operators expressed in the basis of band-four spherical harmonics. In this basis, are each matrices. The angular momentum operators are explicitly written in supplementary materials, §4. In this description, can be interpreted as an axis-angle representation of rotation, with corresponding rotation matrix . denotes the skew-symmetric matrix that acts as . Accordingly, encodes the octahedral frame whose directions are rotated by , where denotes normalization (see inset above).
Using such SH rotations, we can present an alternative interpretation of the octahedral frame as the sum of three orthogonal SH lobe-shaped functions. The -aligned lobe is and is depicted in the inset. Lobes can be rotated in the same way that frames can i.e. by applying . The canonical octahedral frame can therefore be equivalently expressed as .
The space of octahedral frames that are aligned to a unit vector can be described by the set
where is any axis-angle rotation taking to , (e.g., the vector parallel to and has magnitude equal to the angle from to ) and encodes an additional twist of the frame about . The first rotation about can be written in explicit form [Huang et al., 2011] as
The above allows us to formulate the set of all octahedral frames aligned to a given direction in terms of two constraints:
(1) |
where is the second through eighth rows of . The linear constraint rotates the frame from normal alignment to alignment, and the norm constraint ensures that the first and last components are of the appropriate form.
3.2. Vectorial Total Variation
We will later make use of a total variation energy (amongst others) to analyze the behavior of our cross fields on creased surfaces. Here, we introduce total variation and vectorial total variation definitions in and provide intuition about their use. The extension to functions on a Riemannian manifold is straightforward, using the standard intrinsic gradient and divergence operators.
The total variation of a differentiable scalar function is where [Ambrosio et al., 2000]. For non-differentiable , the relevant definition is:
where denotes differentiable, compactly-supported vector fields. For smooth , equivalence to follows from integration by parts and Stokes’s theorem. In this case, the maximizing is . If is the indicator function of a suitably regular (e.g., non-fractal) subset , then is the perimeter of .
When is vector-valued rather than scalar-valued, there are many different definitions for the vectorial total variation [Sapiro, 1996]. We use one proposed by Di Zenzo [1986], which for differentiable is given by , where is the Frobenius norm. More generally, we can take
(2) |
where , and is a differentiable, compactly-supported -tuple of vector fields. This definition is not equivalent to a sum of independent scalar total variations: The constraint on introduces nontrivial coupling between the dimensions. This definition of total vectorial variation is considered in the case where is a surface in by Bresson and Chan [2008], but without specific analysis for discontinuous .
4. Spherical Harmonic Octahedral Frames as Cross Fields
We use normal-aligned octahedral fields to encode tangent cross fields on surfaces, with the goal of computing a smooth cross field on a surface aligned to sharp features. The SH representation will enable us to capture features even when they are purely extrinsic. To this end, our next task is to define a means of measuring smoothness by examining the gradient of a SH field along the surface.
4.1. Derivatives of SH Octahedral Frames
To calculate , we first express it in an appropriate local coordinate system that simplifies the formulas in coordinates and better reveals the structure. Following the notation in §3.1, an octahedral field can be parameterized relative to a point by , where is the axis-angle rotation from to . This implies that . Without loss of generality, we rotate the surface so that the normal of at is . We can then compute the gradient at the point from the formula :
(3) |
As the field encodes an extrinsically embedded frame at each point, we take the gradient to be the component-wise derivative of the field’s nine scalar functions rather than a covariant or Lie derivative along the surface in order to capture the extrinsic geometry of the surface. We use [Rossmann, 2002, §1.2.5] and the fact that to derive Equation (3).
By combining facts about the SH representation and standard results in differential geometry we show that the squared norm at can then be expressed in the following more intuitive way:
Proposition 4.1.
Let be a normal-aligned octahedral field over a smooth surface . Then at every point , , where and are the principal curvatures and measures the intrinsic tangential twist of the octahedral field. Using mean and Gauss curvatures and , we can write .
We leave the full proof of this formula to supplementary materials. Proposition 4.1 gives a more intuitive form for Equation (3) and relates the spherical harmonic representation of an octahedral frame to properties of the frame it represents. Most notably, the Dirichlet energy of the SH representation can be effectively decoupled into extrinsic dependence of on the surface and the intrinsic tangential twisting of the normal-aligned octahedral field . The values of and simply contribute a fixed quantity depending on rather than the field. Therefore, the influence of on is just in , the intrinsic twist of the cross field it represents. We stress that this behavior is quite different from the behavior of the component-wise derivative evaluated on vectors, as studied in [Huang and Ju, 2016], where their smoothness energy promotes alignment to extrinsic curvature directions.
4.2. Smoothness Energy of SH Cross Fields
Suppose we wish to measure smoothness of a normal-aligned octahedral field in the SH representation. We define the following class of convex smoothness energies using the -norm of over the surface for :
(4) |
We now analyze the behavior of the energy for cross fields in several select cases.
4.2.1. Case : Dirichlet Energy
We begin with a common choice in geometry processing when smoothness is desirable: the Dirichlet energy . Given Proposition 4.1, we can write the Dirichlet energy as . Since and are independent of the octahedral field , they have no influence over the that minimizes . Therefore on smooth , we recover intrinsically smooth cross fields.
Since the Dirichlet energy may diverge at singularities [Knöppel et al., 2013], this choice of energy has the theoretical drawback of diverging for all in the neighborhood of creases which break octahedral symmetry. In the discretized setting, however, the behavior of is dependent on mesh resolution and empirically leads to strong feature alignment as demonstrated in §6. It also leads to an easily-solved optimization problem described in §5.2.
4.2.2. Case : Vectorial Total Variation
As noted in the previous section, the conventional means of measuring field smoothness fails to be well-defined for our field representation on creased surfaces. We show here that the energy is not only finite across sharp edges and around singular points but also provides an intuitive measure of field quality that captures both smoothness and feature alignment. It is also known as the vectorial total variation.
Consider a function that is piecewise smooth on closed patches intersecting in a finite-length curve network , where each is a curve. Equivalently , and the vectorial total variation can be decomposed into integrals over each patch and .
Proposition 4.2.
For compact and as above, is finite and given by the following equation:
(5) |
where and refer to the limiting values of on either side of , and denotes the interior of .
The basic argument starts from Equation , splits it into integrals over the patches, applies integration by parts, and utilizes partitions of unity to construct a maximizing sequence of ’s. The full argument is contained in supplementary materials §2. An analogous result, which applies to arbitrary functions on with bounded variation, is contained in [Ambrosio et al., 2000], with the addition of a third term representing the Cantor part of . Since our is piecewise smooth, however, we can safely ignore the Cantor part. The second term is often referred to as the jump part in the total variation literature.
The formula (5) provides an intuitive description of the total variation of an octahedral field in the SH basis as a measure of intrinsic smoothness with extra jump terms. Letting represent a normal-aligned octahedral field we obtain:
(6) |
Generalizing to Creased Surfaces
While the above result is derived for smooth surfaces and discontinuous , we can further generalize the result to a surface constructed from smooth open patches joined along a network of sharp creases . As there is neither a consistent metric nor a consistent tangent space on across , there is no well-defined choice of gradient. We therefore use equation (6) as the definition for on such a creased surface. Since is a normal-aligned octahedral field, it is necessarily discontinuous across creases, resulting in contributions to the jump term.
The jump , where and represent octahedral frames aligned to different normal directions, is minimized if and are both aligned to the axis of rotation from one normal to the other. We formalize this property by Proposition 4.3
Proposition 4.3.
Let and be smooth patches of a surface with normal directions and that meet at a crease. Let denote the intersection of their tangent spaces at the crease. Let and be the octahedral frames on either side of the crease aligned to and respectively. and denote their deviation from alignment to . The cost is minimized by .
Proof of this proposition is left to supplementary materials §3.
The setup is depicted on the right, showing discontinuous normal directions and as the left and right red arrows respectively. The crease direction is shown by the middle red arrow. We emphasize that this proposition implies (locally) crease alignment always minimizes the VTV. We extensively test and show in supplemental materials that this crease alignment tends to globally hold on surfaces with complicated geometry and topology as well.
4.2.3. General
By Equation 4, and Proposition 4.1, incentivizes intrinsic smoothness for all on smooth domains. On creased domains, we have demonstrated (local) crease-alignment for the case. For , the value of diverges for a creased surface. However, we find empirically that minimizing (by recovering solutions to Equation 7) on a discretized surface leads to stronger feature alignment as increases. This behavior may be explained by Proposition 4.3, which affects all edges regardless of . The simply exponentiates the energy across each edge before accumulating it into the total . Local to a single edge, the energy-minimizing configuration is unaffected by . Based on our experiments, we further conjecture that the sequence of fields obtained by minimizing on an increasingly dense discrete approximation of converges to a feature-aligned cross field. This intrinsically smooth feature-alignment is empirically shown in Figure 8. We leave proof of this conjecture to future work.
4.2.4. Relation to Polycube Surfaces
We achieve an additional property for all values of through our use of SH octahedral frames. Consider the case of being a cube: minimizers of will have zero energy, despite the cube’s sharp corners, since the field’s octahedral symmetry allows it to simultaneously align to all three creases at each corner. Effectively a surface with many angle- turns and cube-corners can have just as low of an energy as one with no creases at all. More generally, if is a polycube surface, by choosing to be a facet aligned uniform frame field.
5. Optimizing for an Octahedral Frame Field
Our discussion above provides a new class of energies based on the SH representation of cross fields, which naturally promote both intrinsic smoothness and extrinsic crease alignment without the need for feature curve detection or reliance on potentially noisy local curvature estimates. For this reason, we propose solving the following variational problem to find a cross field over a surface:
(7) | ||||||
subject to |
Recall that the constraint encodes normal alignment of the frame field (see equation (1)). Some past algorithms have an extra constraint which results in uniform-scale isotropic octahedral fields over . This constraint makes the problem nonconvex, and causes the functional to diverge in the neighborhood of field singularities, which are unavoidable on generic surfaces by the Poincaré-Hopf Theorem. Accordingly, a relaxation is naturally required; we drop the constraint , yielding a convex problem with globally-optimal solution. Dropping the constraint allows the frame’s two tangential components to scale independently from its normal component, resulting in anisotropic octahedral fields. We obtain octahedral fields with uniform-magnitude normal-lobes, and varying scale in the magnitude of the tangential cross field. This relaxation is similar in spirit to the one which appears in [Knöppel et al., 2013] , and has similar benefits, including automatic placement of singularities, and bounded-energy minimizers in the smooth limit (which is necessary in order for the field to be insensitive to the underlying mesh).
5.1. Soft Normal Alignment
It is sometimes beneficial to relax the normal alignment constraint, e.g., in cases where the mesh contains sliver triangles with unstable normal directions. In these cases, a smoother cross field can be obtained by deviating slightly from exact normal alignment. This relaxation changes the optimization problem from Equation (7) into the following:
(8) | ||||||
subject to |
This problem imposes a point-wise normal alignment constraint with tolerance . When , we recover the hard normal alignment formulation (7). On the opposite side of the spectrum, as , the solution to (8) approaches a constant octahedral field. This is the case where normal alignment has relaxed so far that the octahedral frames are effectively unconstrained.
For values in between we perform the following experiment to obtain a rough correspondence between soft normal alignment parameter and maximum angle deviation from normal alignment: For each value of between and (at intervals of ), we sample -perturbations of a aligned frame, extract the frame they represent, and compute its maximum angle deviation from the -axis. Results are shown in the inset.
We highlight that this parameter encodes a point-wise constraint uniformly applied over the mesh. As such its interpretation does not change with different meshes. Please see the supplemental materials for results on over 200 different meshes using a variety of values of .
The benefit of soft normal alignment is demonstrated in Figure 5. Due to the influence of a sliver triangle in the buste mesh with unstable normal direction, the hard-normal-aligned cross field is forced to create a localized artifact. By using soft normal alignment, the sliver triangle’s unstable normal direction has less influence over the resulting cross field, therefore increasing the quality of the result. A similar benefit is demonstrated on the duck and armchair meshes shown in the supplementary materials.
Additionally we test soft normal alignment on a cube-mesh with artificial noise added in Figure 7. With hard normal alignment the cross fields exhibit undesirable alignment to noise which increases with . With soft-normal alignment, the cross fields show significantly decreased sensitivity to noise.






5.2. Discretization
Now we describe how to construct smooth cross-fields by numerically optimizing a discretization of . We assume the surface has been triangulated into a manifold mesh . Let be the normal direction of triangle . We represent a cross on as a normally-aligned octahedral frame per triangle. We use the shorthand to denote the concatenation of all into a single vector. is a matrix of vertex positions, where is the number of vertices. denotes the matrix of edges, where is the number of edges. The energy can be discretized as
(9) |
where and are triangles adjacent to edge , and are weights corresponding to the dual Laplacian. We use , where is the length of edge and is the distance between barycenters of and .
For , the normal alignment constraint is discretized by the linear constraint , where is a sparse block-diagonal matrix with a block for each triangle. It has dimensions . The vector is a repetition of for each triangle, resulting in a vector. For , the normal alignment constraint is discretized by a second-order cone constraint: per triangle.
5.3. Meshes with Boundary
When the mesh contains boundaries, we do not enforce any boundary conditions; in PDE parlance, this choice corresponds to “natural boundary conditions.” While it is tempting to expect the natural boundary conditions for to imply zero Neumann boundary conditions [Stein et al., 2018], the SH representation vector is complicated by being constrained to a spatially varying linear subspace. We simply allow the cross on the boundary to be that which minimizes total energy. If desired, one can enforce a constraint that the cross field on the boundary be aligned to the boundary through the method described in §5.4.
5.4. Manual Guidance
To support manual guidance of the octahedral frame field, we can prescribe alignment of the frame field to streamlines. Streamline constraints combined with normal alignment result in a fully-determined frame. Therefore, prescribing streamlines is equivalent to prescribing the value of on a subset of triangles . Denote the prescribed octahedral frame on triangle as . We then add a new linear constraint that
(10) |
This technique is demonstrated in Figure 6.
5.5. Non-Triviality Constraint
As a result of dropping the unit-norm constraint from Equation 7, we have no explicit guarantee that the tangential components of octahedral frames do not degenerate to zero. On a surface with a crease, however, the normal alignment constraint on one side of the crease imposes that the magnitude of the tangential component on the other side of the crease is close to one. As a result, we observe empirically that the vast majority of our octahedral frames do not degenerate.
In the case that octahedral frames do degenerate significantly, their norms can be too small to project robustly. We locate these by using the octahedral projection from [Palmer et al., 2019] to measure the distance from to the octahedral variety : , and thresholding by . If such frames are found, we run the optimization again while holding non-degenerate frames to their projected values. In our experiments, just one round of re-solving results in 99.8% non-degenerate frames.


5.6. Solving For an Octahedral Field
In its most general form, our problem formulation consists of minimizing a mixed-norm objective, with both linear and second-order cone constraints. This results in a convex problem that we solve with Mosek 9 [ApS, 2017]. The normal alignment constraint becomes , where is the 8-dimensional Lorentz cone. Likewise, the energy is formulated using a single -norm cone. Our code is written in Matlab with a mex interface to Mosek; it builds cross-platform. Since our problem is convex, any dependence on initialization would entirely be due to non-unique solutions, which we do not observe in practice. Furthermore, we use the interior point method, which does not accept manual initialization. In the specific case of , solving this optimization is equivalent to solving a linear system.
6. Results
























Meshes








We begin with a comparison of the behavior of our energy for different values of . This experiment is depicted in Figure 9. We observe that our cross fields naturally align to features with increasing strength for higher . In the case , our cross field is discontinuous over all creases, but while it is provably incentivized to align, it sometimes deviates due to the influence of neighboring creases, e.g. on the top surface of the fandisk. For , our cross fields achieve close alignment to the upper half of the shallow crease, as well as alignment on the top face where the case failed. Finally for our fields align down the entirety of the shallow crease. While in theory, for diverges on creases, we observe that its discretization yields empirically strong crease alignment. This may be due to application of Proposition 4.3 over all edges of the mesh. We show our fields for different discretizations of the same geometry in Figure 10 and observe that in all cases, we achieve crease alignment.
Supplementary Materials
In our supplementary document we perform an empirical study to evaluate the performance of our method. We evaluate our method on a number of models drawn from the Thingi10k [Zhou and Jacobson, 2016] dataset, as well as a number of other commonly used benchmark models to demonstrate effective crease alignment on real-world models. We also compare our approach to several baseline methods ([Jakob et al., 2015; Brandt et al., 2018; Knöppel et al., 2013]), by generating fields on the models in the “Robust Field-Aligned Global Parametrization” dataset [Myles et al., 2014], taking care to sample the relevant parameter space for each formulation. While it is difficult to precisely quantify the quality of a vector field, we highlight a number of cases where our method recovers fields which more faithfully conform to mesh features than baseline methods on real-world models.
Our runtimes are shown for a set of meshes with 240 to 76K vertices and 480 to 152K faces in Figure 13. Runtimes naturally increase with mesh size and appear to grow linearly with number of triangles in our mesh test set. Memory costs are incurred to store a per triangle, a single , per edge, and per triangle. Hence, storage is linear in size of the mesh. More detailed information regarding parameter choices and runtimes is provided in the supplementary materials. Table 1 shows a summary of our runtimes in comparison to that of other methods. Our runtimes are on the same scale as [Knöppel et al., 2013] and to the bases setup step in [Brandt et al., 2018].
Number of | Bases | Biharmonic | Instant | Globally | Ours |
---|---|---|---|---|---|
triangles | setup | solve | meshes | optimal | |
3K | 5 | .005 | .026 | .85 | 2.8 |
12K | 24 | .005 | .053 | 20.46 | 15.058 |
20K | 44 | .005 | .080 | 21.913 | 25.895 |
69K | 170 | .006 | .141 | 62.733 | 135.09 |
80K | 181 | .006 | .222 | 71.15 | 112.3 |
Comparison to Explicit Feature Curves.
Next, we compare our feature-aligned cross fields to those produced with the help of explicitly-computed feature curves. We obtain feature curves on the 1904-triangle Moai mesh from [Gehre et al., 2016, Fig. 9]. We compute a cross field with additional hard constraints as described in §5.4 to enforce alignment to the precomputed feature curves. We compare the resulting field with and without explicit feature-curve alignment in Figure 11. While the feature curves help guide the cross field, just a few artifacts in the computed features drastically influence the resulting cross field to have more singularities and be less smooth without clear benefit. The Moai is shown from an angle where these differences are most pronounced.
Effect of Mesh Resolution on Crease-Alignment vs Extrinsic Curvature.
In this experiment we test on a geometry where a sharp crease is mis-aligned to extrinsic curvature directions. We generate meshes of this geometry at varying resolution to see how crease-alignment interacts with extrinsic curvature. Results of this experiment are depicted in Figure 8. As mesh resolution increases our cross fields become crease-aligned and intrinsically smooth, agreeing with the theory. For very low mesh resolution, the cross fields are more sensitive to the underlying meshing pattern.
Comparison to 3D Octahedral Fields.
Due to similarity of frame representation, we compare our method to surface cross fields obtained by optimizing a volumetric octahedral field. Algorithms like those of [Huang et al., 2011; Ray et al., 2016] can generate surface cross fields by approximating the surface with the limiting behavior of a thin layer of tetrahedra or prism elements. However, prism elements are non-standard and both element types will be poorly conditioned without introducing further restrictions such as zero normal gradient to mimic a triangle mesh. We instead opt to compare with the Boundary Element Method (BEM) [Solomon et al., 2017] which acts directly on surface triangle meshes. We use the 2500 triangle fandisk mesh for this comparison. As observed earlier, our method has increasing feature alignment with increased values of . In comparison, Figure 12 shows that the BEM field fully ignores the shallow crease of the fandisk, running through it at a offset. Moreover, despite the fact that the BEM only needs boundary data as input, its runtime is close to 50 times slower than ours.











Challenging Test Cases
We compare feature alignment of our cross fields with that of existing methods on several meshes illustrative examples in Figure 14. As pointed out in the introduction, a key advantage of our technique is that it recovers crease aligned fields on models whose maximal curvature directions disagree with their creases. This occurs naturally when models are specified by the intersections of developable patches, a very common primitive in CAD tools. We introduce two benchmark models for testing crease alignment when creases disagree with intrinsic notions of curvature. The three-cylinder-intersection mesh is composed of quadrilateral patches where each patch is a subset of a cylinder and has maximal curvature directions making angles with its boundary creases. The wavey-box example has the same creases as a standard cube, with the modification that each of its faces has a sine wave ripple running diagonally through it. These two cases are shown in Figure 2. The fandisk mesh is another example of a challenging case for feature-alignment due to its shallow crease with strong non-aligning neighboring creases which is representative of one way that such features arise in real-world models.
Our cross fields on these test cases are shown in Figure 14. We observe proper feature alignment in our fields and while other methods can sometimes be tuned per model to achieve the same feature alignment, there is no choice of parameters that worked on all test cases. In particular:
-
•
fields from [Jakob et al., 2015] are distracted by extrinsic curvature on the three-cylinder-intersection and entirely pave over the shallow crease of the fandisk. Their results on wavey-box, and wedge are successfully aligned to the creases.;
-
•
fields from [Brandt et al., 2018] are challenging to tune with representing alignment to a guiding extrinsic curvature field. We show their method for the biharmonic energy () as a point of contrast to Dirichlet energy. We choose two values of , for slight extrinsic curvature alignment, and for stronger extrinsic curvature alignment. Their fields are unable to align to features of the three-cylinder-intersection in both cases, and specifically for the field strongly aligns to noise on the flat upper face of the fandisk mesh. Their fields are successfully crease-aligned for the wedge mesh;
-
•
we compare against both the anti-holomorphic and Dirichlet energies of [Knöppel et al., 2013] with the curvature alignment parameter set to . This results in good alignment on the three-cylinder-intersection, but noisy or unaligned fields for the remaining test cases.
In contrast, our method for achieves feature alignment on all test cases without unnecessary discontinuities in the field over flat faces. We show additional results for over 200 different meshes with both smooth and creased geometries with varying values of and in the supplementary materials. The fields are crease-aligned for all creased meshes and are otherwise intrinsically smooth. For comparison, we include fields from [Brandt et al., 2018] and [Knöppel et al., 2013] on a larger range of . We also include fields from [Brandt et al., 2018] for and fields from [Jakob et al., 2015] in supplementary materials.

























Quad Meshing
Feature alignment is especially important when using cross fields to guide high-fidelity quad meshing. We generate quad meshes using [Campen et al., 2015] to parameterize our cross fields. We compare against a standard quad meshing pipeline using cross fields from [Bommes et al., 2009] and [Campen et al., 2015] for parameterization. We also test against parameterization by [Campen et al., 2016], which introduces extra guidance to encourage extrinsic curvature alignment.
For the fandisk mesh prior methods generate quad meshes that are influenced by the shallow crease, but do not manage to capture it sharply (see Figure 15). We observe that by placing singularities near the shallow crease of the fandisk, our quad meshes manage to align much more sharply. The quad mesh generated by minimizing aligns even better than for .




We also compare quad meshes generated from our cross fields against the prior art on the anchor, spot, moomoo, and three-cylinder-intersection meshes. These results are shown in Figure 16. We observe generally better alignment in the quad meshes generated from our method. By placing singularities on the cylindrical region of the anchor, our quad meshing manages to align better to its creases. On the spot mesh we see a straighter connection between the ear and the head. For the three-cylinder-intersection, the quad mesh generated from our fields clearly align better. Since the moomoo is a relatively smooth mesh, we do not see particularly defining differences in quality.




7. Discussion and Conclusions
Feature alignment is a desirable property in many geometry processing applications. In the context of cross fields and remeshing, we consider features to be creases where the surface changes non-smoothly. Quality of feature detection and alignment can significantly impact quality of the remeshing and the usefulness of the resulting cross fields. While significant effort has been put into extrinsic alignment of cross fields to curvature directions, they are not always appropriate substitutes for crease alignment. By specifically targeting discontinuities of the surface we have created a new class of octahedral frame field energies parameterized by for computing crease-aligned cross fields on surfaces. The resulting fields are intrinsically smooth over smooth surfaces, and can be used for crease-aligned quad meshing. Moreover, alignment is fully automatic and does not rely on explicit extraction of feature curves, itself an open problem and active area of research.
We find the behavior of for over creases of a discretization to be an interesting point for further exploration since all practical computations on surfaces are necessarily discrete and we observe strong feature alignment, despite the problem being ill-posed in the smooth setting. Theoretical analysis of anisotropic normally-aligned octahedral frame fields combined with Proposition 4.3 may be able to explain this behavior. Since all edges of a mesh are creases of a piecewise linear domain, the behavior of geometry processing algorithms on creased domains merits further study.
There are also further applications of soft-normal-aligned octahedral frame fields. While in this paper we fix as a single parameter per mesh, it could also be defined as a scalar field representing “trust” in the quality of a mesh. It would be interesting to explore a spatially-varying dependent on triangle quality or other metrics in the future. If we treat the mesh itself as variables, soft normal alignment enables a surface flow towards meshes with lower cross-field energy. Our analysis can be further extended to SH representations of -RoSy fields or even platonic solid symmetries [Shen et al., 2016]. We also conjecture that with mild assumptions the solution to our problem is unique, but a proof is out of scope for this work; we leave exploration of these ideas to future work.
Even without these extensions, our method provides a practical solution to a challenging problem. By using a new representation of cross fields we achieve crease-aligned cross fields on surfaces.
Acknowledgements.
The authors would like to thank Christopher Brandt for help obtaining comparison fields, Amir Vaxman for support with Directional and rendering, Michal Adamaszek for help debugging Mosek, and David Palmer for discussions and help with his code base. We thank Wenzel Jacob, Keenan Crane, and Qingnan Zhou for their open source code implementations. Finally, we thank Ryan Viertel for many valuable discussions and Panini Pals for the panini press. Paul Zhang acknowledges the generous support of the Department of Energy Computer Science Graduate Fellowship. Etienne Vouga acknowledges the generous support of Adobe, SideFX, and NSF IIS-1910274. David Bommes acknowledges the generous support of the Sponsor European Research Council (ERC) https://erc.europa.eu under the European Union’s Horizon 2020 research and innovation program (AlgoHex, grant agreement no. Grant #853343). Justin Solomon acknowledges the generous support of Sponsor Army Research Office https://www.arl.army.mil/who-we-are/aro/ grant Grant #W911NF-12-R-0011, Sponsor National Science Foundation https://www.nsf.gov grant Grant #IIS-1838071, Sponsor Air Force Office of Scientific Research https://www.wpafb.af.mil/afrl/afosr/ award Grant #FA9550-19-1-0319, and a gift from Adobe Systems. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of these organizations.References
- [1]
- Ambrosio et al. [2000] Luigi Ambrosio, Nicola Fusco, and Diego Pallara. 2000. Functions of bounded variation and free discontinuity problems. Clarendon Press, Oxford ; New York.
- ApS [2017] MOSEK ApS. 2017. The MOSEK optimization toolbox for MATLAB manual. Version 8.1. http://docs.mosek.com/8.1/toolbox/index.html
- Bessmeltsev and Solomon [2019] Mikhail Bessmeltsev and Justin Solomon. 2019. Vectorization of line drawings via polyvector fields. ACM Transactions on Graphics (TOG) 38, 1 (2019), 9.
- Bommes et al. [2013] David Bommes, Marcel Campen, Hans-Christian Ebke, Pierre Alliez, and Leif Kobbelt. 2013. Integer-Grid Maps for Reliable Quad Meshing. ACM Transactions on Graphics 32, 4 (July 2013). https://hal.inria.fr/hal-00862648
- Bommes et al. [2009] David Bommes, Henrik Zimmer, and Leif Kobbelt. 2009. Mixed-integer quadrangulation. ACM Transactions on Graphics 28, 3 (July 2009), 1. DOI:http://dx.doi.org/10.1145/1531326.1531383
- Brandt et al. [2018] Christopher Brandt, Leonardo Scandolo, Elmar Eisemann, and Klaus Hildebrandt. 2018. Modeling n -Symmetry Vector Fields using Higher-Order Energies. ACM Transactions on Graphics 37, 2 (March 2018), 1–18. DOI:http://dx.doi.org/10.1145/3177750
- Bresson and Chan [2008] Xavier Bresson and Tony Chan. 2008. Fast dual minimization of the vectorial total variation norm and applications to color image processing. Inverse Problems and Imaging 2, 4 (Nov. 2008), 455–484. DOI:http://dx.doi.org/10.3934/ipi.2008.2.455
- Campen et al. [2015] Marcel Campen, David Bommes, and Leif Kobbelt. 2015. Quantized global parametrization. ACM Transactions on Graphics 34, 6 (Oct. 2015), 1–12. DOI:http://dx.doi.org/10.1145/2816795.2818140
- Campen et al. [2016] Marcel Campen, Moritz Ibing, Hans-Christian Ebke, Denis Zorin, and Leif Kobbelt. 2016. Scale-Invariant Directional Alignment of Surface Parametrizations. Computer Graphics Forum 35, 5 (Aug. 2016), 1–10. DOI:http://dx.doi.org/10.1111/cgf.12958
- Chambolle et al. [2010] Antonin Chambolle, Vicent Caselles, Matteo Novaga, Daniel Cremers, and Thomas Pock. 2010. An introduction to Total Variation for Image Analysis. 9 (2010). DOI:http://dx.doi.org/10.1515/9783110226157.263
- Chemin et al. [2018] Alexandre Chemin, François Henrotte, Jean-François Remacle, and Jean Van Schaftingen. 2018. Representing three-dimensional cross fields using 4th order tensors. In 2018. http://arxiv.org/abs/1808.03999 arXiv: 1808.03999.
- Corman and Crane [2019] Etienne Corman and Keenan Crane. 2019. Symmetric Moving Frames. ACM Trans. Graph. 38, 4, Article Article 87 (July 2019), 16 pages. DOI:http://dx.doi.org/10.1145/3306346.3323029
- Crane et al. [2010] Keenan Crane, Mathieu Desbrun, and Peter Schröder. 2010. Trivial Connections on Discrete Surfaces. Computer Graphics Forum 29, 5 (Sept. 2010), 1525–1533. DOI:http://dx.doi.org/10.1111/j.1467-8659.2010.01761.x
- de Goes et al. [2015] Fernando de Goes, Mathieu Desbrun, and Yiying Tong. 2015. Vector Field Processing on Triangle Meshes. In SIGGRAPH Asia 2015 Courses (SA ’15). ACM, New York, NY, USA, Article 17, 48 pages. DOI:http://dx.doi.org/10.1145/2818143.2818167
- Di Zenzo [1986] Silvano Di Zenzo. 1986. A note on the gradient of a multi-image. Computer Vision, Graphics, and Image Processing 33, 1 (Jan. 1986), 116–125. DOI:http://dx.doi.org/10.1016/0734-189X(86)90223-9
- Gehre et al. [2016] Anne Gehre, Isaak Lim, and Leif Kobbelt. 2016. Adapting Feature Curve Networks to a Prescribed Scale. Computer Graphics Forum 35, 2 (May 2016), 319–330. DOI:http://dx.doi.org/10.1111/cgf.12834
- Huang et al. [2011] Jin Huang, Yiying Tong, Hongyu Wei, and Hujun Bao. 2011. Boundary aligned smooth 3D cross-frame field. In Proceedings of the 2011 SIGGRAPH Asia Conference on - SA ’11. ACM Press, Hong Kong, China, 1. DOI:http://dx.doi.org/10.1145/2024156.2024177
- Huang and Ju [2016] Zhiyang Huang and Tao Ju. 2016. Extrinsically smooth direction fields. Computers & Graphics 58 (Aug. 2016), 109–117. DOI:http://dx.doi.org/10.1016/j.cag.2016.05.015
- Iarussi et al. [2015] Emmanuel Iarussi, David Bommes, and Adrien Bousseau. 2015. BendFields: Regularized Curvature Fields from Rough Concept Sketches. ACM Transactions on Graphics 34, 3 (May 2015), 1–16. DOI:http://dx.doi.org/10.1145/2710026
- Jakob et al. [2015] Wenzel Jakob, Marco Tarini, Daniele Panozzo, and Olga Sorkine-Hornung. 2015. Instant field-aligned meshes. ACM Transactions on Graphics 34, 6 (Oct. 2015), 1–15. DOI:http://dx.doi.org/10.1145/2816795.2818078
- Knöppel et al. [2013] Felix Knöppel, Keenan Crane, Ulrich Pinkall, and Peter Schröder. 2013. Globally optimal direction fields. ACM Transactions on Graphics 32, 4 (July 2013), 1. DOI:http://dx.doi.org/10.1145/2461912.2462005
- Knöppel et al. [2015] Felix Knöppel, Keenan Crane, Ulrich Pinkall, and Peter Schröder. 2015. Stripe patterns on surfaces. ACM Transactions on Graphics 34, 4 (July 2015), 39:1–39:11. DOI:http://dx.doi.org/10.1145/2767000
- Liu et al. [2018] Heng Liu, Paul Zhang, Edward Chien, Justin Solomon, and David Bommes. 2018. Singularity-constrained octahedral fields for hexahedral meshing. ACM Transactions on Graphics 37, 4 (July 2018), 1–17. DOI:http://dx.doi.org/10.1145/3197517.3201344
- Myles et al. [2014] Ashish Myles, Nico Pietroni, and Denis Zorin. 2014. Robust Field-aligned Global Parametrization. ACM Trans. Graph. 33, 4, Article 135 (July 2014), 14 pages. DOI:http://dx.doi.org/10.1145/2601097.2601154
- Nieser et al. [2011] M. Nieser, U. Reitebuch, and K. Polthier. 2011. CubeCover- Parameterization of 3D Volumes. Computer Graphics Forum 30, 5 (Aug. 2011), 1397–1406. DOI:http://dx.doi.org/10.1111/j.1467-8659.2011.02014.x
- Palmer et al. [2019] David Palmer, David Bommes, and Justin Solomon. 2019. Algebraic Representations for Volumetric Frame Fields. arXiv:1908.05411 (2019).
- Ray et al. [2016] Nicolas Ray, Dmitry Sokolov, and Bruno Lévy. 2016. Practical 3D frame field generation. ACM Transactions on Graphics 35, 6 (Nov. 2016), 1–9. DOI:http://dx.doi.org/10.1145/2980179.2982408
- Ray et al. [2008] Nicolas Ray, Bruno Vallet, Wan Chiu Li, and Bruno Lévy. 2008. N-symmetry Direction Field Design. ACM Trans. Graph. 27, 2, Article 10 (May 2008), 13 pages. DOI:http://dx.doi.org/10.1145/1356682.1356683
- Rossmann [2002] Wulf Rossmann. 2002. Lie groups: an introduction through linear groups. (2002).
- Rudin et al. [1992] Leonid I. Rudin, Stanley Osher, and Emad Fatemi. 1992. Nonlinear total variation based noise removal algorithms. Physica D: Nonlinear Phenomena 60, 1-4 (Nov. 1992), 259–268. DOI:http://dx.doi.org/10.1016/0167-2789(92)90242-F
- Sapiro [1996] G. Sapiro. 1996. Vector-valued active contours. In Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition. IEEE, San Francisco, CA, USA, 680–685. DOI:http://dx.doi.org/10.1109/CVPR.1996.517146
- Shen et al. [2016] Zhongwei Shen, Xianzhong Fang, Xinguo Liu, Hujun Bao, and Jin Huang. 2016. Harmonic Functions for Rotational Symmetry Vector Fields. Computer Graphics Forum 35, 7 (Oct. 2016), 507–516. DOI:http://dx.doi.org/10.1111/cgf.13047
- Solomon et al. [2017] Justin Solomon, Amir Vaxman, and David Bommes. 2017. Boundary Element Octahedral Fields in Volumes. ACM Transactions on Graphics 36, 3 (May 2017), 1–16. DOI:http://dx.doi.org/10.1145/3065254
- Stein et al. [2018] Oded Stein, Eitan Grinspun, Max Wardetzky, and Alec Jacobson. 2018. Natural Boundary Conditions for Smoothing in Geometry Processing. ACM Trans. Graph. 37, 2, Article Article 23 (May 2018), 13 pages. DOI:http://dx.doi.org/10.1145/3186564
- Vaxman et al. [2016] Amir Vaxman, Marcel Campen, Olga Diamanti, Daniele Panozzo, David Bommes, Klaus Hildebrandt, and Mirela Ben-Chen. 2016. Directional Field Synthesis, Design, and Processing. (2016), 28.
- Zhou and Jacobson [2016] Qingnan Zhou and Alec Jacobson. 2016. Thingi10K: A Dataset of 10,000 3D-Printing Models. arXiv preprint arXiv:1605.04797 (2016).