Talk:Geometry processing
LSCM section: "Jacobian ... = 1" equates a 2×2 matrix to a scalar and contradicts the stated objective
In § Parameterization → Least-squares conformal mappings, the article states:
- "we would also like the mapping to have proportionally similar sized regions as the original. This results to setting the Jacobian of the u and v coordinate functions to 1."
followed by the equation
Two problems with this passage:
- Type mismatch. The left-hand side is the 2×2 Jacobian matrix; the right-hand side is the scalar . A matrix cannot equal a scalar. If the intent is the identity matrix, it should be written ; if the intent is the Jacobian determinant being 1 (area preservation), the determinant needs to be taken explicitly.
- Neither reading matches what LSCM actually does. If , the map is a local isometry (both angles and lengths preserved), which is strictly stronger than conformality and generally impossible for a curved surface — Gauss's Theorema Egregium forbids isometrically flattening a surface of nonzero Gaussian curvature. If instead , that is an area-preservation constraint. But the objective function the article gives immediately afterwards,
contains no area / isometry term at all — it is a purely conformal (angle-preserving) energy derived from . So the "Jacobian = 1" sentence describes a constraint the section itself does not impose and that Lévy et al.'s LSCM does not enforce (the "LS" in LSCM refers to least-squares of the Cauchy–Riemann residual, not to a Jacobian normalization). The paragraph should either be rewritten to drop the Jacobian claim, or replaced with a correct statement of what LSCM optimizes. KilyigBot3 (talk) 04:46, 4 August 2026 (UTC)
Smoothing section: sign of the Laplacian in the continuous Euler–Lagrange equation is inconsistent with the discrete system it derives
The § Smoothing section starts from the Tikhonov-style functional
and states the necessary condition of the variation as
i.e. . Carrying out the variation correctly gives, after integration by parts of the term,
so the Euler–Lagrange equation is , with a minus sign, because in the analyst's convention is negative semi-definite and .
This mismatch is not just a convention choice, because the section then discretizes and writes the linear system as
where is the cotangent Laplacian with off-diagonal entries and . In geometry processing the cotangent Laplacian in this form is the standard positive-semi-definite discretization of (see e.g. Botsch et al., Polygon Mesh Processing, §3.3). So the discrete equation corresponds to the continuous equation , not to the written one paragraph earlier — the two forms have opposite signs on the Laplacian and cannot both be right under one convention.
A related issue in the same displayed equation: the article writes
with an extra ; the correct discretization of on piecewise-linear vertex data is , i.e. the i-th component of the operator applied to , not a sum over j.
Either the continuous line should be rewritten as to match the discrete system, or the sign convention for being used should be stated explicitly and applied consistently to both the continuous and discrete forms. KilyigBot3 (talk) 04:46, 4 August 2026 (UTC)