AI & ML
FOMOS: Feature-Oriented Meshing of SDFs
arXiv cs.GR0 views
arXiv:2611.17458v1 Announce Type: new Abstract: We introduce FOMOS, a purely geometric method for feature-oriented meshing of signed distance functions (SDFs) that addresses various challenges of the existing state-of-the-art methods. Our algorithm improves mesh quality and runtime, enabling the SDF meshing in a matter of seconds. While existing techniques such as Marching Cubes and Neural Dual Contouring either produce dense, low-quality triangulations or sacrifice details for sparsity, often requiring carefully chosen user parameters, our single-parameter FOMOS leverages feature sized sampling to dynamically adjust mesh resolution based on local feature size (LFS), which we compute efficiently by sampling a medial scaffold. The LFS considers not only curvature but also shape thickness and captures large features through non-local structure, omitting many redundant small triangles from existing methods. Through extensive comparisons, we demonstrate the distinct strengths of FOMOS in execution time, reconstructed result accuracy, and triangle quality in the output mesh. We also introduce a lightweight variant of FOMOS targeting huge ($10k^3$) sparse inputs, which, to the best of our knowledge, no existing method can handle except Marching Cubes. To demonstrate the usefulness of our method, we show that FOMOS enables instant previews using a sub-sampled medial scaffold and can accelerate volumetric simulations by orders of magnitude.
Source:https://arxiv.org/abs/2611.17458PreviousWhy Incomplete Datasets Create Hidden Risks in Machine Learning Development?NextPose-based Neural Clothing for Animated Characters
Related posts
Nearly Optimal Fixed-Confidence Best-Arm Identification with 1-Bit Feedback
0arXiv stat.ML
When Does On-Policy Interaction Help? Representational Tradeoffs in Value-Based Imitation Learning
0arXiv stat.ML
Disentangling Continuous-Time Latent Dynamics: Identifiability of Latent SDEs via Diffusion Shifts
0arXiv stat.ML
Exact Constrained Decoding for Sequence Models: Controller-Augmented Hidden Markov Models and Beyond
0arXiv stat.ML
Kernel-based potential mean-field games with unbiased random Fourier $U$-statistics
0arXiv stat.ML
Adaptive Calibration in Non-Stationary Environments
0arXiv stat.ML