Comparative Study on the Suitability of Free-Boundary Parameterization Techniques for 3D Geometry-Aware Path Generation

Abstract

This paper presents a comparative study on the suitability of free-boundary surface parameterization techniques for generating trajectories on 3D surfaces. The approach maps a 3D surface to a 2D parametric domain through four parameterization methods: Least-Squares Conformal Mapping, Boundary First Flattening, As-Rigid-As-Possible, and Conformal Equivalence of Triangular Meshes. Structured trajectory patterns are generated in the 2D domain and projected back to 3D. We introduce center-to-boundary geodesic deviation measure, which yields a deviation profile over the boundary loop and reflects how well central alignment is preserved under each parameterization method. The results highlight differences in distortion and geodesic preservation, reflecting the suitability of methods for path generation.

1. Introduction

Generating 3D robotic trajectories on complex surfaces is a common requirement in various industrial applications such as spray painting, surface polishing, camera scanning, and depowdering. A robotic trajectory consists of a sequence of via points, each defined by a 3D position and an orientation. One of the main challenges in generating via points lies in dealing directly with the 3D geometry, especially when the surface has high curvature or complex topology. To address this, surface parameterization (also known as UV mapping or flattening) is widely used for path generation. Parameterization maps a 3D surface onto a 2D domain, assigning 2D coordinates to each vertex of the mesh while preserving the connectivity of the triangles. Depending on the algorithm, the parameterization may aim to preserve angles, areas, or local rigidity. Several methods have been proposed for surface parameterization. Lévy et al. [1] introduced the Least Squares Conformal Map (LSCM), which remains the most widely adopted free-boundary parameterization method due to its conformality. Sawhney and Crane [2] proposed Boundary First Flattening (BFF), which emphasizes boundary control to produce near-isometric maps while preserving angles. Liu et al. [3] introduced the As-Rigid-As-Possible (ARAP) free-boundary parameterization, which preserves triangle shapes as rigidly as possible. ARAP balances conformality and rigidity through a parameter $\lambda$: $\lambda =0$ yields the as-similar-as-possible (ASAP) mapping, equivalent to LSCM, while $\lambda \to \infty$ produces the fully rigid ARAP mapping. ARAP does not require mapping the border to a convex polygon and needs only a minimal set of pinned vertices. Springborn et al. [4] presented the Conformal Equivalence of Triangular Meshes (CETM), which computes a conformal map by solving for scale factors that satisfy the discrete conformal equivalence relation, enabling high-quality angle-preserving flattening with rigorous theoretical guarantees. McGovern and Xiao [5] generated a UV grid on a freeform 3D polygon mesh and computed a constrained coverage path with evenly spaced steps. Phan et al. [6] used the LSCM to produce a scanner path with controlled overlap between passes, focusing on minimizing conformal distortion. However, for high-curvature models, uneven area distortion can cause non-uniform point spacing after back-projection, leading to abrupt orientation changes and noise. Weingartshofer et al. [7,8] presented an automated workflow for robotic drawing on complex surfaces. Their approach applied LSCM-based parameterization and two projection methods to transfer user-defined 2D patterns onto 3D objects, followed by trajectory generation. They also investigated motion and hybrid force/motion control to ensure accurate execution with constant contact force, demonstrating applicability to industrial tasks such as painting, cutting, and engraving. Song and Kim [9] developed a robotic pen-drawing system that reproduces digital art on unknown 3D surfaces using a seven-DOF manipulator with impedance control, applying LSCM on RGB-D point clouds for distortion-free mapping of 2D drawings onto uneven geometries.

While parameterization simplifies path planning by allowing trajectory generation in the 2D domain before mapping it back to the 3D surface, the choice of parameterization method remains critical for accurately transferring via points between domains. Each technique imposes different constraints, such as preserving angles, area, or rigidity, which directly influence the uniformity and quality of the resulting trajectories. If the 2D region between the parametric center and a boundary point is locally compressed, the corresponding 3D segment becomes stretched, leading to enlarged spacing between consecutive path points after back-projection. Conversely, when the 2D area is stretched, the mapped 3D segment becomes compressed, yielding denser spacing. Because such distortions vary nonuniformly across the surface depending on local curvature and bumpiness, their overall impact on the generated trajectory is difficult to predict from local metrics alone. In industrial robotic processes such as spray painting, polishing, machining, surface inspection, and robotic drawing, mapping distortion directly affects the accuracy and consistency of generated trajectories. Its influence can be expressed through measurable task-level constraints. For coverage trajectories like spiral or raster, maintaining uniform spacing after back-projection is critical: deviations beyond roughly 15–20% of the nominal step cause overlap or under-coverage between adjacent passes. Excessive stretching or compression can shift the deposited or drawn pattern from its intended position in robotic drawing, while in painting it leads to uneven coating thickness. Similarly, in polishing or machining, it results in irregular material removal, and in scanning or inspection, it alters sampling density and measurement consistency. Evaluating parameterization methods by how well they preserve spacing and distribution over the 3D surface therefore provides a unified and quantitative criterion for assessing their suitability in trajectory generation.

