IP Library Granted Patent US 12,370,014
Granted Patent B2
US 12,370,014 · App. 17/347,300 · Granted Jul 29, 2025

Dynamic three-dimensional occlusogram

Inventors: Vadim Matov (San Jose, CA); Jihua Cheng (San Jose, CA); Fuming Wu (Pleasanton, CA); Kenji Tan (Mountain House, CA)
Assignee: Align Technology, Inc.
A61C7/002G06F17/11G06F30/20G06T17/20G06T2210/12G06T2210/41
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,370,014
App. No.
17/347,300
Granted
Jul 29, 2025
Kind
B2
Abstract

Methods and systems for generating a three-dimensional occlusogram are disclosed. One method includes determining a virtual three dimensional (3D) mesh model object of at least one tooth of a patient and displaying the determined virtual 3D mesh model object of at least one tooth of a patient wherein the 3D mesh model object includes a plurality of data sets associated with a set of occlusal information for the at least one tooth of the patient. In some examples, a 3D occlusogram is updated in response to a change of position of a 3D model of a tooth.

Claims (56)

1. A non-transitory computing device readable medium having executable instructions which can be executed by a processor to cause a computing device to perform a method, comprising:

determining a bounding box of a mesh of a tooth of a dentition, the mesh including a plurality of triangles;

building a two-dimensional (2D) height map array for storing height values of a crown surface of the tooth, the crown surface corresponding to an area of the tooth that is visible or that is located above a gum-line;

determining which triangles of the plurality of triangles of the mesh are not backside triangles, wherein a backside triangle has a normal at more than a 90 degree angle with respect to a Z-axis direction;

scanning the triangles determined as not backside triangles to calculate corresponding height values and entering the height values into the 2D height map array;

constructing a virtual three-dimensional (3D) occlusogram based on the height values and occlusal distance values of the tooth, wherein the occlusal distance values are determined based on a 3D array corresponding to a 3D grid with generators defined by the bounding box of the mesh of the tooth;

attaching the virtual 3D occlusogram to a virtual 3D model of the tooth by associating the occlusal distance values of the tooth with the virtual 3D model of the tooth;

changing a position of the virtual 3D model of the tooth; and

updating the 3D occlusogram in response to the change of position of the virtual 3D model of the tooth, wherein updating the 3D occlusogram includes finding related teeth in the dentition effected by the change of position and recalculating the 3D occlusogram for the tooth and the related teeth.

2. The non-transitory computing device readable medium of claim 1 , wherein the bounding box is the smallest box created on the 2D grid that fully surrounds a projection of a triangle onto the 2D grid.

3. The non-transitory computing device readable medium of claim 1 , wherein scanning the triangles comprises determining whether more triangles remain as part of the mesh and scanning any remaining triangles.

4. The non-transitory computing device readable medium of claim 1 , further comprising:

entering height values for each tooth of an upper jaw and a lower jaw into the 2D height map array; and

determining a potential occlusion tooth list for each tooth of the upper jaw and the lower jaw.

5. The non-transitory computing device readable medium of claim 1 , further comprising:

initializing a closest distance component to a value of a height of a corresponding node of the 3D grid for all elements of the 3D array; and

scanning each polygon of a plurality of polygons of the tooth.

6. The non-transitory computing device readable medium of claim 1 , further comprising, for each triangle determined as not being a backside triangle:

computing a circumscribed sphere S of the triangle; and

forming a list of indices in a 3D array such that for every index a distance from a corresponding 3D grid node to a center of the sphere S is not greater than a sum of a radius of the sphere S and a current value of a closest distance component of an element of 3D array.

7. The non-transitory computing device readable medium of claim 6 , further comprising, for each triangle determined as not being a backside triangle:

(a) for each index in the list of indices, compute the distance from the corresponding 3D grid node to the triangle;

(b) set a closest distance to the computed distance and coordinates of a closest point to coordinates of a closest point computed on step (a).

8. The non-transitory computing device readable medium of claim 1 , further comprising:

determining occlusal distance values for posterior teeth using the 2D height map array, and

determining occlusal distance values for anterior teeth using distance fields.

9. The non-transitory computing device readable medium of claim 1 , wherein finding the related teeth of the dentition effected by the change of position includes finding teeth in upper and lower jaws of the dentition effected by the change of position.

10. The non-transitory computing device readable medium of claim 1 , wherein the 3D occlusogram is updated in response a user changing the position of the virtual 3D model of the tooth.

11. The non-transitory computing device readable medium of claim 10 , wherein the updated 3D occlusogram is viewable by the user in real-time.

12. The non-transitory computing device readable medium of claim 1 , wherein the 3D occlusogram is updated at each stage of multiple stage treatment plan.

13. The non-transitory computing device readable medium of claim 1 , wherein the 3D occlusogram is added via an add-on module for simulation and dental treatment CAD (Computing device Aided Design) programs.

14. A method, comprising:

determining a bounding box of a mesh of a tooth of a dentition, the mesh including a plurality of triangles;

building a two-dimensional (2D) height map array for storing height values of a crown surface of the tooth, the crown surface corresponding to an area of the tooth that is visible or that is located above a gum-line;

determining which triangles of the plurality of triangles of the mesh are not backside triangles, wherein a backside triangle has a normal at more than a 90 degree angle with respect to a Z-axis direction;

scanning the triangles determined as not backside triangles to calculate corresponding height values and entering the height values into the 2D height map array;

constructing a virtual three-dimensional (3D) occlusogram based on the height values and occlusal distance values of the tooth, wherein the occlusal distance values are determined based on a 3D array corresponding to a 3D grid with generators defined by the bounding box of the mesh of the tooth;

attaching the virtual 3D occlusogram to a virtual 3D model of the tooth by associating the occlusal distance values of the tooth with the virtual 3D model of the tooth;

changing a position of the virtual 3D model of the tooth; and

updating the virtual 3D occlusogram in response to the change of position of the virtual 3D model of the tooth, wherein updating the virtual 3D occlusogram includes finding related teeth in upper and lower jaws of the dentition effected by the change of position and recalculating the virtual 3D occlusogram for the tooth and the related teeth.

15. The method of claim 14 , further comprising determining a potential occlusion tooth list for each tooth of the upper and lower jaws, wherein the potential occlusion tooth list includes a listing of teeth that contact by occlusion.

16. The method of claim 15 , wherein determining the potential occlusion tooth list comprises determining which teeth having a bounding box that overlaps with the bound box of the mesh of the tooth.

17. The method of claim 14 , wherein the occlusal distance values for the tooth is determined based on a space or a collision depth between the related teeth of the upper and lower jaws.

18. The method of claim 14 , wherein the bounding box is the smallest box created on the 2D grid that fully surrounds a projection of a triangle onto the 2D grid.

19. A computing system, comprising:

a memory having executable instructions stored thereon; and

a processor coupled to the memory and configured to execute the instructions to:

determining a bounding box of a mesh of a tooth of a dentition, the mesh including a plurality of triangles;

building a two-dimensional (2D) height map array for storing height values of a crown surface of the tooth, the crown surface corresponding to an area of the tooth that is visible or that is located above a gum-line;

determining which triangles of the plurality of triangles of the mesh are not backside triangles, wherein a backside triangle has a normal at more than a 90 degree angle with respect to a Z-axis direction;

scanning the triangles determined as not backside triangles to calculate corresponding height values and entering the height values into the 2D height map array;

constructing a virtual three-dimensional (3D) occlusogram based on the height values and occlusal distance values of the tooth, wherein the occlusal distance values are determined based on a 3D array corresponding to a 3D grid with generators defined by the bounding box of the mesh of the tooth;

attaching the virtual 3D occlusogram to a virtual 3D model of the tooth by associating the occlusal distance values of the tooth with the virtual 3D model of the tooth;

changing a position of the virtual 3D model of the tooth; and

