An Accuracy Controllable and Memory Efficient Method for Computing High-Quality Geodesic Distances on Triangle Meshes. (September 2022)

• Record Type: Journal Article
• Authors: Adikusuma, Yohanes Yudhi; Du, Jie; Fang, Zheng; He, Ying
• Is Part Of: Computer aided design. Volume 150(2022)
• Publication Date: 2022-09
• Subjects: Discrete geodesics -- Triangle meshes -- Accuracy controllable window propagation -- Discrete geodesic graphs -- Vertex-oriented triangle propagation; Computer-aided design -- Periodicals; Engineering design -- Data processing -- Periodicals; Computer graphics -- Periodicals; Conception technique -- Informatique -- Périodiques; Infographie -- Périodiques; Computer graphics; Engineering design -- Data processing; Periodicals; Electronic journals; 620.00420285
• DOI: 10.1016/j.cad.2022.103333
• Languages: English
• ISSNs: 0010-4485

Abstract

Abstract: This paper presents a new method for computing approximate geodesic distances and paths on triangle meshes. Our method combines two state-of-the-art discrete geodesic methods, which are discrete geodesic graphs (DGG) and vertex-oriented triangle propagation (VTP), so that it allows the user to specify the desired accuracy using a single parameter ɛ . The method, called DGG-VTP, extends the conventional window propagation framework by monitoring the accuracy of the computed distances so that propagation can terminate immediately when the desired accuracy is reached. It is worth noting that for robustness consideration, tiny windows with length less than a threshold (usually, between 1 0 − 7 and 1 0 − 6 ) are discarded in the implementation of the existing exact algorithms, such as the Mitchel–Mount–Papadimitriou (MMP) algorithm, the Chen–Han (CH) algorithm and their many variants. By setting the accuracy parameter ɛ ∈ [ 1 0 − 7, 1 0 − 6 ], our method can produce results with comparable accuracy to VTP, while being 3–40 times faster and consuming much less memory. Furthermore, the performance of our method is less sensitive to mesh tessellation than what VTP does. Our method empirically produces O n ɛ 0 . 23 windows and scales well to deal with large-scale models. Though the parameter ɛ in DGG-VTP is not a guaranteed error bound, it acts as an intuitive guide for the user to set the desired accuracy. Extensive evaluations demonstrate the effectiveness of our accuracy control: given a parameter ɛ ∈ [ 1 0 − 7, 1 0 − 4 ], 99% of the computed distances have error less than the accuracy parameter. The features of predicable accuracy and computational efficiency distinguish DGG-VTP from the existing approximation methods, and make it an alternative to exact methods in computing accurate geodesic distances on large-scale mesh models. We also develop a parallel version of DGG-VTP on multi-core CPUs, which runs up to 60 × faster than the existing parallel VTP algorithm with comparable accuracy under single floating point precision setting. The source code is available at https://github.com/GeodesicGraph/DGG-VTP . Graphical abstract: Highlights: A new approximation method for computing geodesic distances and paths on triangle meshes. Combining two SOTA methods, VTP and DGG, our method allows the user to directly specify the desired accuracy using a single parameter ɛ . By setting the accuracy parameter ɛ = 1 0 − 6, our method can produce results with comparable accuracy to VTP, while being 3–40 times faster and consuming as low as 1/30 memory.