betaFeedback

WorksComputer Science

Piecewise CMC Segmentation for Fluidic Shaping

Abstract

We present a novel mesh segmentation approach for the fabrication of 3D geometries using fluidic shaping. The physics of fluidic shaping gives rise to Constant Mean Curvature (CMC) surfaces due to interfacial tension between the polymer fluid used to shape the 3D structure and an immersion fluid of equal density. Our mesh segmentation algorithm partitions the mesh into a piecewise CMC surface, such that every segment is a CMC approximation to the target within a user specified tolerance. We run a CMC evolution procedure in the loop during segmentation to find physically stable CMC surfaces that can be reliably fabricated. We extract a wireframe scaffold from the seams of this segmentation and inject polymer fluid into the frame for curing. The structure cures as a single, continuous, isotropic volume, yielding nanometer scale roughness on the interior surface of each segment without the costly post-processing or smoothing that conventional state-of-the-art approaches require for comparable surface quality.

Introduction

Fluidic shaping [14, 18] is a fabrication technique that exploits properties of surface tension to produce exceptionally smooth surfaces without the need for machining or polishing. Originally developed for optical components, the process involves constraining a liquid polymer to a rigid frame within an immiscible bath, which naturally relaxes to a smooth shape with nanometer-scale surface roughness after curing [15]. However, because the resulting geometry is governed by the equilibrium of fluid interfaces, existing approaches have a limited design space of lens-like surfaces, with no general approach for fabricating freeform 3D shapes.

In this work, we introduce a novel mesh segmentation approach that enables extending fluidic shaping to freeform 3D surfaces. A key insight is that in a density-matched fluid bath, gravitational forces are suppressed, allowing interfacial tension to drive a liquid interface toward a Constant Mean Curvature (CMC) surface. By partitioning a target geometry into CMC patches and constraining the liquid along their boundaries, we can produce complex shapes via the fabrication approach of Garrett et al. [2026] that would otherwise be inaccessible to conventional fluidic shaping. This leads to a new geometric decomposition problem, which we call piecewise CMC (P-CMC) segmentation. Analogous to developable segmentation [27, 52, 56] and mold paneling [13, 19], a P-CMC segmentation decomposes freeform geometry into simpler manufacturable primitives.

A central challenge is that the individual segments within a frame remain connected through a common body of polymer fluid. In a density-matched bath, the pressure difference across the two fluids is the same everywhere and hence all patches must share the same mean curvature H∗H^* at equilibrium. This shared curvature H∗H^* can be prescribed by controlling the injected polymer volume during fluidic shaping, but imposes a global constraint on the geometric decomposition.

We formulate the computational problem to solve as follows—Given a target Mean Curvature (MC) H∗H^*, compute a segmentation of the input geometry such that each segment admits an evolution into a CMC surface, with the approximation error between the evolved and original geometry bounded by a user-defined threshold. We employ a greedy approach, iteratively growing segments on the input surface. Each segment starts from a single mesh element and expands until the resulting patch can no longer be approximated by a CMC surface. The seams separating the segments are precisely where the surface fails to be CMC, so the segmentation concentrates the sharp features of the target geometry onto a sparse collection of curves. This is akin to the developability flow of Stein et al. [2018] and more recently Chen and Kara [2026] who optimize for flank milling manufacturability, where Gaussian curvature gets concentrated onto a sparse collection of curves on the surface.

Physically, those seam curves are what the fabrication process needs as boundary data. Interfacial tension acts to contract a liquid interface toward minimal area; left unconstrained, a fixed volume of polymer would relax to the shape that minimizes area for that volume—a sphere—retaining none of the target geometry. Pinning the polymer liquid along the seams allows the remaining bulk to settle into the CMC patches our segmentation prescribes (Figure 1). The resulting structure cures into a continuous volume with isotropic mechanical properties, compared to conventional additive manufacturing approaches where material is deposited and cured layer by layer, leaving micrometer scale deposition marks on the surface and an anisotropic bulk volume [33] [31].

Piecewise CMC segmentation and fabricated structures

Figure 1. We use fluidic shaping to fabricate complex structures using the physics of interfacial phenomena. Our method takes as input a 3D shape, computes a piecewise Constant Mean Curvature segmentation and outputs a sparse bounding frame. The frame acts as a scaffold allowing polymer fluid to take the desired shape, which is eventually cured to get the final structure.

We summarize the contributions made in the paper as follows:

  • We introduce the first algorithm for piecewise CMC segmentation, decomposing a surface into patches that each evolve into a CMC surface of prescribed mean curvature within a user-defined error.

  • A graph contraction approach for growing segments, aided by a CMC evolution procedure robust to arbitrary input geometry.

  • An end-to-end pipeline from segmentation to 3D printable wireframe, taking fluidic shaping from single optical surfaces to freeform 3D geometry.

Related Work

Evolution into CMC Surfaces – Tools for Forward Solve

A fixed boundary and a prescribed mean curvature H∗H^* generally admit both small and large solutions [49], such as the minor and major caps of a sphere, and methods differ mainly in which of them they can reach. Surface Evolver [3] prescribes H∗H^* through a pressure term and descends on the energy EE of Equation (2). It converges only to its local minimizers, thus missing saddle points of EE such as the major cap, which are also stable at fixed fluid volume (Appendix D). Surface Evolver reaches such surfaces under a volume constraint and can analyze their stability [4], but the curvature then becomes an output. The same holds for Pan et al. [2012] and Yu et al. [2016], who weight the same discrete volume gradient by a scalar (tt and λ\lambda respectively), and for Renka [2015], who prescribes a target volume. Mean curvature is not monotone in any of these parameters (Figure 2; Yu et al. [2016], Figure 1), so it cannot be set by tuning them. We use the energy of Pan et al. [2012] as the inner solver and recover control of H∗H^* by root-finding over its parameter.

Our computational pipeline

Figure 2. Our computational pipeline. We segment the input geometry into patches that can be approximated by CMC surfaces of a given target MC = H∗H^*. The segment seams are used to extract a frame that is 3D printed. Finally, we use Fluidic Shaping to manufacture the geometry, where the frame acts as a scaffold.

Dziuk and Hutchinson [2006] and Chicco-Ruiz et al. [2016] take H∗H^* as a true input and solve by Newton-type iterations, but the former is restricted to disc topology with a boundary that slides along the prescribed curve, and the latter to smooth isogeometric spline patches. Both, like Newton generally, converge to nearby solutions regardless of physical stability (Figure 2). Brubaker [2018] traces entire families of stable and unstable solutions by continuation, but must be initialized with a surface that is already CMC over a rectangular parameter domain. Polthier and Rossman [2002] compute the index of discrete CMC surfaces from the discrete Jacobi operator that serves as our Newton Jacobian in § 3.2, and Pinkall and Polthier [1993] treat the minimal case where H∗=0H^*=0. Finally, Pellis et al. [2021] optimize toward Weingarten surfaces, a class containing CMC surfaces, near an input design with the curvature relation as an output, and Soliman et al. [ [47] prescribe tangent planes rather than a boundary curve. To the best of our knowledge, our procedure is the first that takes an arbitrary triangle mesh with pinned boundary and a scalar H∗H^* and upon convergence, returns a CMC surface of that curvature that is stable at fixed volume, including at certain saddle points of EE (see Appendix D for more details).

Fabrication via Interfacial Phenomena

Recent work on shaping complex structures using the interfacial properties of fluids has gained rapid traction. Duraivel et al. [ [11] propose a technique that tunes the interfacial tension between the support material and printing fluid to "jam" it in place, which they use to fabricate thin complex 3D structures. In a similar vein, Hajash et al. [ [23] use reusable supports in the form a liquid gel to 3D print large scale structures. Jones et al. [ [26] harness interfacial flows in a curing elastomer — an injected air bubble whose drainage sets the film thickness to cast monolithic soft pneumatic actuators. Forth et al. [ [17] print water-in-oil structures held together by an interfacially jammed nanoparticle "supersoap," fixing liquid threads into stable, reconfigurable geometries.

Fluidic shaping for lens making

Similar to the work in the previous section, fluidic shaping is a fabrication approach that uses interfacial tension to shape fluids into 3D structures. A characteristic feature of this approach is that the interfacial tension between two fluids yields nanometer-scale surface smoothness, making it ideal for applications such as lens-making for telescopes and other optical systems. Elgarisi et al. [ [14]; Frumkin and Bercovici [ [18] pioneered the fabrication of lenses by immersing a rigid frame in a liquid bath, so that the polymer injected into the frame settles into a rich family of geometries. Luria et al. [ [29, 30] carried this into microgravity by creating liquid lenses and mirrors in parabolic flights for space telescopes whose size was unconstrained by launch-fairing payload volume. Elgarisi et al. [ [15] used the method for wearable optics, fabricating industry-standard prescription eyeglasses in minutes without any machining or polishing. Our work uses the foundational principles of fluidic shaping fabrication, and adds a computational layer to it enabling the creation of arbitrary 3D structures.

Paneling and Segmentation of Freeform Surfaces

Approximating a target shape with a restricted vocabulary of manufacturable primitives trades exact fidelity for a substantial reduction in fabrication cost and complexity. In this work, we use piecewise CMC patches as that vocabulary. The closest precedent is primitive-fitting segmentation. Variational Shape Approximation [8] alternates between partitioning faces and refitting planar proxies under an L2L^2 or normal-based L2,1L^{2,1} metric (cf. our normal-deviation criterion, § 3.3). Later work added spheres, cylinders and blends [53] and general quadrics [54]. Bottom-up methods instead contract dual-graph edges in order of increasing merge cost [21], scored by primitive fits in Attene et al. [ [1]. Our graph contraction based segmentation in § 3 also follows this scheme (see Shamir [ [43] for a survey). Although planes, spheres and cylinders are CMC, these methods fit each region a free proxy with its own parameters, whereas our patches share one H∗H^* and are determined by their seams, which are physical boundary conditions. Each candidate merge therefore requires a boundary-value solve (§ 3.2) rather than a closed-form fit.

Developable segmentation targets fabrication from bent sheet material. D-Charts [Julius et al. [27] grows segments from seed triangles until a developability criterion fails; the same structure as ours with a different test. Wang [ [52] segment by flattening distortion, and Zhao et al. [ [56] build on discrete developability [48]. Other work reduces cost through reuse: panels sharing molds [13], tiles drawn from few distinct shapes [19, 46], Weingarten surfaces whose curvature relation induces approximate congruences [37], and cladding along geodesic patterns from straight stock [40]. Hayashi et al. [ [24] generate piecewise CMC surfaces by mean curvature flow, but solve the forward problem for a given patch layout with free internal boundaries. We solve the inverse, recovering the layout from a target shape with seams fixed by a rigid frame.

Background on CMC Surfaces and Interfacial Tension Physics

In this section, we characterize CMC surfaces from a geometric and physical perspective. We first pose the problem of finding CMC surfaces variationally, as the search for a critical point of an area–volume energy (§ 2.1). We then show that the equilibrium condition this energy produces is exactly the static force balance of a thin interface under surface tension and a pressure jump (§ 2.2), thus demonstrating equivalence between the geometric and physical formulation.

Geometric Modeling of CMC Surfaces

Let X∈R3nX \in\mathbb{R}^{3n} denote the vertex set of a triangle mesh with a fixed boundary, and let A(X)A(X) and V(X)V(X) be its discrete surface area and signed enclosed volume. It is well known [3, 34, 39] that discrete CMC surfaces arise as the critical points of area under a volume constraint, i.e. of the functional

E(X)=A(X)+λV(X),(1)E(X) = A(X) + \lambda V(X), \tag*{(1)}

where the multiplier λ\lambda plays the role of a prescribed pressure. Setting λ=−2H∗\lambda= -2H^* in Equation (1) gives the energy whose critical points are the CMC surfaces of prescribed target curvature H∗H^*,

E(X)=A(X)−2H∗V(X).(2)E(X) = A(X) - 2H^*V(X). \tag*{(2)}

We show a simple proof of this in Appendix § 8.

We emphasize that we seek a critical point of EE, and not just a minimizer. Consider the major and the minor cap of a sphere. Both share the same boundary circle and both have the same constant mean curvature, but only the minor cap is a local minimizer of EE; the major cap is a saddle point. Restricting the solve to only minimizers would therefore discard such equally valid solutions. A simple one-dimensional example of this energy for the sphere caps is shown in Figure 4.

Figure 4. Energy landscape of spherical caps parameterized by their height from the base. The base is the boundary ring which is fixed and has radius r=0.8r = 0.8 in this example. In a one-dimensional setting, the minor cap is a local minimizer of EE and the major cap is a local maximum. In higher dimensions, the major cap becomes a saddle point of EE.

Physical Connection: Surface Tension, Pressure and CMC Equilibrium

The critical points of the energy of Equation (2) are exactly the static equilibria of a thin interface driven by surface tension and a pressure jump — the governing physics of the fluidic shaping process (Figure 5). Surface tension acts as an area-minimizing force, pulling the interface inward along −2αHn-2\alpha H\mathbf{n}, where α\alpha is the interfacial tension coefficient. Left unopposed, it would collapse the surface entirely, but the incompressible polymer fluid resists, pushing back with a force proportional to the pressure excess Δp\Delta p across the interface (see Figure 5). We can obtain a static equilibrium between the two by setting the acceleration term in the dynamics model proposed by Ishida et al. [2017] to 0,

Figure 5. Cross sectional view of the fluidic shaping mechanism. Difference in pressure at the interface of the two fluids Δp\Delta p helps shape the interface. Under neutral buoyancy, Δp\Delta p is constant over the interface and each segment becomes a CMC surface.

α∂A(x)∂x=Δp n(x),(3)\alpha\frac{\partial A(\mathbf{x})}{\partial\mathbf{x}} = \Delta p\,\mathbf{n}(\mathbf{x}), \tag*{(3)}

The stationarity condition ∇E(X)=0\nabla E(\mathbf{X}) = 0 of Section 3.1 reduces to exactly this force balance, with the prescribed curvature H∗H^{*} and the pressure jump related through the Young–Laplace law,

Δp=2αH∗.(4)\Delta p = 2\alpha H^{*}. \tag*{(4)}

The purely geometric formulation of Section 3.1 and the static equilibrium of a surface-tension driven interface are therefore equivalent. We defer the derivation to Appendix B.

When several polymer segments form within the wireframe but remain in communication through a common fluid body, they share

one interior pressure and one ambient bath pressure, and hence a single pressure jump Δp\Delta p. This follows from the neutral buoyancy of fluidic shaping: because the polymer and the immersion fluid have equal densities, hydrostatic pressure on both sides of the interface is equal, and the pressure jump is therefore determined only due to the mean curvature of the interface. By Equation (4), every segment is therefore a CMC patch and all of them share the same target mean curvature H∗H^{*} at equilibrium. This common value of H∗H^{*} is the target curvature we prescribe in Equation (2).

Mesh Segmentation

In this section, we describe in detail how a CMC evolution procedure can be leveraged to compute a mesh segmentation. The seams of this segmentation are used to extract a thin frame that is 3D printed, which helps shape the polymer fluid into the target geometry. In Section 4.1, we show how a suitable target mean curvature H∗H^{*} can be chosen for the input geometry. In Section 4.2, we describe the process to compute a CMC surface with MCMC H∗H^{*} for a given patch on the target geometry. We leverage these capabilities in Section 4.3 to compute the P-CMC mesh decomposition in a ground-up, geometrically-driven merging approach. Finally, in Section 4.4, we detail some constraints the segmentation must satisfy in order to produce a high quality P-CMC decomposition.

Representative Mean Curvature

Before we begin describing the segmentation routine, we need to pick a good representative mean curvature H∗H^{*} for the segmentation. As discussed earlier, all segments share the same mean curvature at equilibrium (§ 2.2).

Intuitively, it makes sense to pick the mean curvature that is most dominant on the mesh. This helps ensure that the resulting segments cover larger areas of the mesh, thereby reducing the amount of supporting frame that must be 3D printed and maximizing the portion of the surface that remains smooth.

To find this value, we compute the mean curvature at every vertex and discard the 2% of vertices with the lowest and highest values to remove outliers. We then build a smooth, area-weighted distribution of the remaining values using Gaussian Kernel Density Estimation (KDE) [36, 42]. We place a Gaussian centered at each vertex’s mean curvature, weight it by that vertex’s share of the total surface area, and add them together. The result is a

KDE fitting for MC estimation for Spot

Figure 6. KDE fitting for MC estimation for Spot. Left: Original mean curvature plot. Right: KDE fitting used to compute peak MC value. This peak value is used as the representative mean curvature H∗H^* for the segmentation. The histogram is only for visualization purposes, and is not used in the computation.

Probability Density Function (PDF), and its height at any value HH reflects how much of the surface has mean curvature close to HH. All Gaussians share the same width (standard deviation) hh, which we set using Silverman’s rule of thumb [45]: h=1.06σ^n−1/5h = 1.06 \hat{\sigma} n^{-1/5} where σ^\hat{\sigma} is the area-weighted standard deviation of the vertex mean curvatures and nn is the number of vertices.

Once the PDF is obtained, we evaluate the density at 1000 evenly spaced values spanning the range of mean curvatures, and pick the value with the highest density as H∗H^*.

Evolution into CMC Surfaces

Given an input surface with a fixed boundary, we describe how it is evolved into a CMC surface, i.e. how we find a nearby critical point of EE. We saw how critical points of EE are precisely the CMC surfaces of target curvature H∗H^*. The simplest approach to finding a critical point is to descend on the energy, but this is only guaranteed to converge to a local minimizer. Certain saddle points, which are equally valid solutions (Figure 4), are therefore lost.

We root-find instead, in two phases. A derivative-free outer search first brings the surface to the prescribed curvature within a loose tolerance. Newton’s method on the curvature residual then takes over and converges quadratically, indifferent to whether the critical point is a minimum or a saddle. The goal of the first phase is to place the surface close enough for the second to converge reliably.

Reaching Newton’s basin. Following Pan et al. [ [34], we do not prescribe the curvature directly. Their energy

F(X;t)=Farea(X)+tFvol(X)(5)F(\mathbf{X};t)=F_{\mathrm{area}}(\mathbf{X})+tF_{\mathrm{vol}}(\mathbf{X}) \tag*{(5)}

weights the volume term by a scalar tt that acts as a force rather than a curvature. The central contribution of their work is that minimizing FF over the vertex positions X\mathbf{X} is stable across a far wider range of surfaces than prescribing H∗H^* outright. The price we pay is that curvature becomes an output: the minimizer is a CMC surface, but its mean curvature H(t)H(t) is now a function of tt. It is also a physically stable one — we show in Appendix D that a local minimizer of FF admits no volume-preserving deformation that decreases area.

Finding the CMC surface is therefore a scalar root-finding problem on tt. We define the residual as:

g(t)=H(t)−H∗(6)g(t)=H(t)-H^* \tag*{(6)}

and find t∗t^* with g(t∗)≈0g(t^*) \approx0. Every evaluation of gg runs a full inner minimization of (5) and extracts the area-weighted mean of its interior vertex mean curvatures from the resulting surface. We want the outer search to run as few of these evaluations as possible. Newton’s method is unavailable here, since dH/dtdH/dt would require differentiating through an arg min and a finite-difference estimate would cost a full extra minimization per step. We use a derivative-free method instead, built only from the (t,g)(t,g) pairs we already compute.

The search runs in one of two regimes, selected by whether the evaluations so far bracket the root. When two of them straddle zero, we take an Illinois step [10] giving us superlinear convergence. The bracket is preserved at every step, so the root can never be lost. When no bracket has been found yet, we fall back to a secant step using the two most recent evaluations, clamped by a trust radius so that a badly extrapolated chord cannot leave the branch we are solving on. Both regimes cost one gg evaluation per iteration. Algorithm 1 in Appendix § 12 gives the full search.

Newton refinement. The outer search gives us a surface whose mean curvature is already close to H∗H^*. Newton’s method enables us to fully converge, working directly with the curvature residual. The correction we solve for is a normal displacement of the surface: a scalar field φ\varphi that vanishes on the fixed boundary and moves the vertices by

X←X+φn.(7)\mathbf{X} \leftarrow\mathbf{X}+\varphi\mathbf{n}. \tag*{(7)}

Sliding a vertex tangentially does not change the surface, and so does not change its curvature. Such directions lie in the kernel of the Jacobian J\mathcal{J} of (9), and would make the linearized system singular. Restricting to normal displacements removes that null space and reduces the unknowns from 3n3n to one per interior vertex.

Newton’s method computes a φ\varphi that drives the pointwise residual

r=H−H∗(8)r = H - H^{*} \tag*{(8)}

to zero at every interior vertex, to first order in φ\varphi. Because H∗H^{*} is a constant, linearizing rr means linearizing the mean curvature, whose first variation under a normal displacement is the classical Jacobi operator [5, 39],

δH[φ]=−12(Δφ+∣A∣2φ)=−12Jφ,J=Δ+∣A∣2,(9)\delta H[\varphi] = -\frac{1}{2}\left(\Delta\varphi+ |A|^{2}\varphi\right) = -\frac{1}{2}\mathcal{J}\varphi,\qquad\mathcal{J} = \Delta+ |A|^{2}, \tag*{(9)}

where Δ\Delta is the Laplace–Beltrami operator and ∣A∣2=4H2−2K|A|^{2} = 4H^{2} - 2K is the squared norm of the second fundamental form. Setting the linearized residual to zero, r+δH[φ]=0r + \delta H[\varphi] = 0, gives the Newton step

Jφ=2r on Σ,φ=0 on ∂Σ.(10)\mathcal{J}\varphi= 2r \text{ on } \Sigma,\qquad\varphi= 0 \text{ on } \partial\Sigma. \tag*{(10)}

For discretization, we use the cotan Laplacian matrix LL and the diagonal mass matrix MM, so that Δ≈−M−1L\Delta\approx-M^{-1}L and J≈−M−1L+diag⁡(∣A∣2)\mathcal{J} \approx-M^{-1}L + \operatorname{diag}(|A|^{2}). Multiplying through by MM symmetrizes the system. Writing

S=L−diag⁡(M⊙∣A∣2),(11)S = L - \operatorname{diag}(M \odot|A|^{2}), \tag*{(11)}

with ⊙\odot the elementwise product, the Newton step becomes the sparse symmetric system

SIIφI=−2(M⊙r)I,φB=0,(12)S_{II}\varphi_{I} = -2(M \odot r)_{I},\qquad\varphi_{B} = 0, \tag*{(12)}

where II and BB index the interior and boundary vertices. Vertex curvatures come from Hi=12⟨(M−1LX)i,ni⟩H_i = \frac{1}{2}\langle(M^{-1}LX)_i,n_i\rangle, and KiK_i from the angle defect.

SS is an approximation to the true Jacobian of the residual with respect to all 3n3n coordinates, since it accounts only for normal motion and holds the operators fixed while differentiating. Each Newton iteration refreshes the operators, since the geometry of the surface changes with each iteration. We assemble LL, MM, nn, HH, KK and ∣A∣2|A|^{2} at the current positions, form the residual, solve Equation (12) for φ\varphi, and take the largest damping factor s∈{1,12,14,…}s \in\{1,\frac{1}{2},\frac{1}{4},\ldots\} for which X+sφnX + s\varphi n reduces ∥r∥\lVert r\rVert. The line search is on the residual and never on EE, since backtracking on the energy would reintroduce the descent bias we are trying to avoid. A handful of steps suffices, with the residual falling quadratically since we are already close to the solution.

Convergence. We terminate once ∥r∥∞\lVert r\rVert_{\infty} on the interior vertices falls below a tolerance, typically set to 10−610^{-6}. If the residual fluctuates or fails to converge smoothly, we take this as an empirical indication that no CMC surface exists for the specified target mean curvature and the given boundary.

Figure 3 shows simple examples of the evolution process and Figure 20 shows segmentation results on simple geometries produced using this CMC evolution procedure. The results of this procedure on the fully segmented Stanford Bunny can be seen in Figure 7.

Figure 3. Evolution of a simple patch sampled on Spot after running the CMC solver of Section 4.2. We sweep a small family of CMC surfaces of increasing target curvature H∗H^{*}.

Evolution of the bunny mesh into a piecewise CMC surface

Figure 7. Evolution of the bunny mesh (top row) into a piecewise CMC surface (bottom row) after running CMC evolution of Section 4.2. Target MC, H∗=0.8H^* = 0.8. Seams are shown in black and are fixed during the evolution process. We describe the full segmentation procedure in Section 4.

Segmentation of simple geometries into piecewise CMC surfaces

Figure 20. Segmentation of simple geometries into piecewise CMC surfaces. In this example, the target MC, H∗=1.0H^{*} = 1.0. The segment seams are shown in black. The evolution process of Section 4.2 has no problem converging to CMC surfaces that are saddle points of EE, such as the major caps of the sphere seen in all examples.

Segmentation - Merging through Graph Contractions

Now that we have a way to compute a target H∗H^{*}, and a CMC evolution procedure in place to tell us how much a potential segment on the surface deviates from its CMC counterpart, we can proceed with the description of the merging process for segmentation. We approach the segmentation problem through a graph contraction lens, where segments grow from a single element (mesh face).

Initially, every element is its own segment. We encode the segmentation as a graph whose nodes are elements and whose edges join adjacent elements, denoting potential expansion candidates for a segment. See Figure 9 for an example. Each edge stores the cost of merging the two segments it connects, computed as the error between the evolved/fitted CMC segment and the original geometry. Similar to QEM [20], we maintain a priority queue of these costs and contract the cheapest pair every iteration. We compute this cost of merging two segments as follows:

Figure 9. Graph contraction for merging. The example shows how the graph encodes the segmentation. Top: Segments C and D are merged together, since edge CD in red has the lowest cost. Bottom: Nodes C and D are contracted in the graph to reflect the merge above. The costs of the new edges formed also need to be updated, shown in green.

Surface Approximation Error

We score the cost of merging two segments by the root mean square error (RMSE) between the merged segment and the original target surface. Let x1,…,xmx_1, \ldots, x_m be the vertices of the combined segment on the target mesh and x~1,…,x~m\tilde{x}_1, \ldots, \tilde{x}_m their positions after the CMC evolution. The evolution usually leaves the mesh topology unchanged, so we measure the error between corresponding points,

RMSE=1m∑i=1m∥x~i−xi∥2.(13)\mathrm{RMSE} = \sqrt{\frac{1}{m}\sum_{i=1}^{m}\lVert\tilde{x}_i-x_i\rVert^2}. \tag*{(13)}

If the topology does change, for instance through remeshing, we instead take x~i\tilde{x}_i to be the closest point to xix_i on the evolved patch.

Each contraction forms a merged node containing multiple elements. We keep contracting until the error between a segment’s CMC approximation and its original geometry exceeds a user defined threshold (Figure 8), typically ε%\varepsilon\% of the diagonal of the mesh bounding box (set to 1% for most of our experiments).

Figure 8. Example of a good and bad merge. Top - Merged segments and their CMC counterpart stay within the error threshold, indicating a successful merge. Bottom - A failed merge operation where the resulting CMC surface deviates significantly from the target surface.

Handling Small Segments with MC Constrained Quadrics

The greedy nature of the algorithm described above can exploit the cost function in an undesirable fashion. Consider two segments whose union would be composed of a strip of triangles (inset). Every vertex in this strip sits on the boundary, and it contains no interior vertices. The evolution of § 3.2 pins boundary vertices, so there is nothing left to solve for and the patch is unchanged. The cost of contracting these segments is therefore 0. Since we always contract the cheapest edge, these segments merge first, and we get long thin strips that continue to grow without bounds. This is where the quadric fitting approach we describe next helps. It doesn’t reward thin meandering strips and promotes the creation of relatively rounder segments by sampling new elements uniformly during the initial phase of the segmentation. Once the segments have grown sufficiently and have enough resolution, we switch to the CMC evolution procedure described in § 3.2.

Shape approximations for different RMSE thresholds and segment counts

Figure 11. Impact of tuning plain RMSE for error threshold on shape approximation. Left to Right: 882, 381 and 231 segments. Target MC for all is H∗=0.02H^* = 0.02. Top Row: Segmentation results for various RMSE thresholds. Bottom Row: Evolved piecewise CMC structures.

We characterize a small segment as one having fewer than 50 elements. Until we have enough elements for a robust CMC evolution, we sample points uniformly around the segment within a ball of a small radius proportional to the average mesh edge length, similar to [Panozzo et al. 2010]. The quadric patch is rooted at the centroid of the vertices in the segment. The centroid is constrained to have mean curvature equal to the prescribed MC H∗H^* at that point. Figure 10 illustrates this process with an example. This helps serve as a useful proxy for a CMC patch for the initial part of the segmentation. As the segments grow larger, the quadric approximation becomes less accurate, so we switch to the evolution of § 3.2, which by then has enough resolution to work with.

Quadric fitting on Baymax, showing the fitted quadric patch and curvature directions

Figure 10. Quadric Fitting on Baymax. The target MC H∗=0.06H^* = 0.06 for this example with κ1≈κ2\kappa_1 \approx\kappa_2 at the center vertex (shown in yellow). The mean curvature at the center is HC=κ1+κ22=H∗=0.06H_C = \frac{\kappa_1+\kappa_2}{2} = H^* = 0.06.

Constrained Least Squares Fitting for Quadrics. Given the centroid pp of a segment, we build an orthonormal frame (t1,t2,n)(t_1,t_2,n) at pp, where t1t_1 and t2t_2 span the tangent plane and nn is computed similar to [Panozzo et al. 2010] (see blowup of Figure 10). Expressing nearby points in this frame turns the local surface into a height field over the tangent plane. Small segments have too few vertices of their own to fit against, so we gather samples from a ball of radius twice the average edge length of the mesh.

We model the patch as a quadratic height graph

h=w(u,v)=au2+buv+cv2+du+ev+f,(14)h = w(u,v) = au^2 + buv + cv^2 + du + ev + f, \tag*{(14)}

and fit its six coefficients to the samples in a least squares sense, subject to two constraints.

The first constraint makes the centroid a critical point of the graph. Requiring both first derivatives to vanish at the local origin reduces to d=0d = 0 and e=0e = 0 for this model. We call these the apex constraints, even though the critical point can be a saddle.

Comparison of non-compact and compact segmentations

Figure 12. Comparing segment Compactness and non-Compactness. Left: No compactness criteria enforced, segments are allowed to have free-flowing boundaries. Right: Compactness criteria enforced. All segments have a compactness score ≥0.3\ge0.3.

The second constraint prescribes the curvature. At a critical point of a height graph the mean curvature is H=(∂2u∂u2+∂2w∂v2)/2H = (\frac{\partial^2 u}{\partial u^2} + \frac{\partial^2 w}{\partial v^2})/2, which for (14) is simply a+ca + c. A target mean curvature H∗H^* is therefore the linear constraint a+c=H∗a + c = H^*.

Both constraints are linear in the coefficients, so instead of solving a constrained problem we substitute them into (14) directly. Three free coefficients remain, and the fit becomes an ordinary linear least squares solve. Appendix C provides the full derivation. The result is a patch that fits the local geometry and has exactly the prescribed mean curvature at its apex/centroid.

The cost of fitting this quadric is also computed via an error calculation (see Section 4.3.1) between the fitted patch and the sampled points on the mesh. Each sample is paired with the point on the quadric directly above or below it in the local frame, so the RMSE is taken over the height residuals w(uj,vj)−hjw(u_j,v_j)-h_j.

Merge Constraints

The wireframes extracted from the seams of the above segmentation process can sometimes be overly complex. These are thin intricate structures that are 3D printed and may require substantial support material. We keep the fabrication complexity in check by enforcing the following criteria and describe an approach to improve the plain RMSE metric.

Segment Manifoldness for Printability

We prevent the formation of non-manifold segments by setting the cost to create them to ∞\infty. This corresponds to setting the edge cost in the graph between nodes whose union would give non-manifold segments to ∞\infty.

Compactness

Enforcing segment compactness helps reduce the area occupied by the extracted frame on the mesh. However, the right balance is important, since an overly strong compactness requirement can have the opposite effect. We use the inverse of the irregularity measure in [21] to quantify segment compactness. For planar circular disk shaped segments, this measure approaches 1, indicating high compactness, while for elongated or jagged segments, it approaches 0, indicating low compactness. It may exceed 1 in case of non-planar patches, but gives a practical method for mitigating most complex segments. Figs. 12 and 18 compare the compact and non-compact segmentation outcomes. It’s important to note that we use this as a threshold to prevent merging of certain segments, and not as an additional term added to the cost. Our examples typically use a compactness threshold of 0.3. In practice, we set the edge weight between two nodes (segments) to be ∞\infty if merging them would create a segment with compactness score less than 0.3.

Normal Deviation Threshold

We propose a threshold that helps approximate bulk regions with fewer segments while capturing sharper regions more faithfully, effectively adapting to local geometry. The metric takes a normal-deviation threshold angle as input: if any vertex normal on the evolved CMC patch deviates from the target by more than this angle, the corresponding merge is disallowed by setting that edge’s cost to ∞\infty. Fig. 13 shows the effect of this threshold on the segmentation.

Segmentation results for normal deviation thresholds

Figure 13. Normal Deviation Threshold helps segmentation adapt to local geometry. Target MC for both examples is H∗=0.02H^* = 0.02. Left Column: Segmentation results. Right Column: Evolved piecewise CMC surfaces. Top Row: Only RMSE threshold set to 1%. Bottom Row: RMSE threshold set to 1% + Normal deviation tolerance set to 20∘20^\circ.

Implementation Details

This section describes the lower-level details that make the segmentation algorithm reliable in practice, including the initialization strategy and the constraints we impose on the segmentation. We then show how the segmentation is used to extract the bounding frame, and close with details of the fabrication process.

Initial Segmentation for Cut Preservation

Our segmentation method can preserve cuts from an existing initial segmentation. Such cuts can be vital in regions of sharp detail that must not be smoothed over or lost. In Fig. 14, we initialize with spectral clustering and then apply our CMC segmentation. All cuts from the initial segmentation are preserved in the final result. Spectral clustering was run using an affinity graph penalizing differences between mean curvatures of adjacent vertices [51]. This promotes cuts in regions of high mean curvature variation.

Initial segmentation and P-CMC segmentation of two models

Figure 14. Left: Initial Segmentation. Right: P-CMC segmentation that follows ensures cuts from initial segmentation are preserved.

Solid Regions

Some regions of the structure may need to be 3D printed in full rather than only at the seams between segments, when exact geometric fidelity is required. This can be enforced as an additional constraint on the segmentation. One option is to detect such regions automatically with a simple criterion such as flatness: any vertex whose mean curvature is very close to zero is marked as an isolated vertex in the graph. Isolated vertices cannot be merged with any other vertex during the contraction process, so a contiguous patch of them is never absorbed into neighboring segments. Alternatively, regions can be specified manually by designating certain segments of an initial segmentation to be fully solidified. In both cases, the faces of these regions are added to the strip extracted from the segmentation seams, so they are printed together with the frame. See Figure 15 (the back of the bracket) for an example.

Segmentation, thin strip extraction, and final 3D printable frame extraction

Figure 15. Left to Right: Segmentation, Thin strip extraction and Final 3D printable frame extraction. The back of the bracket is made solid, and will be 3D printed.

3D Printing the Frame

Seam Smoothing

We use Taubin Smoothing [50] to smooth wiggly seams. The smoothing helps even out seams with high local curvature fluctuations. This helps reduce stress concentrations on the frame and also adds to the aesthetic appeal.

Frame Extraction and Solidification

The thin strip extracted from the seams cannot directly be 3D printed because it lacks volume. We create a UDF for the seam network that adds uniform thickness in all directions, and use marching cubes for the final mesh extraction. This guarantees self-intersection-free, 3D printable frames (see Figure 15). Because our structures are thin, wireframe-like scaffolds, they require substantial support material to print. We use dissolvable supports so they can be removed easily during post-processing.

Fluidic Fabrication

Once the wireframe scaffold is 3D printed, it serves as a support structure for the fluidic fabrication process. We immerse the scaffold into a bath whose density matches that of the liquid polymer. The polymer is then deposited onto the scaffold, and interfacial tension between the two fluids causes it to form a smooth, continuous

surface that conforms to the underlying wireframe. Some liquid polymers self cure, while others can be cured via UV light. We refer the reader to [22] for a more comprehensive description of the fabrication process.

Results and Discussion

We present both fabricated as well as simulated results to show the efficacy of our piecewise-CMC segmentation method for fabricating freeform structures with fluidic shaping. We will also show how our method achieves better approximation to the input target geometry, compared to using standard developability or conformal distortion minimizing segmentation frameworks such as D-Charts [27] and Variational Surface Cutting (VSC) [44] respectively.

Fabricated Results

We fabricated three Stanford bunny models and a prosthetic hand using the fluidic fabrication process. The blue bunny and red hand can be seen in the teaser image in Figure 1. The second and third bunnies are cream colored, shown in Figure 18. The fabricated models show good agreement with the input target geometry. We evaluate them purely visually, and didn’t take quantitative measurements by scanning the fabricated model to compute the differences.

Comparison of compact vs non-compact segmentation and corresponding fabricated outcomes

Figure 18. Comparison of compact VS non-compact segmentation and the corresponding fabricated outcomes. Left: Simulated Results. Right: Fabricated Results. Top row: Compact segmentation. Bottom row: Non-compact segmentation.

Figure 18 shows the cream colored bunnies fabricated using a compact and non-compact wireframe scaffold. On the left column, we showcase the simulation results, and the right column displays the corresponding fabricated models. We see good agreement between what the simulation predicts and the actual fabricated models.

Simulated Results

We show some simulation only results for the piecewise-CMC segmentation method. After a segmentation is computed for the input target geometry, we run the P-CMC evolution described in § 3.2. This gives a good proxy for what the final fabricated surface would look like, allowing us to evaluate the efficacy of the segmentation without the need for physical fabrication. Figure 16 shows the simulated results for three different input target geometries - the Fandisk model, the Rocker model and Homer. We observe that the simulated surfaces closely follow the input target geometries, and mean curvature difference is concentrated on the seams. As an example, if we look at the Rocker model (middle row), we see the raw mean curvature is really positive on the sharp rims and negative in the saddle type regions. But most of the structure has mean curvature close to 0. The MC estimator of § 3.1 outputs an H∗=−0.02H^* = -0.02. Our segmentation hence places the seams in regions where mean curvature difference H−H∗H - H^* is high, and allows the rest of the structure to be smooth and have a mean curvature equal to -0.02. We can observe similar behavior in the Fandisk and Homer models as well.

Simulated results for various meshes

Figure 16. Simulated results for various meshes. We use target mean curvatures H∗=0.02H^* = 0.02, H∗=−0.02H^* = -0.02 and H∗=1.68H^* = 1.68 for the Fandisk, Rocker and Homer meshes respectively computed from the MC estimator of § 3.1.

Ground Truth Tests

We segment some geometries whose results are known to us beforehand – hence they make for good ground truth tests. These models are made up of the simplest CMC shapes such as spheres and cylinders. We showcase 3 such models in Figure 20; the first one is a dumbbell where a cylinder connects two sphere caps, the second and third ones are 3 spheres fused together in different ways. Note that all spherical regions are major caps, and the CMC evolution procedure of Section 4.2 converges to them without difficulty, which allows the segmentation to segregate them effectively.

Comparisons with VSC

We also show the efficacy of our piecewise-CMC segmentation method by comparing it with the VSC method. It is important to note that VSC optimizes for segments

that minimize conformal scaling upon flattening to the plane. The goal is to demonstrate that the underlying physical process - Fluidic Shaping; informs a certain type of geometry - CMC surfaces; and it is paramount to account for it in the segmentation to achieve good target shape approximations.

To make the comparison as fair as possible, we ensure that VSC produces a segmentation such that total seam length of the cuts is almost equal to that of our piecewise-CMC segmentation. We initialized VSC with the Normal Clustering scheme, as they did in the original paper [44]. Figure 19 shows a qualitative comparison between the two methods. We perform the P-CMC segmentation with a target H∗H^{*} computed using the method described in Section 4.1. Once we obtain both segmentations, we run the P-CMC evolution on the input target geometry with seams from each segmentation as the fixed boundary conditions and the target H∗H^{*}. We can see the resulting simulated surfaces in the middle and right in Figure 19. The VSC segmentation results in a simulated surface that deviates more from the target geometry, as can be seen in the ear and head regions. The sides of Spot are also more inflated than they should be. For a better visualization, we urge the reader to refer to Figure 17, middle row.

Comparison of deviation plots for various meshes

Figure 17. Comparison of deviation plots for various meshes between our method, VSC and D-Charts. From Left to Right: Target Geometry, Segmentation computed by our method, corresponding simulated result with deviation from target visualized, Segmentation computed by VSC, corresponding Simulated result with deviation from target visualized, Segmentation computed by D-Charts, corresponding Simulated result with deviation from target visualized. The target mean curvatures are H∗=0.8H^* = 0.8, H∗=1.8H^* = 1.8 and H∗=−0.02H^* = -0.02 for the Bunny, Spot and Rocker meshes respectively.

Comparison of our method with Variational Surface Cutting

Figure 19. Comparison of our method with Variational Surface Cutting (VSC)[44]. Simulated results demonstrate our P-CMC segmentation outperforms VSC in preserving the target geometry.

Figure 17 also showcases the Bunny and Rocker model comparisons in the top and bottom rows. In each of the two models, our method produces a better overall global target shape approximation compared to VSC. Table 1 provides the quantitative deviations of the simulated surfaces from the target meshes. Across all metrics, observe that our method consistently achieves lower deviations than VSC. We can hence claim that a segmentation tailormade for the underlying physical process of fluidic shaping leads to superior target shape approximations, compared to a general purpose segmentation.

MeshMethodMeanRMSP95Max
BunnyOurs0.200.310.711.34
BunnyVSC0.350.871.616.97
BunnyD-Charts0.230.330.693.5
SpotOurs0.150.220.490.95
SpotVSC0.280.471.222.51
SpotD-Charts0.170.250.491.64
RockerOurs0.110.160.350.78
RockerVSC0.220.400.863.13
RockerD-Charts0.140.180.332.12

Table 1. Deviation of the simulated piecewise-CMC surfaces from the target meshes of Figure 17, as a percentage of the bounding box diagonal of the target mesh. P95 is the 95th percentile. Lower is better.

There are some regions on these target geometries where VSC can perform better, because it creates more cuts in those regions (see Figure 17, top row). In the Bunny model for instance, the VSC segmentation places more cuts in the back of the bunny, which helps to reduce the deviation in that area. However, we can interpret this as VSC spending more seam budget on those regions at the expense of other areas, such as the ears, which are heavily distorted. Our approach on the other hand, is guaranteed to keep the RMSE error between the CMC surface and the target patch below a user defined threshold. This ensures no particular region is favored, and hence ensures a better global shape approximation. This is also important for certain applications where we want as much smoothness as possible and minimum amount of 3D printed frame necessary to maintain a good approximation to the target.

Comparisons with D-Charts

We also compare our piecewise-CMC segmentation method with D-Charts. D-Charts is a segmentation method that aims to partition the surface into regions that are as developable as possible. It requires kk as input, where kk is the number of desired segments. We pick kk such that the total seam is length is close to that of our piecewise-CMC segmentation for a fair comparison. As we saw with the VSC method, the D-Charts segmentation also results in simulated surfaces that deviate more from the target geometry, particularly in regions where the segmentation places fewer cuts (Figure 17).

Limitations and Future Work

Figure 21 illustrates the effect of different target mean curvatures on the segmentation results. The total seam length LL varies with the choice of H∗H^*, highlighting the sensitivity of the segmentation to the target curvature. Our MC estimator heuristic of § 3.1 provides a practical way to estimate H∗H^* from the target geometry, but it may not always yield the optimal value for minimizing the total seam length, as can be seen in the third result from the left, where the estimated H∗=1.88H^* = 1.88 does not achieve the minimum LL.

Segmented bunny meshes with different target mean curvatures

Figure 21. Segmenting the mesh with different target mean curvatures H∗H^*. LL denotes the total seam length produced by the segmentation. H∗=1.88H^* = 1.88 for the third result from left was computed using the MC estimator of § 3.1.

The greedy merging combined with the compactness criterion prevents certain merges that reduce compactness in the current merge cycle, but another merge later on might improve the overall compactness. This can lead to segmentation outcomes that need more patches than necessary. A potential solution would be use hypergraphs that can encode 3 or 4 way merges and have a certain look-ahead capability to evaluate the impact of future merges on the overall compactness.

The underlying physics of the fabrication process allows for only one global pressure or mean curvature H∗H^*, as we explored in § 2.2. Since most target geometries have varying mean curvatures, this leads to the creation of more scaffolding in regions where the local mean curvature deviates from the global value H∗H^*. An interesting future work would be to allow multiple mean curvatures, by separating the fluid bodies through internal routing in the structure.

Building on the work from Bhundiya and Cordero [2023] and Faruqi et al. [2025], future research could also explore the integration of 3D bend-forming techniques with our piecewise-CMC segmentation method to fabricate the 3D wireframe scaffolds much faster. These metal scaffolds can also serve as durable reinforcements and make the cured polymer structures stronger and more resilient.

Conclusion

We presented a piecewise CMC segmentation method that extends fluidic shaping from single optical surfaces to freeform 3D geometry. Given a target mean curvature, our method grows segments through graph contractions until a patch can no longer be approximated by a CMC surface within a user-defined tolerance, concentrating the non-CMC features of the target onto a sparse set of seams. These seams become a 3D printed frame that pins the polymer interface, while surface tension shapes the remaining bulk into smooth patches without layer-wise deposition or post-processing. Fabricated prototypes visually agree with simulation, and our simulated surfaces approximate the targets with consistently lower deviation than a general-purpose segmentation of comparable seam length.

Critical Points of EE are CMC Surfaces

Using standard discrete differential geometry [9, 32], the gradients of the two terms in Equation (2) are

∇A(X)=2MHn,∇V(X)=Mn,(15)\nabla A(X)=2MH\mathbf{n},\qquad\nabla V(X)=M\mathbf{n}, \tag*{(15)}

where MM is the lumped mass matrix of vertex areas, HH the vertex mean curvatures and n\mathbf{n} the vertex normals, all of which depend on the current geometry XX. Differentiating Equation (2) and substituting Equation (15) gives a clean expression for the energy gradient,

∇E(X)=2M(H−H∗)n.(16)\nabla E(X)=2M\left(H-H^*\right)\mathbf{n}. \tag*{(16)}

Since MM is diagonal with strictly positive entries and the ni\mathbf{n}_i are unit vectors, ∇E(X)=0\nabla E(X)=0 holds if and only if Hi=H∗H_i=H^* at every interior vertex. Critical points of EE are thus precisely the discrete CMC surfaces of target curvature H∗H^*. Boundary vertices are pinned by the wireframe scaffold and are held fixed throughout, so the gradient is only ever enforced on the interior degrees of freedom.

Physical Connection: Surface Tension, Pressure and CMC Equilibrium

In this section, we derive the static force balance of Equation (3), and then shows that the critical points of the geometric energy EE of Equation (2) satisfy it.

Surface tension as an area-minimizing force

A surface with surface tension coefficient α\alpha stores an interfacial energy proportional to its area around a point xx [28],

Esurf(x)=αA(x),(17)E_{\mathrm{surf}}(x) = \alpha A(x), \tag*{(17)}

so any deformation that increases area increases energy. The surface-tension force per unit area is proportional to the negative gradient of area with respect to the surface position xx,

fst(x)∝−α∂A(x)∂x.(18)f_{\mathrm{st}}(x) \propto-\alpha\frac{\partial A(x)}{\partial x}. \tag*{(18)}

For smooth surfaces, the first variation of area is the mean-curvature normal,

∂A(x)∂x=2H(x)n(x),(19)\frac{\partial A(x)}{\partial x} = 2H(x)n(x), \tag*{(19)}

so surface tension acts along −2αHn-2\alpha Hn, i.e. opposite the outward normal, moving the surface in the direction that reduces area the fastest.

Pressure as a pushback against contraction

Left unopposed, this area-minimizing force would collapse any closed surface. The incompressible fluid trapped inside resists, pushing back against the contraction with a force

fp(x)∝Δp n(x),(20)f_p(x) \propto\Delta p\,n(x), \tag*{(20)}

where Δp\Delta p is the pressure excess at xx.1

Static equilibrium of the interface

A surface-only dynamics model [25] combining the above two effects is

ρsd2xdt2=−α∂A(x)∂x+Δp n,(21)\rho_s \frac{d^2x}{dt^2} = -\alpha\frac{\partial A(x)}{\partial x} + \Delta p\,n, \tag*{(21)}

where ρs\rho_s is an effective surface mass density. At static equilibrium the acceleration vanishes, and Equation (21) reduces to a balance between the inward pull of surface tension and the outward push of pressure, which is exactly Equation (3) of the main text.

Recovering the force balance from the geometric model

It remains to show that the critical points of EE satisfy Equation (3). Expanding the stationarity condition ∇E(X)=0\nabla E(X)=0 for the energy in

(2) gives

∇A(X)−2H∗∇V(X)=0⟹∇A(X)=2H∗∇V(X).(22)\nabla A(X) - 2H^* \nabla V(X) = 0 \Longrightarrow\nabla A(X) = 2H^* \nabla V(X). \tag*{(22)}

Multiplying both sides by the surface tension coefficient α\alpha and substituting the discrete gradients of Equation (15),

α (2MHn)=(2αH∗) Mn.(23)\alpha\,(2MHn) = (2\alpha H^*)\,Mn. \tag*{(23)}

The Young–Laplace law of Equation (4) identifies the bracketed constant on the right hand side as the pressure jump Δp\Delta p sustained by an interface of mean curvature H∗H^*. Substituting it into Equation (23) and cancelling the mass matrix MM, which is diagonal with strictly positive entries, leaves

α (2Hn)=Δp n,(24)\alpha\,(2Hn) = \Delta p\,n, \tag*{(24)}

which, by the continuum area gradient of Equation (19), is exactly the force balance of Equation (3), with the target curvature H∗H^* and the pressure jump Δp\Delta p related through Equation (4).

Constrained Quadric Fitting

This section derives the constrained least squares system used to fit quadrics to small segments in § 3.5.

Local height-graph coordinates

Given a vertex pp representing the centroid of a segment, we collect a neighborhood of nearby sample points {Pk}\{P_k\} and approximate the local surface by a quadratic height field in the frame (t1,t2,n)(t_1,t_2,n) at pp. Each neighboring point PkP_k is expressed in local coordinates (uk,vk,hk)(u_k,v_k,h_k) via

\begin{bmatrix} u_k \\ v_k \\ h_k \end{bmatrix} = \begin{bmatrix} -t_1^{\mathsf{T}} \\ -t_2^{\mathsf{T}} \\ -n^{\mathsf{T}} \end{bmatrix}(P_k-p). \tag*{(25)}\end{bmatrix}

which gives a height-graph representation of the local geometry around pp. The patch is modeled by the quadratic of Equation (14), with unknown coefficients θ=[a,b,c,d,e,f]T\theta=[a,b,c,d,e,f]^{\mathsf{T}}.

Apex constraints

We want the central vertex pp to correspond to a critical point of the fitted graph, and impose zero first derivatives at the local origin to accomplish this:

∂w∂u(0,0)=0,∂w∂v(0,0)=0.(26)\frac{\partial w}{\partial u}(0,0)=0,\qquad\frac{\partial w}{\partial v}(0,0)=0. \tag*{(26)}

For the quadratic model,

∂w∂u=2au+bv+d,∂w∂v=bu+2cv+e,(27)\frac{\partial w}{\partial u}=2au+bv+d,\qquad\frac{\partial w}{\partial v}=bu+2cv+e, \tag*{(27)}

so the apex constraints imply d=0d=0 and e=0e=0.

Prescribing the mean curvature

With the apex constraints in place, the mean curvature at the apex takes a simple form. For a height graph z=w(u,v)z=w(u,v), the mean curvature at a critical point is

H=wuu+wvv2.(28)H=\frac{w_{uu}+w_{vv}}{2}. \tag*{(28)}

For the quadratic model the second partials are wuu=∂2w∂u2=2aw_{uu}=\frac{\partial^2w}{\partial u^2}=2a and wvv=∂2w∂v2=2cw_{vv}=\frac{\partial^2w}{\partial v^2}=2c, so

H=a+c.(29)H=a+c. \tag*{(29)}

and prescribing a target mean curvature H∗H^* yields the linear constraint a+c=H∗a+c=H^*. We enforce it by eliminating a degree of freedom, introducing δ=a−c\delta=a-c so that

a=H∗+δ2,c=H∗−δ2.(30)a=\frac{H^*+\delta}{2},\qquad c=\frac{H^*-\delta}{2}. \tag*{(30)}

The reduced least squares system

Substituting these expressions, together with the apex constraints d=e=0d=e=0, into the quadratic model gives

w(u,v)=H∗2(u2+v2)+δ2(u2−v2)+buv+f.(31)w(u,v)=\frac{H^*}{2}(u^2+v^2)+\frac{\delta}{2}(u^2-v^2)+buv+f. \tag*{(31)}

Treating H∗H^* as fixed, the unknowns reduce to θ=[δ,b,f]T\boldsymbol{\theta}=[\delta,b,f]^{\mathsf{T}}. Each sample point (uk,vk,hk)(u_k,v_k,h_k) then contributes the linear relation

δ2(uk2−vk2)+bukvk+f≈hk−H∗2(uk2+vk2),(32)\frac{\delta}{2}(u_k^2-v_k^2)+bu_kv_k+f\approx h_k-\frac{H^*}{2}(u_k^2+v_k^2), \tag*{(32)}

and stacking all samples yields a linear least-squares system Bθ≈y\mathbf{B}\boldsymbol{\theta}\approx\mathbf{y}, which we solve for the constrained quadric coefficients. This produces a local quadratic patch that both fits the data and satisfies the prescribed apex and mean-curvature constraints.

D Minimizers of the Robust CMC Energy are Stable

The outer search of Section 4.2 reaches Newton’s basin by repeatedly minimizing the energy F(X;t)F(X;t) (to compute the residual H∗−HH^*-H) of Equation (5), from [34]. We show in the following that those inner minimizations produce physically stable CMC surfaces: among all nearby surfaces holding the same boundary and enclosing the same volume, it is the one of least area. This property decides whether a CMC patch can be fabricated at all, since it is the shape the polymer settles into once the frame is filled.

The physical reading of this result is as follows. A fixed volume of polymer pinned by the wireframe settles into the shape that minimizes interfacial area at that volume. Such a shape is at equilibrium and no small volume-preserving disturbance can lower its energy, so it doesn’t carry any unstable modes or directions.

Definition D.1 (Stability). A CMC surface Σ0\Sigma_0 with pinned boundary is stable if A(Σ)≥A(Σ0)A(\Sigma)\geq A(\Sigma_0) for every nearby surface Σ\Sigma that shares the boundary of Σ0\Sigma_0 and encloses the same volume, V(Σ)=V(Σ0)V(\Sigma)=V(\Sigma_0).

The energy of Equation (5) pairs an extended centroidal Voronoi tessellation term with the volume functional Fvol=3VF_{\mathrm{vol}}=3V, where VV is the signed enclosed volume. For a fixed sampling, the ECVT term is asymptotically proportional to the squared area [34], which gives the smooth surrogate

F(Σ;t)=cA(Σ)2+3tV(Σ),c>0,(33)F(\Sigma;t)=cA(\Sigma)^2+3tV(\Sigma),\qquad c>0, \tag*{(33)}

Minimizing the energy minimizes area at fixed volume

Proposition D.2 (Stability of the computed surfaces). Let Σ0\Sigma_0 be a local minimizer of F(⋅;t)F(\cdot;t) of Equation (33) over surfaces with the boundary pinned, with A(Σ0)>0A(\Sigma_0)>0. Then Σ0\Sigma_0 is stable in the sense of Definition D.1.

Proof. Let Σ\Sigma be any nearby surface that shares the boundary of Σ0\Sigma_0 and encloses the same volume, V(Σ)=V(Σ0)V(\Sigma)=V(\Sigma_0). Since Σ0\Sigma_0 is a local minimizer of FF,

0≤F(Σ)−F(Σ0)=c[A(Σ)2−A(Σ0)2]+3t[V(Σ)−V(Σ0)]=c[A(Σ)2−A(Σ0)2],(34)\begin{aligned} 0\leq F(\Sigma)-F(\Sigma_0) \\ &=c\left[A(\Sigma)^2-A(\Sigma_0)^2\right]+3t\left[V(\Sigma)-V(\Sigma_0)\right] \\ &=c\left[A(\Sigma)^2-A(\Sigma_0)^2\right], \tag*{(34)} \end{aligned}

where the volume terms cancel identically because the perturbation preserves volume. Since c>0c>0, this gives A(Σ)2≥A(Σ0)2A(\Sigma)^2\geq A(\Sigma_0)^2, and as both areas are positive, A(Σ)≥A(Σ0)A(\Sigma)\geq A(\Sigma_0). If Σ0\Sigma_0 is a strict local minimizer the inequalities are strict, making it the unique area minimizer among the nearby surfaces at its own volume. □\square

Saddle points of E can still be stable

Section 3.1 describes the major spherical cap as a saddle point of the physically based energy E=A−2H∗VE=A-2H^*V, while Proposition D.2 asserts that everything the root finder returns is stable. We will establish a connection between the two energies, EE and FF, in the following.

A saddle point of EE is unconstrained: it permits deformations that change the enclosed volume. For a spherical cap on a fixed boundary circle, the unstable direction is the one that slides the surface through the family of caps on that circle, growing the minor cap into the major one. That motion changes the enclosed volume, so it is inadmissible the moment the fluid body is fixed. Removing it drops the index—the number of independent directions along which the surface can shed energy, from one to zero.

On the set where V(Σ)=V0V(\Sigma)=V_0, the energy can be written as

E(Σ)=A(Σ)−2H∗V0(35)E(\Sigma)=A(\Sigma)-2H^*V_0 \tag*{(35)}

so minimizing area at fixed volume and minimizing EE become the same problem. A surface can accordingly be a saddle of EE in the unconstrained problem and a minimizer of that very same EE once the volume is pinned.

This is what makes the major caps of Figure 20 fabricable rather than merely computable. Each is produced as a local minimizer of FF and is therefore stable by Proposition D.2: a genuine equilibrium of the filled frame, not a configuration the fluid would immediately leave.

Numerical verification

Proposition D.2 can be checked empirically on the meshes. Figure 22 shows runs of our evolution process (Section 4.2) on a set of known

Input CMC surfaces, outer search plus Newton, and Newton only

Figure 22. Left: input CMC surfaces, with their fixed boundaries in red. Center: the result of the outer search followed by Newton refinement (Section 4.2). Right: the result of Newton refinement alone. Newton alone stays on the input whether or not it is stable, while the root finder returns only stable surfaces (Table 2).

MeshNumber of negative fixed-volume modes
Major cap0
helic10
helic21
Catenoid0
undu_thin1
Cylinder0
undu_1_bulge0
undu_3_bulges4

Table 2. Number of negative fixed-volume modes of the surfaces in Fig. 22. A surface with at least one such mode can lower its area at a fixed volume and is therefore unstable.

CMC surfaces, once with the full two-phase solver and once with Newton’s method alone. Table 2 reports the negative fixed-volume modes for every surface. These modes can be computed via Surface Evolver, by setting a fixed volume constraint and evaluating the Hessian of energy EE.

Every surface the root finder (outer search + Newton) returns has 0 negative fixed-volume modes, as Proposition D.2 predicts. Newton’s method alone is indifferent to stability: it stays on the CMC surfaces helic2, undu_thin and undu_3_bulges, which carry one, one and four negative modes respectively. A frame filled with polymer fluid wouldn’t be able to hold these. On helic2 and undu_thin, the root finder instead settles on a stable CMC surface with the same boundary, helic1 and a cylinder respectively. It fails on both bulged unduloids, including the stable undu_1_bulge, due to an issue in computing a stable t0t_0 (Equation (36)) to start the inner solve for the root finder (Algorithm 1). The empirical evidence thus shows that

when the root finder does converge, it returns a stable CMC surface as per Definition D.1.

Since every evaluation of the residual g(t)g(t) of Equation (6) requires a minimization of FF, the root finder walks along the curve H(t)H(t) of stable surfaces. Figure 23 plots this curve for segments of the Bunny and Spot models. The curve is monotone through t=0t=0, but turns over at an extremum, beyond which ∣H∣\lvert H\rvert decreases as ∣t∣\lvert t\rvert grows. A target H∗H^* short of the extremum is therefore reached at two values of tt, one on either side of it, and a target beyond it is not reached at all. Near the extremum the slope of H(t)H(t) vanishes, so a secant step there can be thrown far along tt and onto the other branch. The search of Appendix E guards against both effects: it bounds each secant step by a trust radius, and it runs a separate path on each side of its starting weight, keeping the nearer root.

Figure 23. Top: Mean curvature H(t)H(t) of the minimizer of F(⋅;t)F(\cdot;t) as a function of the volume weight tt of Equation (5), for randomly sampled segments on the Bunny (blue) and Spot (orange) models. Curve in black shows selected patch. Bottom: Zoomed in version of the curve and some snapshots of the corresponding CMC surfaces with increasing tt. We can see "small" and "large" solutions akin to minor and major caps of a sphere respectively.

Two-Path Root Search

Algorithm 1 demonstrates the outer search of Section 4.2. Initially, it computes a volume weight t0t_0 that gives the closest CMC surface to the input geometry, as in [34]

t0=−1nI∑i⟨∇iFarea,∇iFvol⟩∥∇iFvol∥(36)t_0=-\frac{1}{n_I}\sum_i\frac{\langle\nabla_i F_{\mathrm{area}},\nabla_i F_{\mathrm{vol}}\rangle}{\lVert\nabla_i F_{\mathrm{vol}}\rVert} \tag*{(36)}

where nIn_I is the number of interior vertices, FareaF_{\mathrm{area}} and FvolF_{\mathrm{vol}} are the area and volume functionals, and ∇i\nabla_i denotes the gradient with respect to the ii-th vertex.

Since H(t)H(t) is not monotone (Figure 23), the target can have a root on either side of t0t_0, so we search both sides with two independent paths: one deflating the surface (d=−1d=-1, decreasing tt) and one inflating it (d=+1d=+1). For an input which is a minimal surface or close to one, t0=0t_0=0 and already sits at H=0H=0, so only the path toward the sign of H∗H^* is run. Each path starts from a probe a small step ϵ\epsilon away from t0t_0, and runs the secant or Illinois steps of Section 4.2. The trust radius δ\delta caps how far a single secant step may move tt; it grows after a step that reduces ∣g∣\lvert g\rvert and halves after one that does not. A path that finds no root on its side simply fails, and the other path covers it. Of the paths that converge, we keep the one whose computed tt is closest to t0t_0. This gives us a surface whose average mean curvature is ≈H∗\approx H^*

Algorithm 1 Two-path search for tt, s.t. g(t)=H(t)−H∗=0g(t)=H(t)-H^*=0

Require: surface XX with pinned boundary, target H∗H^*, tolerance τ\tau, probe step ϵ\epsilon, trust radius δ\delta

  1. t0←t_0 \leftarrow starting weight of XX, Equation (36)

  2. if ∣g(t0)∣≤τ|g(t_0)| \le\tau then return t0t_0

  3. dirs←{−1,+1}\mathrm{dirs} \leftarrow\{-1,+1\}    ▹ deflate, inflate

  4. if t0=0t_0=0 then dirs←{sign⁡H∗}\mathrm{dirs} \leftarrow\{\operatorname{sign}H^*\}    ▹ minimal input

  5. for d∈dirsd \in\mathrm{dirs} do    ▹ one path per direction

  6. ta←t0, tb←t0+dϵt_a \leftarrow t_0,\ t_b \leftarrow t_0+d\epsilon

  7. repeat

  8.   if a bracket on the root is known then

  9.     t←t \leftarrow Illinois step on the bracket

  10.   else

  11.     t←t \leftarrow secant step from ta,tbt_a,t_b, with ∣t−tb∣≤δ|t-t_b| \le\delta

  12.   end if

  13.   keep tt on its own side: d(t−t0)≥0d(t-t_0) \ge0

  14.   evaluate g(t)g(t), warm-started from the surface at tbt_b

  15.   ta←tb, tb←tt_a \leftarrow t_b,\ t_b \leftarrow t

  16. until ∣g(tb)∣≤τ|g(t_b)| \le\tau or the evaluation budget is spent

  17. td←tbt_d \leftarrow t_b

  18. end for

  19. return the converged tdt_d closest to t0t_0

that is closest to the input geometry. If a solution within tolerance τ\tau isn’t reached after a certain number of iterations, the root finder terminates and reports failure.

References

  1. [1]Marco Attene, Bianca Falcidieno, and Michela Spagnuolo. 2006. Hierarchical Mesh Segmentation Based on Fitting Primitives. The Visual Computer 22, 3 (2006), 181–193. doi:10.1007/s00371-006-0375-xDOI
  2. [3]Kenneth A Brakke. 1992. The surface evolver. Experimental mathematics 1, 2 (1992), 141–165.DOI
  3. [4]Kenneth A Brakke. 1996. The surface evolver and the stability of liquid surfaces. Philosophical Transactions: Mathematical, Physical and Engineering Sciences (1996), 2143–2157.
  4. [5]Nicholas D Brubaker. 2018. A continuation method for computing constant mean curvature surfaces with boundary. SIAM Journal on Scientific Computing 40, 4 (2018), A2568–A2583.arxiv.org/abs/1808.01401
  5. [8]David Cohen-Steiner, Pierre Alliez, and Mathieu Desbrun. 2004. Variational Shape Approximation. ACM Transactions on Graphics 23, 3 (2004), 905–914. doi:10.1145/1015706.1015817 Proc. SIGGRAPH.
  6. [9]Keenan Crane. 2018. Discrete differential geometry: An applied introduction. Notices of the AMS, Communication 1153, 2 (2018).
  7. [10]M. Dowell and P. Jarratt. 1971. A modified regula falsi method for computing the root of an equation. BIT Numerical Mathematics 11, 2 (1971), 168–174.DOI
  8. [11]Senthilkumar Duraivel, Dimitri Laurent, Didier A Rajon, Georg M Scheutz, Abhishek M Shetty, Brent S Sumerlin, Scott A Banks, Frank J Bova, and Thomas E Angelini. 2023. A silicone-based support material eliminates interfacial instabilities in 3D silicone printing. Science 379, 6638 (2023), 1248–1252.
  9. [13]Michael Eigensatz, Martin Kilian, Alexander Schiftner, Niloy J. Mitra, Helmut Pottmann, and Mark Pauly. 2010. Paneling Architectural Freeform Surfaces. ACM Transactions on Graphics 29, 4, Article 45 (2010), 45:1–45:10 pages. doi:10.1145/1778765.1778782 Proc. SIGGRAPH.DOI
  10. [14]Mor Elgarisi, Valeriy Frumkin, Omer Luria, and Moran Bercovici. 2021. Fabrication of freeform optical components by fluidic shaping. Optica 8, 11 (2021), 1501–1506.
  11. [15]Mor Elgarisi, Omer Luria, Yotam Katzman, Daniel Wiederker, Valeri Frumkin, and Moran Bercovici. 2025. Fabrication of ophthalmic lenses by Fluidic Shaping. Additive Manufacturing 109 (2025), 104871.
  12. [17]Joe Forth, Xubo Liu, Jaffar Hasnain, Anju Toor, Karol Miszta, Shaowei Shi, Phillip L Geissler, Todd Emrick, Brett A Helms, and Thomas P Russell. 2018. Reconfigurable printed liquids. Advanced Materials 30, 16 (2018), 1707603.DOI
  13. [18]Valeri Frumkin and Moran Bercovici. 2021. Fluidic shaping of optical components. Flow 1 (2021), E2.DOI
  14. [19]Chi-Wing Fu, Chi-Fu Lai, Ying He, and Daniel Cohen-Or. 2010. K-set Tilable Surfaces. ACM Transactions on Graphics 29, 4, Article 44 (2010), 44:1–44:6 pages. doi:10.1145/1778765.1778781 Proc. SIGGRAPH.DOI
  15. [20]Michael Garland and Paul S Heckbert. 1997. Surface simplification using quadric error metrics. In Proceedings of the 24th annual conference on Computer graphics and interactive techniques. 209–216.
  16. [21]Michael Garland, Andrew Willmott, and Paul S. Heckbert. 2001. Hierarchical Face Clustering on Polygonal Surfaces. In Proceedings of the 2001 Symposium on Interactive 3D Graphics. 49–58.
  17. [22]Jacob Garrett, Abhishai Sati, Edward Chien, Emily Whiting, and Valeri Frumkin. 2026. Manufacturing Complex Structures Through Interfacial Self-Organization. (2026). Manuscript in preparation.
  18. [23]Kathleen Hajash, Bjorn Sparrman, Christophe Guberan, Jared Laucks, and Skylar Tibbitts. 2017. Large-scale rapid liquid printing. 3D Printing and Additive Manufacturing 4, 3 (2017), 123–132.
  19. [24]Kazuki Hayashi, Yoshiki Jikumaru, Makoto Ohsaki, Takashi Kagaya, and Yohei Yokosuka. 2023. Mean curvature flow for generating discrete surfaces with piecewise constant mean curvatures. Computer Aided Geometric Design 101 (2023), 102169. doi:10.1016/j.cagd.2023.102169
  20. [25]Sadashige Ishida, Masafumi Yamamoto, Ryoichi Ando, and Toshiya Hachisuka. 2017. A Hyperbolic Geometric Flow for Evolving Films and Foams. ACM Transactions on Graphics 36, 6 (2017), 199:1–199:11. doi:10.1145/3130830.3130835
  21. [26]Trevor J Jones, Etienne Jambon-Puillet, Joel Marthelot, and P-T Brun. 2021. Bubble casting soft robotics. Nature 599, 7884 (2021), 229–233.DOI
  22. [27]Dan Julius, Vladislav Kraevoy, and Alla Sheffer. 2005. D-Charts: Quasi-Developable Mesh Segmentation. In Computer Graphics Forum. Vol. 24. 581.
  23. [28]Benny Lautrup. 2011. Physics of Continuous Matter. Chapter on surface tension and Young–Laplace law (draft circulated 1998–2010 versions).
  24. [29]Omer Luria, Mor Elgarisi, Valeri Frumkin, Alexey Razin, Jonathan Ericson, Khaled Gommed, Daniel Wiederker, Israel Gabay, Ruslan Belikov, Jay Bookbinder, et al. 2023. Fluidic shaping and in-situ measurement of liquid lenses in microgravity. npj Microgravity 9, 1 (2023), 74.
  25. [30]Omer Luria, Khaled Gommed, Mor Elgarisi, Israel Gabay, Jonathan Ericson, Valeri Frumkin, Alexey Razin, Daniel Wiederker, Ruslan Belikov, Jay Bookbinder, et al. 2024. Shaping a gallium alloy and an ionic liquid into spherical mirrors for future liquid-based telescopes—experimental setup and demonstration in parabolic flights. Journal of Astronomical Telescopes, Instruments, and Systems 10, 4 (2024), 044010–044010.
  26. [31]Ben Mason, Abhishek Kundu, Michael Ryan, Rossitza Setchi, and Debajyoti Bhaduri. 2026. A robust methodology for surface roughness characterisation of additive manufactured parts. Proceedings of the Institution of Mechanical Engineers, Part L: Journal of Materials: Design and Applications 240, 6 (2026), 883–903.
  27. [32]Mark Meyer, Mathieu Desbrun, Peter Schröder, and Alan H Barr. 2003. Discrete differential-geometry operators for triangulated 2-manifolds. In Visualization and mathematics III. Springer, 35–57.
  28. [33]Andrea Montalti, Giulio Galè, Edoardo Pignatelli, and Alfredo Liverani. 2024. Enhancing surface roughness of material extrusion additive manufacturing components via an innovative ironing process. Virtual and Physical Prototyping 19, 1 (2024), e2401929.
  29. [34]Hao Pan, Yi-King Choi, Yang Liu, Wenchao Hu, Qiang Du, Konrad Polthier, Caiming Zhang, and Wenping Wang. 2012. Robust modeling of constant mean curvature surfaces. ACM Transactions on Graphics (TOG) 31, 4 (2012), 1–11.
  30. [36]Emanuel Parzen. 1962. On Estimation of a Probability Density Function and Mode. The Annals of Mathematical Statistics 33, 3 (1962), 1065–1076.
  31. [37]Davide Pellis, Martin Kilian, Helmut Pottmann, and Mark Pauly. 2021. Computational design of Weingarten surfaces. ACM Transactions on Graphics (TOG) 40, 4 (2021), 1–11.DOI
  32. [39]Konrad Polthier and Wayne Rossman. 2002. Discrete constant mean curvature surfaces and their index.
  33. [40]Helmut Pottmann, Qixing Huang, Bailin Deng, Alexander Schiftner, Martin Kilian, Leonidas Guibas, and Johannes Wallner. 2010. Geodesic Patterning. ACM Transactions on Graphics 29, 4, Article 43 (2010), 43:1–43:10 pages. doi:10.1145/1778765.1778780 Proc. SIGGRAPH.
  34. [42]Murray Rosenblatt. 1956. Remarks on Some Nonparametric Estimates of a Density Function. The Annals of Mathematical Statistics 27, 3 (1956), 832–837. doi:10.1214/aoms/1177728190
  35. [43]Ariel Shamir. 2008. A Survey on Mesh Segmentation Techniques. Computer Graphics Forum 27, 6 (2008), 1539–1556.DOI
  36. [44]Nicholas Sharp and Keenan Crane. 2018. Variational surface cutting. ACM Transactions on Graphics (TOG) 37, 4 (2018), 1–13.
  37. [45]Bernard W. Silverman. 1986. Density Estimation for Statistics and Data Analysis. Chapman and Hall, London.
  38. [46]Mayank Singh and Scott Schaefer. 2010. Triangle Surfaces with Discrete Equivalence Classes. ACM Transactions on Graphics 29, 4, Article 46 (2010), 46:1–46:7 pages. doi:10.1145/1778765.1778783 Proc. SIGGRAPH.DOI
  39. [47]Yousuf Soliman, Peter Schröder, and Ulrich Pinkall. 2026. Constant Mean Curvature Surfaces from Discrete Harmonic Maps. ACM Transactions on Graphics (TOG) 45, 4 (2026), 1–16.
  40. [48]Oded Stein, Eitan Grinspun, and Keenan Crane. 2018. Developability of triangle meshes. ACM Transactions on Graphics (TOG) 37, 4 (2018), 1–14.DOI
  41. [49]Michael Struwe. 1988. Plateau’s Problem and the Calculus of Variations. Mathematical Notes, Vol. 35. Princeton University Press.
  42. [50]Gabriel Taubin. 1995. Curve and surface smoothing without shrinkage. In Proceedings of IEEE international conference on computer vision. IEEE, 852–857.
  43. [51]Ulrike Von Luxburg. 2007. A tutorial on spectral clustering. Statistics and computing 17, 4 (2007), 395–416.arxiv.org/abs/0711.0189
  44. [52]Charlie C. L. Wang. 2008. Computing Length-Preserved Free Boundary for Quasi-Developable Mesh Segmentation. IEEE Transactions on Visualization and Computer Graphics 14, 1 (2008), 25–36. doi:10.1109/TVCG.2007.1067
  45. [53]Jianhua Wu and Lei Kobbelt. 2005. Structure Recovery via Hybrid Variational Surface Approximation. Computer Graphics Forum 24, 3 (2005), 277–284. doi:10.1111/j.1467-8659.2005.00852.x
  46. [54]Dong-Ming Yan, Yang Liu, and Wenping Wang. 2006. Quadric Surface Extraction by Variational Shape Approximation. In Geometric Modeling and Processing – GMP 2006 (Lecture Notes in Computer Science, Vol. 4077). Springer, 73–86.
  47. [56]Zheng-Yu Zhao, Dong Fang, Wenqing Ouyang, Zheng Zhang, Liang Liu, and Xiao-Ming Fu. 2022. Developability-Driven Piecewise Approximations for Triangular Meshes. ACM Transactions on Graphics 41, 4 (2022), 13 pages. doi:10.1145/3522823.3530117 Proc. SIGGRAPH.

Paper details

vlnc:W_vkdu9g78
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 5

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents