Neural Centroidal Voronoi Tessellations

1Peking University, 2The University of Hong Kong, 3Microsoft Research Asia ACM TOG (SIGGRAPH ASIA 2026) Corresponding authors.

Isotropic, feature-preserving surface remeshing across diverse geometries.

Abstract

Centroidal Voronoi tessellation (CVT) is a fundamental primitive for high-quality surface sampling and isotropic remeshing in computer graphics. However, computing surface CVTs with classical solvers remains expensive: each optimization step repeatedly constructs restricted Voronoi diagrams (RVDs) and integrates quantities over their surface cells. We introduce Neural CVT, a learning-based surface-CVT solver that replaces these costly geometric computations with a recurrent neural optimizer, accelerating CVT optimization by one to two orders of magnitude in our benchmarks while preserving geometric fidelity. Given an input surface, we sample a dense point cloud and extract multi-scale geometric descriptors with a graph neural encoder. A lightweight recurrent optimizer then refines seed positions over a small number of iterations, aggregating interpolated surface features and optimization history to predict per-seed displacements. The framework is trained self-supervised using CVT objectives that promote uniform distributions and, when desired, feature alignment. Across diverse organic and CAD-like shapes, Neural CVT generalizes to unseen geometry, initialization strategies, and seed densities, producing isotropic, feature-preserving remeshes comparable to state-of-the-art offline optimization methods at a fraction of the computational cost.

Method

Method Pipeline

Overview of Neural CVT.

The input mesh is sampled into a dense point cloud and encoded by a geometry encoder into global surface features. Starting from initial seeds, a recurrent optimizer iteratively refines seed positions: at each step the seeds interpolate surface features, pass through a seed encoder, update a GRU hidden state, and a decoder predicts per-seed displacements. The optimized seeds are used to evaluate the training loss and, at inference, converted into the final mesh via restricted Voronoi diagram (RVD) construction.

Results

RVD and its dual mesh from seeds optimized over different numbers of inference iterations.

Execution time comparison

Execution time to reach the same CVT energy across all test models, plotted on log-log axes.

Qualitative comparison on an organic shape.

Qualitative comparison on a CAD-like shape.

Weak feature recovery

Weak feature recovery.

Scalability evaluation

Qualitative scalability evaluation of our method on organic, CAD, and high-genus models.

BibTeX

@article{Xu2026NCVT,
  title   = {Neural Centroidal Voronoi Tessellations},
  author  = {Jiacheng Xu and Bo Pang and Rui Xu and Xiaocheng Zhang and Yang Liu and Fei Zhu and Guoping Wang and Peng-Shuai Wang},
  journal = {ACM Trans. Graph. (SIGGRAPH ASIA)},
  year    = {2026}
}