Valque, LéoLazard, SylvainAttene, MarcoSellán, Silvia2025-06-202025-06-2020251467-8659https://doi.org/10.1111/cgf.70197https://diglib.eg.org/handle/10.1111/cgf70197We present a straightforward and robust method for resolving the mesh intersection problem. We focus specifically on the challenge caused by the intersections resulting from the conversion of the vertices coordinates from their exact mathematical values to a fixed-precision floating-point format. Our method takes as input a soup of triangles and outputs intersection-free models whose vertices coordinates are all represented with double-precision floating-point format. We evaluated our approach thoroughly, considering a large collection of meshes. In particular, we can process all the 4 524 models in Thingi10K [ZJ16] that contain self-intersections. This outperforms previous state-of-the-art approaches: On the 527 models of Thingi10K for which naive rounding fails, Zhou et al.'s approach [ZGZJ16] is capable of handling 91% of them, and Valque's 94% [Val24]. In terms of time efficiency, our approach handles about 50k vertices per second on average, which is faster to that of Zhou et al. by a factor 1.4 on these non-trivial models and is faster than that of Valque by several order of magnitude.Attribution 4.0 International LicenseCCS Concepts: Computing methodologies->Model development and analysis; Mesh models; Theory of computation->Computational geometryComputing methodologiesModel development and analysisMesh modelsTheory of computationComputational geometry10.1111/cgf.7019710 pages