SeamFlow: Structure-Aware Flow Matching on Edge Probabilities for Artist-Like UV Unwrapping

• URL: http://arxiv.org/abs/2609.04751v1
• Date: Fri, 04 Sep 2026 05:31:09 GMT
• Title: SeamFlow: Structure-Aware Flow Matching on Edge Probabilities for Artist-Like UV Unwrapping
• Abstract summary: We introduce SeamFlow, a novel generative framework for 3D surface cutting.<n>SeamFlow achieves exceptional semantic coherence and remarkably low parameterization distortion.
• Score: 49.50766584180635
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: 3D surface cutting and UV unwrapping are fundamental problems in computer graphics. Traditional geometric optimization methods mainly focus on reducing parameterization distortion, but they often overlook visual semantic coherence in seam layouts. Recent autoregressive generative methods improve semantic coherence, yet limited perception of mesh topology often causes inaccurate local cuts. To address these limitations, we introduce SeamFlow, a novel generative framework for 3D surface cutting. We reformulate the discrete mesh-cutting problem as continuous flow matching in a high-dimensional edge-probability space. Through continuous relaxation, SeamFlow learns a deterministic mapping from a Gaussian prior to a target seam-probability distribution. An evolution network couples local topological tokens with global shape priors and guides smooth probability flow through Ordinary Differential Equation solving. Compared with existing autoregressive generative frameworks, SeamFlow improves topology awareness through edge tokenization while eliminating both 3D spatial projection errors and artificial sequential-order bias. Extensive experiments demonstrate that SeamFlow achieves exceptional semantic coherence and remarkably low parameterization distortion. The project page is https://meshy-dev.github.io/seamflow.

Related papers

• SketchFlow: Zero-Shot Vector Sketch Generation via GMM Prior Flow in CLIP Latent Space [9.378039371407114]
  We present SketchFlow, a novel generative framework rooted in Optimal Transport (OT) theory and flow matching.<n>By leveraging pre-trained CLIP models, we formulate cross-modal alignment as a continuous mapping problem.<n>Experiments demonstrate that SketchFlow substantially outperforms existing baselines in visual quality and adherence to natural human drawing styles.
  arXiv  Detail & Related papers  (2026-08-21T22:02:23Z)
• Nexus: Native Mesh Generation with Diffusion [42.84943999520515]
  We present Nexus, a diffusion method that achieves holistic mesh generation via decoupled and topology generation.<n>Our method outperforms state-of-the-art autoregressive and two-stage baselines.<n>A blind user study from 3D practitioners confirms strong preference for our results.
  arXiv  Detail & Related papers  (2026-07-15T08:04:46Z)
• MeshFlow: Mesh Generation with Equivariant Flow Matching [99.07593100078935]
  MeshFlow learns to generate triangle meshes directly as triangle soups.<n>We adopt equivariant optimal-transport flow matching models that respect the key symmetries of triangle soups.<n>MeshFlow achieves mesh quality comparable to state-of-the-art autoregressive mesh generators.
  arXiv  Detail & Related papers  (2026-06-22T15:35:30Z)
• MeshWeaver: Sparse-Voxel-Guided Surface Weaving for Autoregressive Mesh Generation [53.06620176910962]
  MeshWeaver is an autoregressive framework that treats mesh generation as a surface weaving process.<n>MeshWeaver achieves a state-of-the-art compression ratio of 18%, can generate meshes with up to 16K faces, and significantly improves geometric fidelity over prior approaches.
  arXiv  Detail & Related papers  (2026-06-03T10:15:43Z)
• MeshFlow: Efficient Artistic Mesh Generation via MeshVAE and Flow-based Diffusion Transformer [82.3429532054028]
  MeshFlow is a new method for generating artist-like 3D meshes.<n>Our model generates meshes 18x faster than the fastest AR generator.
  arXiv  Detail & Related papers  (2026-06-03T08:57:15Z)
• Mask-Morph Graph U-Net: A Generalisable Mesh-Based Surrogate for Crashworthiness Field Prediction under Large Geometric Variation [9.368489153302326]
  finite element crash simulations are accurate but computationally expensive, limiting their use in design optimisation.<n>Machine-learning surrogate models based on graph neural networks (GNNs) offer a faster alternative.<n>This paper presents Mask-Morph Graph U-Net, a practical approach to addressing the limitation of hierarchical Graph U-Net architectures.
  arXiv  Detail & Related papers  (2026-05-13T18:04:58Z)
• SDFlow: Similarity-Driven Flow Matching for Time Series Generation [42.61146250886606]
  We propose SDFlow, a non-autoregressive framework that operates entirely in the frozen VQ latent space.<n>We show that SDFlow achieves state-of-the-art performance, improving Discriminative Score and substantially reducing Context-FID.
  arXiv  Detail & Related papers  (2026-05-07T06:28:18Z)
• Trajectory Stitching for Solving Inverse Problems with Flow-Based Models [68.36374645801901]
  Flow-based generative models have emerged as powerful priors for solving inverse problems.<n>We propose MS-Flow, which represents the trajectory as a sequence of intermediate latent states rather than a single initial code.<n>We demonstrate the effectiveness of MS-Flow over existing methods on image recovery and inverse problems, including inpainting, super-resolution, and computed tomography.
  arXiv  Detail & Related papers  (2026-02-09T11:36:41Z)
• Learning Deformable Tetrahedral Meshes for 3D Reconstruction [78.0514377738632]
  3D shape representations that accommodate learning-based 3D reconstruction are an open problem in machine learning and computer graphics. Previous work on neural 3D reconstruction demonstrated benefits, but also limitations, of point cloud, voxel, surface mesh, and implicit function representations. We introduce Deformable Tetrahedral Meshes (DefTet) as a particular parameterization that utilizes volumetric tetrahedral meshes for the reconstruction problem.
  arXiv  Detail & Related papers  (2020-11-03T02:57:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.