{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:57:40Z","timestamp":1740182260103,"version":"3.37.3"},"reference-count":33,"publisher":"Oxford University Press (OUP)","issue":"6","license":[{"start":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T00:00:00Z","timestamp":1666137600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,11,21]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>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.<\/jats:p>","DOI":"10.1093\/jcde\/qwac108","type":"journal-article","created":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T18:34:32Z","timestamp":1666031672000},"page":"2332-2342","source":"Crossref","is-referenced-by-count":1,"title":["Feature extraction for margin lines using region growing with a dynamic weight function in a one-point bidirectional path search"],"prefix":"10.1093","volume":"9","author":[{"given":"Hyoung-Sub","family":"Shin","sequence":"first","affiliation":[{"name":"Department of Mechanical Convergence Engineering, Hanyang University , Seoul, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Mechanical Convergence Engineering, Hanyang University , Seoul, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jay J","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Mechanical Convergence Engineering, Hanyang University , Seoul, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2022,10,19]]},"reference":[{"issue":"6","key":"2022112111501352200_bib1","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1109\/34.295913","article-title":"Seeded region growing","volume":"16","author":"Adams","year":"1994","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"2022112111501352200_bib4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0304-3975(83)90050-6","article-title":"Admissible heuristic search in and\/or graphs","volume":"24","author":"Bagchi","year":"1983","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"2022112111501352200_bib6","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1093\/jcde\/qwaa076","article-title":"Mesh repairing using topology graphs","volume":"8","author":"Charton","year":"2021","journal-title":"Journal of Computational Design and Engineering"},{"key":"2022112111501352200_bib7","first-page":"1","article-title":"Dynamic weighted anytime bounded cost search algorithm","volume-title":"Proceedings of the 7th International Conference on Systems and Informatics (ICSAI)","author":"Che","year":"2021"},{"issue":"5","key":"2022112111501352200_bib8","doi-asserted-by":"crossref","first-page":"3688","DOI":"10.1609\/aaai.v35i5.16485","article-title":"Necessary and sufficient conditions for avoiding reopenings in best first suboptimal search with general bounding functions","volume":"35","author":"Chen","year":"2021","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"2022112111501352200_bib9","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1109\/CICC-ITOE.2010.87","article-title":"Dynamic adjustment A* routing algorithm","volume-title":"2010 International Conference on Innovative Computing and Communication and 2010 Asia-Pacific Conference on Information Technology and Ocean Engineering","author":"Dai","year":"2010"},{"issue":"1","key":"2022112111501352200_bib11","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Mathematik"},{"year":"2022","author":"EXOCAD","key":"2022112111501352200_bib12"},{"issue":"4","key":"2022112111501352200_bib13","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1007\/s11766-014-3240-0","article-title":"A fast and efficient mesh segmentation method based on improved region growing","volume":"29","author":"Fei","year":"2014","journal-title":"Applied Mathematics-A Journal of Chinese Universities"},{"issue":"1","key":"2022112111501352200_bib14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0218654306000810","article-title":"Estimating curvature on triangular meshes","volume":"12","author":"Gatzke","year":"2006","journal-title":"International Journal of Shape Modeling"},{"issue":"1","key":"2022112111501352200_bib15","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/966131.966134","article-title":"A novel cubic-order algorithm for approximating principal direction vectors","volume":"23","author":"Goldfeather","year":"2004","journal-title":"ACM Transactions on Graphics"},{"issue":"5","key":"2022112111501352200_bib16","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1631\/jzus.2005.A0460","article-title":"Smooth feature line detection for meshes","volume":"6","author":"Guo","year":"2005","journal-title":"Journal of Zhejiang University: Science A"},{"issue":"2","key":"2022112111501352200_bib17","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Transactions of Systems Science and Cybernetics"},{"issue":"6","key":"2022112111501352200_bib18","first-page":"2773","article-title":"An integrated interactive technique for image segmentation using stack based seeded region growing and thresholding","volume":"6","author":"Hore","year":"2016","journal-title":"International Journal of Electrical and Computer Engineering"},{"issue":"1\u20134","key":"2022112111501352200_bib20","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s00170-010-2617-3","article-title":"Semi-automatic feature point extraction using one seed point","volume":"51","author":"Hsu","year":"2010","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"6","key":"2022112111501352200_bib21","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1007\/s00429-012-0469-3","article-title":"Shape and curvedness analysis of brain morphology using human fetal magnetic resonance images in utero","volume":"218","author":"Hu","year":"2013","journal-title":"Brain Structure and Function"},{"issue":"12","key":"2022112111501352200_bib22","doi-asserted-by":"crossref","first-page":"2195","DOI":"10.1109\/TPAMI.2007.1125","article-title":"Three-dimensional surface mesh segmentation using curvedness-based region growing approach","volume":"29","author":"Jagannathan","year":"2007","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"1","key":"2022112111501352200_bib23","doi-asserted-by":"crossref","first-page":"13","DOI":"10.7315\/JCDE.2014.002","article-title":"As-built modeling of piping system from terrestrial laser-scanned point clouds using normal-based region growing","volume":"1","author":"Kawashima","year":"2014","journal-title":"Journal of Computational Design and Engineering"},{"issue":"8","key":"2022112111501352200_bib25","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/0262-8856(92)90076-F","article-title":"Surface shape and curvature scales","volume":"10","author":"Koenderink","year":"1992","journal-title":"Image and Vision Computing"},{"key":"2022112111501352200_bib26","doi-asserted-by":"crossref","first-page":"157382","DOI":"10.1109\/ACCESS.2020.3019797","article-title":"Dynamic weighted heuristic trust path search algorithm","volume":"8","author":"Kong","year":"2020","journal-title":"IEEE Access"},{"issue":"1\u20133","key":"2022112111501352200_bib27","first-page":"245","article-title":"Constant curvature region decomposition of 3D-meshes by a mixed approach vertex-triangle","volume":"12","author":"Lavoue","year":"2004","journal-title":"Journal of WSCG"},{"issue":"3","key":"2022112111501352200_bib28","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1111\/1467-8659.t01-1-00582","article-title":"Geometric snakes for triangular meshes","volume":"21","author":"Lee","year":"2002","journal-title":"Computer Graphics Forum"},{"key":"2022112111501352200_bib30","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.compbiomed.2018.10.026","article-title":"Accurate extraction of outermost biological characteristic curves in tooth preparations with fuzzy regions","volume":"103","author":"Li","year":"2018","journal-title":"Computers in Biology and Medicine"},{"issue":"50","key":"2022112111501352200_bib33","doi-asserted-by":"crossref","first-page":"40","DOI":"10.5120\/ijca2018917358","article-title":"Comparative analysis of search algorithms","volume":"179","author":"Pathak","year":"2018","journal-title":"International Journal of Computer Applications"},{"key":"2022112111501352200_bib34","first-page":"12","article-title":"The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem solving","volume-title":"IJCAI\u201973: Proceedings of the 3rd International Joint Conference on Artificial Intelligence","author":"Pohl","year":"1973"},{"key":"2022112111501352200_bib37","doi-asserted-by":"crossref","first-page":"103405","DOI":"10.1016\/j.artint.2020.103405","article-title":"Dynamically improved bounds bidirectional search","volume":"291","author":"Sewell","year":"2021","journal-title":"Artificial Intelligence"},{"key":"2022112111501352200_bib39","first-page":"1","article-title":"Snakes: A technique for line smoothing and displacement in map generalisation","volume-title":"Proceedings of the 7th ICA Workshop on Generalisation and Multiple Representation","author":"Stefan\u00a0Steiniger","year":"2003"},{"issue":"6","key":"2022112111501352200_bib43","first-page":"26","article-title":"Multi-objective genetic algorithm for civil UAV path planning using 3G communication networks","volume":"28","author":"Tseng","year":"2017","journal-title":"Journal of Computers (Taiwan)"},{"issue":"7","key":"2022112111501352200_bib45","doi-asserted-by":"crossref","first-page":"2336","DOI":"10.1109\/TVCG.2018.2839685","article-title":"3D Tooth segmentation and labeling using deep convolutional neural networks","volume":"25","author":"Xu","year":"2019","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"issue":"23","key":"2022112111501352200_bib49","first-page":"1567","article-title":"Extraction of dental biological feature line based on heuristic search strategy","volume":"13","author":"Zhang","year":"2012","journal-title":"China Mechanical Engineering"},{"key":"2022112111501352200_bib48","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.advengsoft.2017.06.005","article-title":"Computer-aided design of dental inlay restoration based on dual-factor constrained deformation","volume":"114","author":"Zhang","year":"2017","journal-title":"Advances in Engineering Software"},{"issue":"10","key":"2022112111501352200_bib47","doi-asserted-by":"crossref","first-page":"e3241","DOI":"10.1002\/cnm.3241","article-title":"The extraction method of tooth preparation margin line based on S-Octree CNN","volume":"35","author":"Zhang","year":"2019","journal-title":"International Journal for Numerical Methods in Biomedical Engineering"},{"issue":"3","key":"2022112111501352200_bib50","doi-asserted-by":"crossref","first-page":"1359","DOI":"10.1007\/s10916-010-9596-7","article-title":"A new 3D contour extraction method for tooth cavity in a dental CAD\/CAM system","volume":"36","author":"Zheng","year":"2012","journal-title":"Journal of Medical Systems"}],"container-title":["Journal of Computational Design and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/jcde\/advance-article-pdf\/doi\/10.1093\/jcde\/qwac108\/46572944\/qwac108.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jcde\/article-pdf\/9\/6\/2332\/47161194\/qwac108.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jcde\/article-pdf\/9\/6\/2332\/47161194\/qwac108.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,21]],"date-time":"2022-11-21T11:50:51Z","timestamp":1669031451000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jcde\/article\/9\/6\/2332\/6763594"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,19]]},"references-count":33,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,11,21]]}},"URL":"https:\/\/doi.org\/10.1093\/jcde\/qwac108","relation":{},"ISSN":["2288-5048"],"issn-type":[{"type":"electronic","value":"2288-5048"}],"subject":[],"published-other":{"date-parts":[[2022,12]]},"published":{"date-parts":[[2022,10,19]]}}}