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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.