Method for segmenting three-dimensional tooth grid data based on harmonic field algorithm
A grid data and tooth technology, applied in the field of 3D tooth grid data segmentation, can solve the problem of high learning cost, achieve simple interaction, reduce operation difficulty, and strong practicability
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0027] The present invention will be described in detail below in conjunction with the accompanying drawings and embodiments.
[0028] Such as figure 1 As shown, the process of the present invention mainly includes the determination of the concave surface information of each tooth foreground constraint point FS, background constraint point BS, and three-dimensional tooth grid data vertices to be divided in the three-dimensional tooth grid data; The harmonic field scalar value constructs the Laplacian matrix L of the three-dimensional tooth mesh data, the penalty factor matrix P, the coefficient matrix b, and the unknown coefficient matrix x; the unknown coefficient matrix x is obtained by solving, and each tooth to be segmented is obtained by threshold division The segmented boundary contour of , using cubic B-splines to smooth the boundary contour.
[0029] 1. The foreground constraint point FS and the background constraint point BS of each tooth to be segmented in the three...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com