Search arXivSearch

arXiv · 2608.16848

Topology-Aware Differentiable Triangle-Soup Reconstruction via Persistent Homology

Abstract

Differentiable triangle-soup reconstruction inherits a limitation from its objective: photometric and geometric losses cannot measure topology, so a reconstruction with a collapsed loop or a punctured enclosed void can score exactly as well as a correct one (on Chamfer-equal probes the diagrams differ 35-40x in bottleneck distance). The standard implicit remedy -- steer *where* the resampler spends its budget -- does not repair this: in a controlled study, a topology-informed prior is largely matched by an equally wide random one, and no prior shape repairs loops. We therefore move topology into the objective: a differentiable persistence term compares the evolving surface's diagram, measured on live surface samples, to a fixed target; gradients flow through a pair-frozen backward re-expressing matched birth/death simplices as closed-form circumradii, plus a recruitment term restoring the gradient optimal matching provably lacks when a feature is missing; one ratio knob calibrates the loss against the photometric gradient, no curriculum needed. Every claim passes a channel-controlled verdict: the loss must beat a norm-matched *non-topological* control through the identical gradient channel, at Chamfer parity. Under that rule the loss is topology-specific for enclosed voids (4.0-7.9x lower error) and -- the class every allocation prior failed -- for loops (2.3x, zero phantom handles, while the control collapses one); loss and prior compose; component counts (H0) are a null result. The verdicts replicate without per-shape tuning on eight external genus-known meshes in two pre-registered groups (group means: loops 1.52x, voids 4.87x; the one non-pass is a no-headroom null), degrading gracefully under noise. All evidence is synthetic and single-machine, with the target diagram known in advance; real scans are future work. Prescription: correct topology in the loss, allocate wide, combine.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Viritphon Chongpermwattanapol, Nattapat Damnernyut, Pizzanu Kanongchaiyos. 2026-08-17. Topology-Aware Differentiable Triangle-Soup Reconstruction via Persistent Homology. https://arxiv.org/abs/2608.16848

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Constrained Program Generation for 3D Reaction Animation with a 0.8B Model

Visualizing a chemical reaction requires making its molecular changes visible while keeping the animation faithful to the stated chemistry. Equations, structural diagrams and molecular viewers provide complementary descriptions, but assembling an interactive three-dimensional explanation still requires specifying the changes and checking their consistency. We present ChemXRG, a domain-specific language (DSL) framework that addresses this gap by representing a reaction animation as an executable program. Persistent atom identifiers and explicit bond, charge and grouping operations connect the symbolic reaction to the displayed transformation. This shared representation lets generation, verification and rendering operate on the same account of what changes. Given known, atom-mapped reactant and product structures, reaction-grounded constraints fix input-determined facts and restrict action choices; execution checks validate the resulting transformation before geometry and frames are constructed. We implement this paradigm with a reaction-program corpus and ChemQwen, a trained 0.8B DSL generator. Paired and component evaluations show improved compiler acceptance and normalized full-program agreement under input-conditioned constraints, while identifying remaining failures that require execution checks. A public browser application demonstrates the connection from symbolic reaction descriptions to inspectable programs and interactive 3D animations.

cs.GR

NaRPA: Navigation and Rendering Pipeline for Astronautics

This paper presents the applications of scientific ray-tracing in modeling and simulating light transport for space-borne image data generation. A ray-tracing engine, the Navigation and Rendering Pipeline for Astronautics (NaRPA), is introduced as a rendering framework to generate virtual datasets and support simulations for robust navigation pipelines. Sensor and environment models that enable the synthesis of space-to-space and ground-to-space virtual observations are presented. The work demonstrates the capabilities of simulating passive and active vision-based sensors using NaRPA to facilitate the design, testing, and verification of aerospace visual navigation algorithms. Additionally, the paper describes a velocimeter LiDAR model and its statistical validation with experimental data.

cs.GR

VoroUDF: Meshing Unsigned Distance Fields with Voronoi Optimization

We present VoroUDF, an algorithm for reconstructing high-quality triangle meshes from Unsigned Distance Fields (UDFs). Our algorithm supports non-manifold geometry, sharp features, and open boundaries, without relying on error-prone inside/outside estimation, restrictive look-up tables nor topologically noisy optimization. Unlike fixed-grid approaches, our Voronoi-based formulation optimizes a set of movable seeds that travel freely along the iso-surface, jointly minimizing a tangent-plane fitting energy, driven by a fixed set of surface samples queried once from the UDF and its gradient, and a repulsion energy that keeps the seeds evenly distributed. It achieves significantly improved topological consistency and geometric fidelity compared to existing methods, while producing lightweight meshes suitable for downstream real-time and interactive applications.

cs.GR