Because the suitability of a parameterization depends on the downstream task, a generalized yet physically interpretable criterion is needed to assess trajectory accuracy. In parameterization-based trajectory generation, paths are typically constructed in the 2D parametric domain with respect to a reference point, often chosen as the pole of inaccessibility, the location farthest from the boundary of the parameterized shape. Ideally, when this farthest point in 2D is mapped back onto the 3D surface, it should coincide with the true geodesic center, i.e., the point farthest from the surface boundary in the 3D domain. A parameterization that preserves this correspondence maintains the relative center-to-boundary relationships of the surface and is therefore more suitable for evenly distributing trajectories around the geometry. To quantitatively evaluate this correspondence, we introduce the center-to-boundary geodesic deviation (CBGD) metric. The CBGD measures how much the back-projected parametric center deviates from its true 3D geodesic location after flattening and re-mapping, effectively capturing the cumulative stretching or compression between the center and boundary that causes global trajectory drift. It thus provides a unified, physically meaningful measure of mapping consistency directly related to spacing preservation and coverage uniformity in generated trajectories. This evaluation is performed on single-patch, genus-zero test meshes. Each model represents a simply connected open surface with a single boundary loop, ensuring that conformal and free-boundary parameterizations can be applied consistently across all objects.

In this work, we compare four different free-boundary parameterization techniques to evaluate their effectiveness for trajectory generation. The remainder of the paper is organized as follows: Section 2 presents the methodology, including parameterization and back-projection; Section 3 reports and discusses the experimental results; and Section 4 concludes the paper.

2. Methodology

We compare free-boundary parameterization techniques for generating 3D trajectories by first flattening the surface, represented as a triangular mesh, onto a 2D parametric domain using four different methods: LSCM, BFF, ARAP, and CETM. Trajectory patterns are created in the 2D domain, and the via points are then mapped back to the 3D surface through barycentric interpolation. To evaluate symmetry preservation and distortion, we use a center-to-boundary geodesic deviation measure comparing the mesh center with the back-projected 2D center; the resulting profile indicates suitability for path generation.

2.1. Three-Dimensional Surface Parameterization to Two-Dimensional Plane

Consider a 3D manifold triangular mesh model $\mathcal{M}$, composed of a set of vertices $S_{{\mathcal{V}}_{\mathcal{M}}}\subset {\mathbb{R}}^3$ and a set of triangular faces $S_{{\mathcal{T}}_{\mathcal{M}}}$. The goal of surface parameterization is to define a bijective mapping function

$$f:\mathcal{M}\to \mathcal{G}$$

that transforms the 3D mesh $\mathcal{M}$ into a 2D parametric domain $\mathcal{G}$, consisting of a vertex set $S_{{\mathcal{V}}_{\mathcal{G}}}\subset {\mathbb{R}}^2$ and triangle set $S_{{\mathcal{T}}_{\mathcal{G}}}$. The parameterization must preserve the mesh connectivity, i.e., $S_{{\mathcal{T}}_{\mathcal{M}}}\mapsto S_{{\mathcal{T}}_{\mathcal{G}}},S_{{\mathcal{V}}_{\mathcal{M}}}\mapsto S_{{\mathcal{V}}_{\mathcal{G}}}.$ Vertices in the parametric domain $S_{{\mathcal{V}}_{\mathcal{G}}}$ can be further categorized into boundary vertices $B_{\mathcal{G}}$ and interior vertices $I_{\mathcal{G}}$, such that: $S_{{\mathcal{V}}_{\mathcal{G}}}=B_{\mathcal{G}}\cup I_{\mathcal{G}}.$ The connectivity among vertices is described by the edge set $E_{\mathcal{G}}$, inherited from the original mesh topology. The notation and symbols used throughout the paper are shown in the

Table 1. Notation used for the 3D triangular mesh and its 2D parameterized triangular mesh.

Symbol	Description	Symbol	Description
$\mathcal{M}$	3D triangular surface mesh	$\mathcal{G}$	Flattened 2D parametric mesh
$S_{{\mathcal{T}}_{\mathcal{M}}}$	Set of triangles in the 3D mesh	$S_{{\mathcal{T}}_{\mathcal{G}}}$	Set of triangles in the 2D mesh
$S_{{\mathcal{V}}_{\mathcal{M}}}$	Set of vertices in the 3D mesh	$S_{{\mathcal{V}}_{\mathcal{G}}}$	Set of vertices in the 2D mesh
$B_{\mathcal{M}}$	Boundary vertices in 3D mesh	$B_{\mathcal{G}}$	Boundary vertices in 2D mesh
$T_{\mathcal{M}}^{\mathrm{q}}$	Triangle q in the 3D mesh	$T_{\mathcal{G}}^{\mathrm{q}}$	Triangle q in the 2D mesh
$V_{\mathcal{M}\mathrm{i}}^{\mathrm{q}}$	Vertex i of triangle q in 3D mesh	$V_{\mathcal{G}\mathrm{i}}^{\mathrm{q}}$	Vertex i of triangle q in 2D mesh
$P_{\mathcal{M}}^{\mathrm{q}}$	Back-projected point on $T_{\mathcal{M}}^{\mathrm{q}}$	$P_{\mathcal{G}}^{\mathrm{q}}$	Point inside triangle $T_{\mathcal{G}}^{\mathrm{q}}$
$R_i$	Local rotation matrix	$Q_i$	Quaternion representation of $R_i$
$T_i$	Tangent vector on surface	$N_i$	Normal vector at waypoint

.

2.1.1. Least-Squares Conformal Mapping (LSCM)

The Least-Squares Conformal Mapping (LSCM) method aims to flatten a 3D triangular mesh $\mathcal{M}$ onto a 2D domain $\mathcal{G}$ while minimizing angular distortion in a least-squares sense. In complex analysis, a conformal map is defined as a bijection that locally preserves angles. The transformation of a 3D triangulated surface into a 2D domain $(u,v)$ can be represented as a complex-valued function:

$$\psi \left(s\right)=u(x,y)+iv(x,y),s=x+iy$$

(1)

where $(x,y)$ are coordinates in the local 2D basis of a triangle, and $(u,v)$ are the real and imaginary parts in the parametric domain. Conformality requires the Cauchy–Riemann equations:

$${\displaystyle \frac{𝜕u}{𝜕x}}={\displaystyle \frac{𝜕v}{𝜕y}},{\displaystyle \frac{𝜕u}{𝜕y}}=-{\displaystyle \frac{𝜕v}{𝜕x}}$$

(2)

which can be expressed compactly as

$$\nabla v=\left(\begin{array}{cc}0& -1\\ 1& 0\end{array}\right)\nabla u$$

(3)

Let $T_{\mathcal{M}}^q\in S_{{\mathcal{T}}_{\mathcal{M}}}$ be a triangle of the mesh, with an orthonormal basis $({\mathbf{e}}_x,{\mathbf{e}}_y)$. A point with coordinates $(x,y)$ inside the triangle can be expressed in barycentric coordinates $({\lambda }_1,{\lambda }_2,{\lambda }_3)$ and the mapping to the parameter domain is:

$$u(x,y)={\lambda }_1{u}_1^q+{\lambda }_2{u}_2^q+{\lambda }_3{u}_3^q$$

(4)

$$v(x,y)={\lambda }_1{v}_1^q+{\lambda }_2{v}_2^q+{\lambda }_3{v}_3^q$$

(5)

This defines the interpolation of the $(u,v)$ coordinates of the triangle’s vertices across its interior using barycentric coordinates. The barycentric coordinates are computed as:

$$\left(\begin{array}{c}{\lambda }_1\\ {\lambda }_2\\ {\lambda }_3\end{array}\right)={\displaystyle \frac{1}{2A_{\mathcal{M}}^q}}\left(\begin{array}{ccc}{y}_2-y_3& x_3-x_2& y_3{x}_2-y_2{x}_3\\ y_3-y_1& x_1-x_3& y_1{x}_3-y_3{x}_1\\ y_1-y_2& x_2-x_1& y_2{x}_1-y_1{x}_2\end{array}\right)\left(\begin{array}{c}x\\ y\\ 1\end{array}\right)$$

(6)

This matrix expression gives the barycentric coordinates of a point $(x,y)$ relative to the triangle’s vertices, normalized by twice the triangle’s area $A_{\mathcal{M}}^q$. The gradient of u over a triangle can then be written as:

$$\nabla u=\left(\begin{array}{c}{\displaystyle \frac{𝜕u}{𝜕x}}\\ {\displaystyle \frac{𝜕u}{𝜕y}}\end{array}\right)=M_{\mathcal{G}}^q\left(\begin{array}{c}{u}_1^q\\ u_2^q\\ u_3^q\end{array}\right)$$

(7)

$M_{\mathcal{G}}^q$ is the matrix mapping the vertex u coordinates to their spatial gradient over the triangle. The matrix $M_{\mathcal{G}}^q$ is given by:

$$M_{\mathcal{G}}^q={\displaystyle \frac{1}{2A_{\mathcal{M}}^q}}\left(\begin{array}{ccc}{y}_2-y_3& y_3-y_1& y_1-y_2\\ x_3-x_2& x_1-x_3& x_2-x_1\end{array}\right)$$

(8)

This matrix encodes the edge directions of the triangle in the local 2D basis, scaled by the inverse of twice the area. The discrete Cauchy–Riemann condition becomes:

$$M_{\mathcal{G}}^q\left(\begin{array}{c}{v}_1^q\\ v_2^q\\ v_3^q\end{array}\right)-\left(\begin{array}{cc}0& -1\\ 1& 0\end{array}\right)M_{\mathcal{G}}^q\left(\begin{array}{c}{u}_1^q\\ u_2^q\\ u_3^q\end{array}\right)=\left(\begin{array}{c}0\\ 0\end{array}\right)$$

(9)

This enforces the discrete conformality condition for each triangle by ensuring the gradients of u and v remain orthogonal and equally scaled. Since exact conformality is only possible for developable surfaces, LSCM minimizes the following energy in the least-squares sense:

$$E_{\mathrm{LSCM}}=\sum _{T_{\mathcal{M}}^q\in S_{{\mathcal{T}}_{\mathcal{M}}}}{A}_{\mathcal{M}}^q{∥M_{\mathcal{G}}^q\left(\begin{array}{c}{v}_1^q\\ v_2^q\\ v_3^q\end{array}\right)-\left(\begin{array}{cc}0& -1\\ 1& 0\end{array}\right)M_{\mathcal{G}}^q\left(\begin{array}{c}{u}_1^q\\ u_2^q\\ u_3^q\end{array}\right)∥}^2$$

(10)

This energy measures the deviation from conformality across the mesh, weighted by triangle areas, and is minimized to compute the LSCM parameterization. The discrete LSCM energy was assembled using the cotangent Laplacian $L_c$ and vector–area matrix $A_{\mathrm{vec}}$, leading to the sparse linear system

$$\left(L_c\otimes I_2-2A_{\mathrm{vec}}\right)\left[\begin{array}{c}u\\ v\end{array}\right]=0$$

which couples the real and imaginary parts of the mapping coordinates. To eliminate the null space of rigid motions, two boundary vertices $b_1,b_2\in B_{\mathcal{M}}$ were fixed to $(0,0)$ and $(1,0)$, constraining translation and rotation while leaving scale free. The system was solved using a direct sparse Cholesky factorization until machine-precision convergence.

2.1.2. Boundary First Flattening (BFF)

The Boundary First Flattening (BFF) algorithm focuses on accurately controlling the shape of the boundary in the 2D parametric domain $\mathcal{G}$ while maintaining near-isometric mapping of the interior. This is particularly useful for applications where boundary geometry is critical. Let $\mathcal{M}$ be the input 3D triangular mesh, and $\mathcal{G}$ the resulting 2D parameterization domain. The set of vertices $S_{{\mathcal{V}}_{\mathcal{M}}}$ is divided into:

$$S_{{\mathcal{V}}_{\mathcal{M}}}=B_{\mathcal{M}}\cup I_{\mathcal{M}}$$

$B_{\mathcal{M}}$ are boundary vertices and $I_{\mathcal{M}}$ are interior vertices in the 3D mesh. The boundary loop $B_{\mathcal{M}}$ is first extracted and mapped to 2D boundary coordinates $B_{\mathcal{G}}$.

$$f\left(V_{\mathcal{M}i}\in B_{\mathcal{M}}\right)=V_{\mathcal{G}i}\in B_{\mathcal{G}}$$

(11)

BFF computes a discrete conformal metric using the Cherrier formula, which relates the change in curvature to the logarithmic scale factors $u_i$ at each vertex:

$$\Delta u_i=K_i-{\overline{K}}_i$$

(12)

Here, $K_i$ is the original Gaussian curvature at vertex i, and ${\overline{K}}_i$ is the target curvature after flattening. The difference controls the vertex scaling. The boundary scale factors are determined by integrating the geodesic curvature along the boundary:

$${\mathcal{l}}_i=e^{u_i}{\mathcal{l}}_i^o$$

(13)

${\mathcal{l}}_i^o$ is the original edge length in $\mathcal{M}$, and ${\mathcal{l}}_i$ is the scaled length in $\mathcal{G}$. The method uses the Poincaré–Steklov operator to transform boundary length constraints (Dirichlet conditions) into compatible boundary angle constraints (Neumann conditions), due to which the interior harmonic extension matches the boundary shape. The interior vertex coordinates are solved via the Laplace equation:

$${\nabla }^{2}u=0,{\nabla }^{2}v=0$$

(14)

Thus, u and v coordinates vary harmonically across the mesh. In practice, the BFF algorithm first computes boundary scale factors from curvature constraints, then integrates them to obtain the target boundary shape in 2D, and finally solves the Laplace equation to determine the interior vertex positions. In our implementation, BFF was used in its minimum-distortion configuration, where boundary lengths are prescribed through the logarithmic scale factors $u_b$ rather than by directly fixing curvatures. The Poincaré–Steklov operator was realized by solving discrete Poisson equations on the mesh, which provided the relation between the boundary scale factors and the corresponding curvature variation through the Cherrier relation. The boundary curve in the parameter domain was reconstructed by integrating unit tangents derived from cumulative exterior angles so that the edge lengths matched the prescribed targets. The interior coordinates $(u,v)$ were obtained by harmonic extension from this boundary curve, and the reconstructed boundaries were visually confirmed to be free of self-intersections.

2.1.3. As-Rigid-As-Possible (ARAP)

The As-Rigid-As-Possible (ARAP) parameterization aims to preserve the local shape of triangles as much as possible during the flattening process. It seeks to minimize distortions by aligning each triangle in the parameter domain $\mathcal{G}$ with its counterpart in the 3D mesh $\mathcal{M}$ through locally optimal rigid transformations. Let $T_{\mathcal{M}}^q\in S_{{\mathcal{T}}_{\mathcal{M}}}$ be a triangle in $\mathcal{M}$ with vertex positions $V_{\mathcal{M}i}^q$ in 3D and corresponding positions $V_{\mathcal{G}i}^q$ in the parameter domain. For an edge $(i,j)$ of triangle $T^q$, we define the edge vectors in 3D and 2D as

$$e_{ij}^{\mathcal{M}}=V_{\mathcal{M}j}^q-V_{\mathcal{M}i}^q,e_{ij}^{\mathcal{G}}=V_{\mathcal{G}j}^q-V_{\mathcal{G}i}^q$$

(15)

Here, $e_{ij}^{\mathcal{M}}$ denotes the edge from vertex i to vertex j in the original 3D domain $\mathcal{M}$, while $e_{ij}^{\mathcal{G}}$ denotes the corresponding edge in the parameter domain $\mathcal{G}$. The ARAP energy is defined over all triangles of the mesh as

$$E_{\mathrm{ARAP}}=\sum _{T_{\mathcal{M}}^q}\sum _{(i,j)\in E\left(T^q\right)}{w}_{ij}{∥e_{ij}^{\mathcal{G}}-R^q{e}_{ij}^{\mathcal{M}}∥}^2$$

(16)

where $E\left(T^q\right)$ denotes the set of edges of triangle $T^q$. The coefficients $w_{ij}$ are cotangent weights, defined as

$$w_{ij}=\frac{1}{2}\left(cot{\alpha }_{ij}+cot{\beta }_{ij}\right)$$

(17)

with ${\alpha }_{ij}$ and ${\beta }_{ij}$ being the angles opposite to edge $(i,j)$ in the two adjacent triangles. $R^q$ is the optimal rotation matrix associated with triangle q, ensuring that the deformation from the original 3D edges $e_{ij}^{\mathcal{M}}$ to their 2D counterparts $e_{ij}^{\mathcal{G}}$ is as close as possible to a rigid transformation. In practice, $R^q$ is computed by solving a local Procrustes problem, typically using the singular value decomposition (SVD) of the covariance matrix between the original 3D edges and their 2D mappings. The minimization of $E_{\mathrm{ARAP}}$ is carried out with the standard local/global scheme, which alternates between estimating the optimal rotations $R^q$ for fixed vertex positions $V_{\mathcal{G}}$ and solving a sparse symmetric linear system to update the vertex positions $V_{\mathcal{G}}$ with the rotations held fixed. This iterative process progressively refines the parameterization to achieve a mapping that is as rigid as possible while accommodating the flattening into the 2D domain. Implementation-wise, the ARAP solver employs cotangent edge weights $w_{ij}$ with a unit weighting factor $\lambda =1$. The initialization is performed using a harmonic map, which serves as the As-Similar-As-Possible (ASAP) starting configuration before switching to the full ARAP energy. Each iteration alternates between local updates, where optimal per-triangle rotations $R^q\in \mathrm{SO}\left(2\right)$ are estimated via stabilized SVD to handle near-degenerate elements, and a global step that updates vertex coordinates by solving a sparse symmetric linear system through a direct Cholesky-based solver. The process is repeated until the displacement of vertices between successive iterations falls below numerical tolerance, ensuring convergence to a stable, locally rigid parameterization.

2.1.4. Conformal Equivalence of Triangular Meshes (CETM)

The Conformal Equivalence of Triangular Meshes (CETM) method, introduced by Springborn et al. [4], finds a parameterization that is conformally equivalent to the original mesh while allowing precise control over target curvature. Let $u_i$ be the logarithmic scale factor assigned to vertex i. The scaled edge lengths are defined as

$${\mathcal{l}}_{ij}\left(u\right)=e^{{\displaystyle \frac{u_i+u_j}{2}}}{\mathcal{l}}_{ij}^o$$

(18)

where ${\mathcal{l}}_{ij}^o$ is the original length of edge $(i,j)$ in $\mathcal{M}$, and ${\mathcal{l}}_{ij}\left(u\right)$ is the conformally scaled length in $\mathcal{G}$. The Gaussian curvature at vertex i after scaling is given by

$$K_i\left(u\right)=2\pi -\sum _{q:i\in T_{\mathcal{M}}^q}{\theta }_i^q\left(u\right)$$

(19)

where ${\theta }_i^q\left(u\right)$ is the angle at the vertex i in triangle q under the scaled metric. CETM solves for u such that

$$K_i\left(u\right)={\overline{K}}_i$$

(20)

where ${\overline{K}}_i$ is the prescribed target curvature. The choice of ${\overline{K}}_i$ satisfies the discrete Gauss–Bonnet condition, ensuring that the sum of curvatures matches that of a flat embedding, and the sum of curvatures is considered to be $2\pi$ for boundaries. The problem is formulated as a convex optimization via the energy

$$E_{\mathrm{CETM}}\left(u\right)=\sum _{T_{\mathcal{M}}^q}{F}^q\left(u\right)-\sum _i{\overline{K}}_i{u}_i$$

(21)

where $F^q\left(u\right)$ is a convex function of the scaled angles of triangle q, derived from the Lobachevsky function. The second term enforces the target curvature constraints. Once the optimal u is obtained, the scaled edge lengths ${\mathcal{l}}_{ij}\left(u\right)$ are recovered, and the 2D layout of vertices is computed using a boundary embedding followed by harmonic extension to the interior. In practice, interior vertices use ${\overline{K}}_i=2\pi$ and boundary vertices ${\overline{K}}_i=\pi$, ensuring consistency with the discrete Gauss–Bonnet theorem. The energy is minimized using Newton’s method with analytic gradient $\nabla E\left(u\right)=\frac{1}{2}(\overline{\mathrm{\Theta }}-\mathrm{\Theta }\left(u\right))$ and a Hessian assembled from cotangent weights of the current image triangles. Angles close to 0 or $\pi$ are clamped to stabilize the Hessian near degenerate configurations. After convergence, the 2D layout is reconstructed from the optimized edge lengths and angles, enforcing triangle inequalities to avoid local flips.

2.2. Three-Dimensional Path Generation

Once the surface is parameterized, a desired path is defined in the 2D domain. In this work, we chose a contour-parallel spiral path starting from the central point and expanding toward the boundary as shown in Figure 1. The generated path consisted of three spiral turns with a total length of 318.34 units and a step size of 3.2, with the center at (49.4, 49.4). The objective was not to emphasize the path design itself but to evaluate how different parameterization methods influenced the accuracy of transferring this path back onto the 3D surface. The 2D path consisted of a set of via points in $\mathcal{G}$, and each 2D waypoint $P_{\mathcal{G}}^q$ was mapped to the original mesh $\mathcal{M}$ through barycentric interpolation. For a given point inside a 2D triangle $T_{\mathcal{G}}^q$ with vertices $\left(V_{\mathcal{G}i}^q,V_{\mathcal{G}j}^q,V_{\mathcal{G}k}^q\right)$, barycentric weights $W_{\mathcal{G}i},W_{\mathcal{G}j},W_{\mathcal{G}k}$ were computed such that

$$P_{\mathcal{G}}^q\left(x\right)=W_{\mathcal{G}i}{V}_{\mathcal{G}i}^q\left(x\right)+W_{\mathcal{G}j}{V}_{\mathcal{G}j}^q\left(x\right)+W_{\mathcal{G}k}{V}_{\mathcal{G}k}^q\left(x\right)$$

$$P_{\mathcal{G}}^q\left(y\right)=W_{\mathcal{G}i}{V}_{\mathcal{G}i}^q\left(y\right)+W_{\mathcal{G}j}{V}_{\mathcal{G}j}^q\left(y\right)+W_{\mathcal{G}k}{V}_{\mathcal{G}k}^q\left(y\right)$$

$$W_{\mathcal{G}i}+W_{\mathcal{G}j}+W_{\mathcal{G}k}=1$$

We then found the 3D triangle $T_{\mathcal{M}}^q$ corresponding to $T_{\mathcal{G}}^q$, whose vertices were $\left(V_{\mathcal{M}i}^q,V_{\mathcal{M}j}^q,V_{\mathcal{M}k}^q\right)$. We used barycentric weights to find the point inside 3D triangle $T_{\mathcal{M}}^q$ as follows:

$$P_{\mathcal{M}}^q=W_{\mathcal{G}i}{V}_{\mathcal{M}i}^q+W_{\mathcal{G}j}{V}_{\mathcal{M}j}^q+W_{\mathcal{G}k}{V}_{\mathcal{M}k}^q$$

(22)

