Answers are grounded in this paper and cite their sources.
Novel method resolves intersections in triangle meshes, enhancing speed and accuracy, implying significant computational efficiency.
We propose a novel method to exactly and efficiently resolve intersections and self-intersections in triangle meshes. Our method contains two key components. First, we present a new concept of geometric predicates, called indirect offset predicates , to represent all intersection points through a new formulation and establish all necessary geometric predicates. Consequently, we reduce numerical errors in floating-point evaluations and improve the success rate of early stages of arithmetic filtering. Second, we develop localization and dimension reduction techniques for sorting, deduplicating, and locating the intersection points, thereby boosting efficiency and parallelism while maintaining accuracy. Rigorous testing confirms the robustness of our algorithm and consistency with previous methods. Comprehensive testing across diverse datasets further highlights the speed improvement achieved by our method, which is one order of magnitude faster than the state-of-the-art methods.
No takes yet. Share an insight, caveat, or question.
Guo et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: