Affiliation:
1. Department of Mechanical Convergence Engineering, Hanyang University , Seoul, Republic of Korea
Abstract
Abstract
A margin line, defined as the boundary curve of the contact area between a prepared tooth and a dental restoration, considerably influences the end shape of the dental restoration design. Most studies that have extracted margin lines from mesh models representing prepared teeth have faced convergence problems in the path search and therefore pose the inconvenience of specifying multiple input points as intermediate goal points. To overcome these problems, in this study, we propose a bidirectional path-search algorithm using a single input point. First, the algorithm classifies all nodes in a mesh model into a margin or fuzzy region to increase search efficiency. Then, the search starts from one point and proceeds on two paths in opposite directions, using the current node of the opposite path as the temporary goal of the currently searched path. During the search, a dynamic evaluation function that varies weights according to the region type is employed to improve the path convergence. Finally, to increase the practicality of the algorithm, the jagged initial margin line is converted into a smooth spline curve using an energy-minimization function specialized for margin lines. To evaluate the proposed algorithm, margin lines extracted from various types of prepared teeth are demonstrated and compared with those created using some relevant previous works and a commercial dental computer-aided design (CAD) system. The comparison verified that accurate margin lines could be calculated with only one input point using the proposed algorithm. Moreover, the proposed algorithm showed better performance for crown and inlay/only experimental models compared with a commercial dental CAD system under the same conditions.
Funder
National Research Foundation of Korea
Publisher
Oxford University Press (OUP)
Subject
Computational Mathematics,Computer Graphics and Computer-Aided Design,Human-Computer Interaction,Engineering (miscellaneous),Modeling and Simulation,Computational Mechanics
Reference33 articles.
1. Seeded region growing;Adams;IEEE Transactions on Pattern Analysis and Machine Intelligence,1994
2. Admissible heuristic search in and/or graphs;Bagchi;Theoretical Computer Science,1983
3. Mesh repairing using topology graphs;Charton;Journal of Computational Design and Engineering,2021
4. Dynamic weighted anytime bounded cost search algorithm;Che,2021
5. Necessary and sufficient conditions for avoiding reopenings in best first suboptimal search with general bounding functions;Chen;Proceedings of the AAAI Conference on Artificial Intelligence,2021
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献