The procedure involved locating the 2D triangle $T_{\mathcal{G}}^q$ that contained each point $P_{\mathcal{G}}^q$, computing its barycentric weights, and applying the same weights to the corresponding vertices of $T_{\mathcal{M}}^q$ to reconstruct the 3D point. To efficiently identify $T_{\mathcal{G}}^q$, a uniform-grid spatial index was built over per-face axis-aligned bounding boxes in $(u,v)$, providing near-constant lookup time. Neighboring cells were also queried for points near boundaries to avoid missing candidates. Candidate faces were validated using an orientation-based point-in-triangle test that returned barycentric coordinates. For robustness near edges and vertices, coordinates with values $\ge -\epsilon$ ($\epsilon ={10}^{-9}$) were accepted, small negatives were clamped to zero, and weights were normalized to sum to one. Points lying exactly on shared edges were resolved deterministically by selecting the triangle with the maximal minimum barycentric weight, ensuring consistent 2D–3D correspondence. Faces with near-zero UV area were excluded, and points failing inclusion were logged and discarded to preserve numerical stability and determinism.

The reconstructed 3D waypoints $P_{\mathcal{M}}^q$ obtained via barycentric interpolation in Equation (22) can be directly converted into robot-executable poses, which define both the Cartesian position and orientation of the end-effector. For each waypoint $P_i=P_{\mathcal{M}}^q$, the unit normal $N_i$ is computed as the normalized average of the facet normals of all triangles incident to $P_i$. The offset point $P_i^{\prime }$ is then defined to account for the tool distance $r_t$ from the surface:

$$P_i^{\prime }=P_i+r_t{N}_i.$$

(23)

The Cartesian pose of the end-effector is expressed as

$${\mathcal{T}}_i=\{P_i^{\prime },Q_i\},Q_i=\mathrm{quat}\left(R_i\right)$$

(24)

where $Q_i$ is the quaternion representation of the rotation matrix $R_i$, which aligns the tool z-axis with $-N_i$ while maintaining tangential consistency with the trajectory direction. In practice, this tangential consistency is achieved through a projection-based formulation:

$$T_i={\displaystyle \frac{(P_{i+1}-P_i)-\left((P_{i+1}-P_i)·N_i\right)N_i}{∥(P_{i+1}-P_i)-\left((P_{i+1}-P_i)·N_i\right)N_i∥}},R_i=[T_i(N_i\times T_i)-N_i].$$

These poses ${\mathcal{T}}_i$ can then be passed to motion-planning frameworks such as PyMoveIt2, which solve the inverse kinematics problem

$$q_i=\mathrm{IK}\left({\mathcal{T}}_i\right),q_i\in {\mathbb{R}}^n,$$

(25)

yielding joint configurations $q_i$ that can be executed on the robot. While the reconstructed waypoints can be directly converted into robot-executable poses, this alone does not ensure that spatial spacing and coverage uniformity are preserved. Even small distortions in the 2D map can accumulate into global drift once the trajectory is back-projected onto the 3D surface.

To quantify how each parameterization affects these center–boundary relationships, we introduce the center-to-boundary geodesic deviation (CBGD). This metric measures the displacement of the back-projected parametric center from its true geodesic position on $\mathcal{M}$, capturing the cumulative stretching or compression between the surface center and its boundary. Lower CBGD values indicate better mapping consistency and more reliable spacing for coverage-oriented trajectories. The boundary of the mesh $\mathcal{M}$ is represented by the ordered set of vertices $B_{\mathcal{M}}=\{b_1,b_2,\dots ,b_{N_b}\}$. Let $P_t$ denote the true center of $\mathcal{M}$, defined as the vertex with the maximum geodesic distance from $B_{\mathcal{M}}$, and let $P_m$ be the mapped center obtained from the parametric domain. For each boundary vertex $b_i\in B_{\mathcal{M}}$, let $d_{\mathcal{M}}(P,b_i)$ denote the geodesic distance between a point P and $b_i$ on $\mathcal{M}$. The relative center-to-boundary geodesic deviation at $b_i$ is then given by

$${\delta }_i={\displaystyle \frac{d_{\mathcal{M}}(P_m,b_i)-d_{\mathcal{M}}(P_t,b_i)}{d_{\mathcal{M}}(P_t,b_i)}},$$

(26)

and the set ${\left\{{\delta }_i\right\}}_{i=1}^{N_b}$ defines the geodesic deviation profile along the boundary loop.

3. Results and Discussion

All experiments were implemented in Python 3.8.10 and carried out on a system running Windows 11, a 13th-generation Intel i9 processor, and 32 GB of RAM. We evaluated eight triangular meshes—Wash basin (10,902 faces, 5589 vertices), Turtle (7600 faces, 3954 vertices), Face mask (11,168 faces, 5735 vertices), Bumpcap (15,082 faces, 7641 vertices), Kitten face (31,954 faces, 16,195 vertices), Lilium top (1844 faces, 975 vertices), Four-sided star (5344 faces, 2801 vertices), and Car body (12,763 faces, 6517 vertices). Before parameterization, each input mesh was cleaned to eliminate geometric defects that could affect distortion analysis. The cleaning stage merged duplicate vertices and edges, removed degenerate or unreferenced faces, repaired inconsistent normals, and ensured manifold connectivity. The cleaned meshes were then processed using four parameterization solvers (LSCM, BFF, CETM, and ARAP). Each resulting UV layout was validated by checking (i) the positivity of the outer boundary area and (ii) the ratio of non-zero UV magnitudes. If either condition failed, the mesh was reprocessed and the parameterization repeated for a limited number of attempts. When valid mappings could not be obtained, isotropic explicit remeshing was applied to improve triangle regularity and solver stability, using the meshing_isotropic_explicit_remeshing filter in PyMeshLab configured with ten iterations, a crease angle of ${30}^{\circ }$, and a target edge length of approximately 1–2% of the mesh bounding-box diagonal. The center-to-boundary geodesic deviation (CBGD) was then computed for all methods as defined in Equation (26). Distortion between the center and boundary in the 2D domain causes the back-projected parametric center to deviate from its true 3D geodesic position, altering the corresponding distances to boundary points in $B_{\mathcal{M}}$. This deviation reflects potential local over- or undersampling in the trajectory. Ideally, a parameterization preserves these center–boundary relationships, yielding near-symmetric sampling and a geodesic deviation approaching zero.

Figure 2, Figure 3, Figure 4, Figure 5, Figure 6, Figure 7, Figure 8 and Figure 9 shows the area distortion produced by the four parameterization methods (ARAP, BFF, CETM, and LSCM) together with the corresponding center-to-boundary geodesic distance deviation for each test object. Figure 10 shows the per-object geodesic deviation curves for all four methods. The error depended on local curvature and geometry. Bumpcap and Kitten face showed the largest, least-uniform errors, with LSCM having the highest peak. Objects with limited curvature variation and minimal bumpiness exhibited mild deviations. On smoother geometries, deviations remained moderate, with ARAP and BFF generally tighter and CETM and LSCM more variable. For Four-sided star, all methods performed almost perfectly, as its creased structure limited stretching/compression and preserved center alignment.

Figure 11 and Figure 12 summarize the average center-to-boundary geodesic deviation. Figure 11 reports the results across eight test objects, while Figure 12 compares the deviation for four parameterization techniques: ARAP, BFF, CETM, LSCM. ARAP achieved the lowest mean deviation of 1.7% with the smallest variance, BFF and CETM gave intermediate performance, and LSCM showed the largest deviation of 7.65% with higher variability.

On average (mean ± std over eight objects), LSCM had the shortest time (0.0668 ± 0.0434 s), followed by ARAP (0.2413 ± 0.1327 s), BFF (0.2973 ± 0.5223 s), and CETM (0.4573 ± 0.4541 s) as described in

Table 2. Parameterization computation time (in seconds) for each object and method.

Object	ARAP	LSCM	CETM	BFF
Turtle	0.4242	0.1013	0.6254	0.2270
Face mask	0.3409	0.0891	0.5595	0.2075
Lilium	0.3818	0.0834	0.1801	0.0541
Washbasin	0.1538	0.0386	0.2667	0.0959
Bump cap	0.0976	0.0166	0.0582	0.0244
Kitten face	0.2894	0.1394	1.4694	1.5757
Car body	0.1406	0.0466	0.3532	0.1601
Four-sided star	0.1019	0.0197	0.1459	0.0335

. LSCM is fast and conformal but shows the largest spread in area distortion and geodesic deviation. Its free boundary can rescale the boundary to keep angles, which introduces anisotropy near high curvature. These local effects accumulate as radial stretch or compression and appear as uneven 3D spacing after back-projection. LSCM remains popular for its simplicity, stability, and rapid convergence, but in robotic path generation, spatial fidelity is far more critical than marginal gains in computation time. The few seconds of difference between methods are negligible compared to the impact of geometric accuracy on the reconstructed 3D trajectory. In such cases, ARAP provides more consistent reconstruction, preserving both local rigidity and global scale coherence.

4. Conclusions

This work evaluated four free-boundary parameterization techniques, LSCM, BFF, CETM, and ARAP, on triangular meshes of varying geometric complexity, to assess their suitability for trajectory generation on known 3D surfaces. The evaluation procedure consisted of first designing a structured path in the 2D parametric domain and then projecting it back to the 3D surface via barycentric interpolation. To quantify parameterization suitability in this context, the center-to-boundary geodesic deviation was adopted as a reliable and interpretable profile, directly reflecting how faithfully 2D paths aligned with intrinsic 3D geodesics. Among the tested methods, ARAP consistently delivered the lowest average deviation of 1.7% with the smallest variance, making it the preferred choice when area deformation is critical, such as in path generation over known 3D surfaces. BFF and CETM performed competitively on smooth, low-curvature geometries, while LSCM, despite its popularity, exhibited higher and more variable deviations of 7.65% and is therefore less suitable when precise geodesic preservation is required. Overall, ARAP emerges as the most robust default for path planning on known 3D surfaces, with BFF a strong alternative if angle preservation is critical for an application.