- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes a principled geometric prior for defining locality in oriented point clouds by lifting samples to position–orientation space M = R^3 × S^2 and endowing it with a contact sub-Riemannian (SR) structure in which spatial motion is constrained to be tangential (orthogonal to the local normal) while reorientation incurs a weighted cost. Leveraging the nilpotentization at each point (Mitchell’s theorem), the authors derive an explicit, SE(3)-invariant pairwise semi-metric (“contact score”) based on the 5D Heisenberg group that exhibits linear growth with normal offset, thereby discouraging “short-circuits” across thin structures. They demonstrate benefits as a drop-in neighborhood mechanism in PointNet++ for segmentation (Pheno4D) and correspondence (FAUST), and as a kernel for diffusion on oriented point sets using a Sinkhorn-normalized operator, reducing leakage across contacting surfaces.
Critical strengths
1.The metric prior addresses a pervasive failure mode of Euclidean neighborhoods in thin, layered, or contacting structures—relevant across 3D learning and geometry processing.
2.Demonstrations suggest the proposed contact score can be a drop-in component in common pipelines to reduce leakage and improve accuracy without architectural overhauls.
Critical weaknesses
1.The paper omits both the AI Use Statement and the Reproducibility Statement.
2.Figure 2 (Page 2): The top text labels suffer from severe horizontal truncation—specifically, the upper portions of the words "Slide" (in "Slide in reoriented tangent plane") and "Tilt" (in "Tilt back to match normals", which is even misread as "Liit" in the text layer) are cut off, exhibiting typical traits of AI-generated figure text distortion or careless image cropping.
3.The contact score is a semi-metric (no triangle inequality), which may affect graph construction properties; implications are not deeply analyzed.
4.Choice of the weight w is fixed and crucial for balancing spatial vs. orientation scales; practical guidance, adaptivity, or learning of w is not fully explored.
5.Solving for ϕ in H(a^2, τ) requires a root-finding step; numerical stability, efficiency, and differentiability in batched GPU settings are not thoroughly discussed.
Questions for authors
Please refer to weakness.
Response to Reviewer UZrV
Thank you for the review, we hope the following answers will address your concerns.
About AI use and reproducibility statements
We added these in the revised version of the paper.
About Figure 2
Good catch for the cropped figure, we corrected it in the revised version. As written in our new AI use statement, we did not use LLM assistance for any of the figure, including this one, which has been entirely done by one of the authors.
The score is a semi-metric
You are right that the triangle inequality can fail. It fails only at scales that are large relative to w but none of our uses requires it. Proposition 4.1 gives ℓw=dCC+o(ϵ), and dCC is a true metric. Within a neighbourhood of size ϵ, the triangle defect is small at only o(ϵ)
On the choice of w
w is a length: turning the normal by an angle α costs the same as sliding by wα. It sets the distance at which a difference in orientation matters as much as a difference in position. Write ε the distance to the k-th same-surface neighbour, δ the gap to separate, σn the normal noise, in radians and R the curvature radius. Here are practical guidance:
From our experiments on real data:
On the root-finding: stability, efficiency and differentiability
There is no iterative solver per pair. We invert one fixed monotone function, in batch on the GPU. The score needs the turning angle ϕ of the optimal arc. ϕ solves f(ϕ)=s, with f(ϕ)=(ϕ−sinϕ)/(1−cosϕ) and s=4∣τ∣/a2.
Efficiency. On the GPU, a training step at 4,096 points is 20–22% slower than with Euclidean grouping (Reviewer Hyvg, Q1) so it is still pretty fast to compute.
Differentiability. In our experiments no gradient flows through H. If one is wanted, there is no need to differentiate through the inversion, because the partial derivatives are explicit in ϕ:
∂∣τ∣∂H=2ϕ,∂a2∂H=2ϕcot2ϕ.
The second derivative diverges as a→0 with τ=0. There, H is only Lipschitz in a. Gradient-based training through the score is untested.