updating the virtual 3D occlusogram in response to the change of position of the virtual 3D model of the tooth, wherein updating the virtual 3D occlusogram includes finding related teeth in the dentition effected by the change of position and recalculating the virtual 3D occlusogram for the tooth and the related teeth.

20. The computing system of claim 19 , wherein the bounding box is the smallest box created on the 2D grid that fully surrounds a projection of a triangle onto the 2D grid.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 29, 2021
From: MATOV, VADIM; CHENG, JIHUA; WU, FUMING; TAN, KENJI
To: ALIGN TECHNOLOGY, INC.
Reel/Frame 058502/0142 →
Continuity (5)
Continuation 16741624 · Jan 13, 2020
Continuation 15392729 · Dec 28, 2016
Continuation 14084407 · Nov 19, 2013
Continuation 12610663 · Nov 2, 2009
Related Publication 20210378791A1 · Dec 9, 2021
References Cited (94)
US 1103336A · Aktschourin · 1914 [cited by applicant]
US 5605459A · Kuroda · 1997 [cited by examiner]
US 6099314A · Kopelman et al. · 2000 [cited by applicant]
US 6334772B1 · Taub et al. · 2002 [cited by applicant]
US 6463344B1 · Pavloskaia et al. · 2002 [cited by applicant]
US 6542249B1 · Kofman et al. · 2003 [cited by applicant]
US 6633789B1 · Nikolskiy et al. · 2003 [cited by applicant]
US 6664986B1 · Kopelman et al. · 2003 [cited by applicant]
US 6697164B1 · Babayoff et al. · 2004 [cited by applicant]
US 6845175B2 · Kopelman et al. · 2005 [cited by applicant]
US 6971873B2 · Sachdeva · 2005 [cited by examiner]
US 6979196B2 · Nikolskiy et al. · 2005 [cited by applicant]
US 7030383B2 · Babayoff et al. · 2006 [cited by applicant]
US 7202466B2 · Babayoff et al. · 2007 [cited by applicant]
US 7255558B2 · Babayoff et al. · 2007 [cited by applicant]
US 7286954B2 · Kopelman et al. · 2007 [cited by applicant]
US 7319529B2 · Babayoff · 2008 [cited by applicant]
US 7373286B2 · Nikolskiy et al. · 2008 [cited by applicant]
US 7507088B2 · Taub et al. · 2009 [cited by applicant]
US 7545372B2 · Kopelman et al. · 2009 [cited by applicant]
US 7698068B2 · Babayoff · 2010 [cited by applicant]
US 7916911B2 · Kaza et al. · 2011 [cited by applicant]
US 8108189B2 · Chelnokov et al. · 2012 [cited by applicant]
US 8244028B2 · Kuo et al. · 2012 [cited by applicant]
US 8948482B2 · Levin · 2015 [cited by applicant]
US D742518S · Barak et al. · 2015 [cited by applicant]
US 9192305B2 · Levin · 2015 [cited by applicant]
US 9261356B2 · Lampert et al. · 2016 [cited by applicant]
US 9261358B2 · Atiya et al. · 2016 [cited by applicant]
US 9299192B2 · Kopelman · 2016 [cited by applicant]
US D760901S · Barak et al. · 2016 [cited by applicant]
US 9393087B2 · Moalem · 2016 [cited by applicant]
US 9408679B2 · Kopelman · 2016 [cited by applicant]
US 9431887B2 · Boltanski · 2016 [cited by applicant]
US 9439568B2 · Atiya et al. · 2016 [cited by applicant]
US 9451873B1 · Kopelman et al. · 2016 [cited by applicant]
US D768861S · Barak et al. · 2016 [cited by applicant]
US D771817S · Barak et al. · 2016 [cited by applicant]
US 9491863B2 · Boltanski · 2016 [cited by applicant]
US D774193S · Makmel et al. · 2016 [cited by applicant]
US 9510757B2 · Kopelman et al. · 2016 [cited by applicant]
US 9660418B2 · Atiya et al. · 2017 [cited by applicant]
US 9668829B2 · Kopelman · 2017 [cited by applicant]
US 9675430B2 · Verker et al. · 2017 [cited by applicant]
US 9693839B2 · Atiya et al. · 2017 [cited by applicant]
US 9717402B2 · Lampert et al. · 2017 [cited by applicant]
US 9724177B2 · Levin · 2017 [cited by applicant]
US 9844426B2 · Atiya et al. · 2017 [cited by applicant]
US 10076389B2 · Wu et al. · 2018 [cited by applicant]
US 10098714B2 · Kuo · 2018 [cited by applicant]
US 10108269B2 · Sabina et al. · 2018 [cited by applicant]
US 10111581B2 · Makmel · 2018 [cited by applicant]
US 10111714B2 · Kopelman · 2018 [cited by applicant]
US 10123706B2 · Elbaz et al. · 2018 [cited by applicant]
US 10136972B2 · Sabina et al. · 2018 [cited by applicant]
US 10380212B2 · Elbaz et al. · 2019 [cited by applicant]
US 10390913B2 · Sabina et al. · 2019 [cited by applicant]
US 10453269B2 · Furst · 2019 [cited by applicant]
US 10456043B2 · Atiya et al. · 2019 [cited by applicant]
US 10499793B2 · Ozerov et al. · 2019 [cited by applicant]
US 10504386B2 · Levin et al. · 2019 [cited by applicant]
US 10507087B2 · Elbaz et al. · 2019 [cited by applicant]
US 10517482B2 · Sato et al. · 2019 [cited by applicant]
US 10695150B2 · Kopelman et al. · 2020 [cited by applicant]
US 10708574B2 · Furst et al. · 2020 [cited by applicant]
US 10772506B2 · Atiya et al. · 2020 [cited by applicant]
US 10813727B2 · Sabina et al. · 2020 [cited by applicant]
US 10888399B2 · Kopelman et al. · 2021 [cited by applicant]
US 10952816B2 · Kopelman · 2021 [cited by applicant]
US 10980613B2 · Shanjani et al. · 2021 [cited by applicant]
US 11013581B2 · Sabina et al. · 2021 [cited by applicant]
US D925739S · Ariel et al. · 2021 [cited by applicant]
US 11096765B2 · Yossef et al. · 2021 [cited by applicant]
US 20020006217A1 · Rubbert · 2002 [cited by examiner]
US 20020064746A1 · Muhammad · 2002 [cited by examiner]
US 20020156652A1 · Sachdeva · 2002 [cited by examiner]
US 20030214501A1 · Hultgren · 2003 [cited by examiner]
US 20070081718A1 · Rubbert · 2007 [cited by examiner]
US 20080014558A1 · Matov · 2008 [cited by examiner]
US 20190029784A1 · Moalem et al. · 2019 [cited by applicant]
US 20190388193A1 · Saphier et al. · 2019 [cited by applicant]
US 20200281700A1 · Kopelman et al. · 2020 [cited by applicant]
US 20200281702A1 · Kopelman et al. · 2020 [cited by applicant]
US 20200315434A1 · Kopelman et al. · 2020 [cited by applicant]
US 20200349698A1 · Minchenkov et al. · 2020 [cited by applicant]
US 20200349705A1 · Minchenkov et al. · 2020 [cited by applicant]
US 20200404243A1 · Saphier et al. · 2020 [cited by applicant]
US 20210030503A1 · Shalev et al. · 2021 [cited by applicant]
US 20210059796A1 · Weiss et al. · 2021 [cited by applicant]
US 20210068773A1 · Moshe et al. · 2021 [cited by applicant]
US 20210121049A1 · Rudnitsky et al. · 2021 [cited by applicant]
US 20210128281A1 · Peleg · 2021 [cited by applicant]
US 20210137653A1 · Saphier et al. · 2021 [cited by applicant]
US 20210196152A1 · Saphier et al. · 2021 [cited by applicant]