JP5177777B2 - System and method for dental treatment planning - Google Patents

Description

(Background of the Invention)
(1. Field of the Invention)
The present invention relates generally to the field of orthodontics, and more particularly to orthodontic treatment planning and computerized automated development of orthodontic appliances.

  Traditionally, tooth repositioning for aesthetics or other reasons is accomplished by wearing an appliance commonly referred to as a “brace”. The braces include various instruments such as brackets, archwires, ligatures, and O-rings. The attachment of this instrument to the patient's teeth is a tedious and time consuming plan that requires a lot of consultation with the orthodontic dentist. As a result, conventional orthodontic procedures limit the capacity of orthodontic patients and make orthodontic procedures quite expensive. Thus, the use of conventional breaths is a tedious and time consuming process and requires many visits to the orthodontist's clinic. Furthermore, the use of breath from the patient's point of view is unsightly and uncomfortable, presents a risk of infection, and makes brushing, dental floss and other dental hygiene procedures difficult.

(2. Explanation of background art)
Tooth positioners for completing orthodontic treatments are described by Kesling, Am. J. et al. Orthod. Oral. Surg. 31: 297-304 (1945) and 32: 285-293 (1946). The use of silicone positioners for wide orthodontic repositioning of patient teeth has been described by Warunek et al. Clin. Orthod. 23: 694-700 (1989). A clear plastic fixation device for completing and maintaining the position of the teeth is described by Raintree Essix, Inc. , New Orleans, Louisiana 70125, and Tru-Tain Plastics, Rochester, Minnesota 55902. The manufacture of orthodontic positioners is described in US Pat. Nos. 5,186,623, 5,059,118, 5,055,039, 5,035,613, 4,856,991, Nos. 4,798,534 and 4,755,139.

  Other publications are described by Kleeman and Janssen, J.M. Clin. Orthodon. 30: 673-680 (1996); Clin. Orthodon. 30: 390-395 (1996) and Chiaphone, J. et al. Clin. Orthodon. 14: 121-133 (1980) and by Shirday, Am. J. et al. Orthodontics 59: 596-599 (1970) and Wells, Am. J. et al. Orthodontics 58: 351-366 (1970) and by Cottingham, Am. J. et al. The manufacture and use of dental positioners including Orthodontics 55: 23-31 (1969) is described.

  Kuroda et al., Am. J. et al. Orthodontics 110: 365-369 (1996) describes a method for laser scanning a plastic type to generate a digital image of the type.

  US Pat. Nos. 5,533,895, 5,474,448, 5,454,717, 5,447,432, 5,431,562, assigned to Ormco Corporation, 5,395,238, 5,368,478, and 5,139,419 describe methods for manipulating digital images of teeth to design orthodontic appliances.

  US Pat. No. 5,011,405 describes a method for digitally imaging teeth and determining the optimal bracket placement for orthodontic treatment. Laser scanning of a molded tooth to create a three-dimensional model is described in US Pat. No. 5,338,198. U.S. Pat. No. 5,452,219 describes a method of laser scanning a tooth model and milling a tooth mold. Tooth contour digital computer operation is described in US Pat. Nos. 5,607,305 and 5,587,912. Computerized digital images of the jaws are described in US Pat. Nos. 5,343,202 and 5,340,309. Other related patents include U.S. Pat. Nos. 5,549,476, 5,382,164, 5,273,429, 4,936,862, 3,860,803, 3, 660,900, 5,645,421, 5,055,039, 4,798,534, 4,856,991, 5,035,613, 5,059,118, 5,186,623, and 4,755,139.

(Simple Summary of Invention)
In one aspect, a computer-implemented system and method implements a dental treatment plan by identifying a tooth movement pattern using a two-dimensional array and generating a treatment path that moves the tooth according to the identified pattern. To do.

Implementations of the invention include one or more of the following. A dimension of the array identifies each stage in tooth movement, and a dimension of the array identifies a unique tooth. Tooth movement is identified by showing the start and end stages for the tooth. One or more tooth paths are determined based on the selected tooth movement pattern. The method consists of space closure, reproximation, dental extension.
selecting one or more clinical treatment rules that include at least one of expansion, redness, distalization, and lower incisor expansion. An instrument is manufactured for each treatment stage. The instrument can be either a removable instrument or a fixed instrument. The method also includes generating a three-dimensional model for the tooth for each treatment stage.

The system may meet one or more restrictions. This limitation is related to tooth compaction, tooth spacing, tooth extraction, tooth resection, tooth rotation, and tooth movement. The teeth can be rotated about 5 and 10 degrees (per stage) and can be moved further in one or more stages (per stage). Each stage moves each tooth from about 0.2 mm to about 0.4 mm. This restriction can be stored in an array having a certain dimension of the array that identifies each stage in tooth movement. This treatment path includes determining the minimum amount of translation required to move each tooth from the first position to the last position, and generating each movement path that requires only the minimum amount of movement. Furthermore, an intermediate position may be generated for at least one tooth that undergoes an equal amount of translational movement. Furthermore, an intermediate position can be generated for at least one tooth that undergoes an unequal translational movement. A set of rules can be applied to detect any collisions that occur when the patient's teeth move along the treatment path. The collision is established by establishing a neutral projection plane between the first tooth and the second tooth, thereby causing a z-axis perpendicular to a plane having a positive and negative direction from each set of reference points on the projection plane. A pair of signed distances (this signed number) including a first signed distance to the first tooth and a second signed distance to the second tooth. The distance is measured on a straight line passing through the reference point and parallel to the z-axis) as well as determining if a collision occurs if any pair of signed distances indicates a collision. And can be detected by calculating the distance between the first tooth and the second tooth. A collision may be detected if the positive direction for the first distance is opposite the positive direction for the second distance and the sum of any pair of signed distances is greater than or equal to zero. Information indicating whether the patient's teeth follow the treatment path can be used to modify the treatment path. One or more candidate treatment paths for each tooth can be generated and each candidate treatment path can be graphically displayed to a human user for selection. A set of rules can be applied to detect any collisions that occur when the patient's teeth move along the treatment path. Establishing a neutral projection plane between the first tooth and the second tooth establishes a z-axis perpendicular to a plane having a positive direction and a negative direction from each set of reference points on the projection plane By means of a signed distance pair comprising a first signed distance to the first tooth and a second signed distance to the second tooth (this signed distance is By measuring (on a straight line passing through a reference point and parallel to the z-axis), and by determining that a collision will occur if any signed distance indicates a collision, the first By calculating the distance between the first tooth and the second tooth, a collision can be detected. A collision can be detected if the sum of any pair of signed distances is greater than or equal to zero. A set of rules can be applied to detect any inappropriate occlusion that occurs when the patient's teeth move along the treatment path. A value for the malocclusion index may be calculated and displayed to a human user. The treatment path may be generated by receiving data indicative of limitations on the movement of the patient's teeth and applying this data to generate a treatment path. At a location corresponding to the selected data set, a three-dimensional (3D) graphical representation of the teeth can be rendered. A graphical display of the teeth can be generated that provides a visual display of the movement of the teeth along the treatment path. A graphical interface can be generated that has components showing control buttons on the videocassette recorder and that can be manipulated by a human user to control the video. A portion of the data in the selected data set can be used to render a graphical representation of the tooth. A level of detail compression can be applied to the data set to render a graphical representation of the teeth. Depending on the user's requirements, a human user can modify the graphical representation of the teeth and the selected data set can be modified. A human user selects a tooth in the graphical display and, accordingly, information about the tooth can be displayed. This information may be related to the movement that the tooth undergoes while moving along the treatment path. The information may also indicate a linear distance between the tooth and another tooth in a graphical display. The teeth can be drawn at a selected angle among a plurality of viewing angles specific to orthodontics. After viewing the graphical representation of the patient's teeth, a user interface may be provided that allows a human user to provide text-based comments. The graphical display data can be downloaded to a remote computer where a human wants to see the graphical display. Input signals from a 3D gyroscope input device controlled by a human user can be applied to change the tooth orientation in the graphical display.
(Item 1) A computer-implemented method for implementing a treatment plan, the method comprising:
Identifying a tooth movement pattern using a two-dimensional array;
Generating a treatment path for moving the tooth according to the identified pattern.
(Item 2) The method according to item 1, wherein the processing path is changed by one or more constraints.
3. The method of claim 2, wherein one of the constraints is related to dental crowding.
4. The method of claim 2, wherein one of the constraints is related to a tooth gap.
5. The method of claim 2, wherein one of the constraints is related to tooth extraction.
6. The method of claim 2, wherein one of the constraints is related to tooth stripping.
7. The method of claim 2, wherein one of the constraints is related to tooth rotation.
8. The method of claim 7, wherein the teeth are rotated about 5-10 degrees per step.
9. The method of claim 2, wherein one of the constraints is related to tooth movement.
10. The method of claim 9, wherein the teeth are gradually moved to one or more stages per stage.
11. The method of claim 10, wherein each tooth is moved from about 0.2 mm to about 0.4 mm at each stage.
12. The method of claim 1, wherein the constraint is stored in an array.
13. The method of claim 12, wherein one dimension of the array identifies each stage in the tooth movement.
(Item 14) The step of generating the treatment path includes a step of determining a minimum deformation amount necessary for moving each tooth from the first position to the last position, and each treatment path that requires only the minimum movement amount. The method according to item 1, comprising the steps of:
15. The method of claim 1, wherein generating the treatment path includes generating an intermediate position for at least one tooth between which the tooth undergoes an equal amount of translation.
16. The method of claim 1, wherein generating the treatment path includes generating an intermediate position for at least one tooth between which the tooth undergoes an unequal amount of translation.
17. The method of claim 1, further comprising applying a set of rules for detecting any collisions that occur as the patient's teeth move along the treatment path.
(Item 18) The method further includes the step of receiving information indicating whether or not the patient's teeth follow the treatment path and, if not following the treatment path, using information for correcting the treatment path. The method according to Item 1.
(Item 19) The step of generating a treatment path provides more than one candidate treatment path for each tooth and provides a graphical display of each candidate treatment path to a human user for selection. The method according to item 1, comprising a step.
20. The method of claim 1, further comprising providing a three-dimensional (3D) graphical representation of the tooth at a location corresponding to the selected data set.
21. The method of claim 20, further comprising animating the graphical representation of the tooth to provide a visual indication of movement of the tooth along the treatment path. 22. The method of claim 21, further comprising the step of providing a graphical interface operable by a human user to control the video with a component representing a control button on the video cassette recorder.
23. The method of claim 1, wherein one dimension of the array identifies each stage in the tooth movement.
24. The method of claim 1, wherein one dimension of the array identifies unique teeth.
25. The method of claim 1, wherein one dimension of the array identifies each stage in the tooth movement, and one dimension of the array identifies a unique tooth.
26. The method of claim 25, further comprising identifying tooth movement by indicating an initial stage and a final stage for the tooth.
27. The method of claim 1, further comprising determining one or more tooth paths based on the selected tooth movement pattern.
28. The method of claim 1, further comprising selecting one or more clinical treatment prescriptions.
29. The method of claim 24, wherein the clinical treatment prescription comprises at least one of the following: space closure, close proximity, dental expansion, enlargement, distalization, and lower incisor extraction. .
30. The method of claim 23, wherein determining a tooth path includes identifying a shortest path without collision between an initial position and a last position for one or more teeth.
31. The method of claim 1, further comprising the step of dividing one or more tooth paths into a series of stages.
32. The method of claim 1, further comprising generating an instrument for each treatment stage.
33. The method of claim 28, wherein the instrument is either a removable instrument or a fixed instrument.
34. The method of claim 1, further comprising generating a three-dimensional model for the teeth at each processing stage.
(Item 35) Means for specifying a tooth movement pattern using a two-dimensional array;
Means for generating a treatment path for moving the tooth according to the identified pattern.
(Item 36) A processor;
A data storage device coupled to the processor;
Computer executable code for identifying tooth movement patterns using a two-dimensional array;
Computer-executable code for generating a treatment path for moving the tooth according to the identified pattern.
(Item 37) A network for communicating information about the community;
One or more patients coupled to the network;
One or more treatment professionals coupled to the network;
A virtual health care e-commerce community comprising: a server coupled to the network, wherein the server stores data for each patient and performs patient data visualization in response to user requests.
(Item 38) The treatment specialist visualizes patient data via the following network: right cheek view, left cheek view, posterior view, anterior view, mandibular occlusion view, maxillary occlusion view, overjet view, left distal molar 40. The community of item 37, viewing one or more of a view, a left tongue view, a tongue incisor view, a right tongue view, a right distal molar view, an upper jaw view, and a lower jaw view.
39. The community of claim 37, wherein the treatment professional includes a dentist or orthodontist.
40. The community of claim 37, further comprising one or more partners coupled to the network.
41. The community of claim 40, wherein the partner includes a funding partner.
42. The community of claim 40, wherein the partner includes a supplier. (Item 43) A community according to item 40, wherein the partner includes a delivery company.
(Item 44) The community according to Item 37, wherein the treatment specialist performs an office management operation using the server.
45. The community of claim 44, wherein the office management operation includes one or more of the following: patient planning, patient accounting, and complaint handling.
46. The community of claim 37, wherein the patient and the treatment professional access the server using a browser.
47. A computer implemented method for performing dental related electronic commerce comprising:
In response to an authorized request, transmitting dental data associated with the patient from the dental server to the treatment professional's computer via the Internet;
Displaying a three-dimensional computer model of the tooth on the treatment professional's computer using a browser;
Allowing a treatment professional to manipulate the three-dimensional computer model of the tooth using the browser;
Transmitting the computer model from the treatment specialist's computer to the server;
Generating an instrument for treating the patient based on the computer model of the tooth.
48. The method of claim 47 further comprising providing the patient funding options using one or more funding partners.
49. The method of claim 47 further comprising providing an online shop linked to the patient's dental requirements.
50. The method of claim 47 further comprising providing an office management utility for the treatment professional.
51. The method of claim 49, wherein the office management utility includes one or more of the following: patient planning, patient accounting, and claims processing.
52. The method of claim 47, wherein allowing the treatment professional to manipulate a three-dimensional computer model of a tooth using a browser further comprises displaying a plurality of dental views.
(Item 53) The dental views are as follows: right cheek view, left cheek view, posterior view, anterior view, mandibular occlusion view, maxillary occlusion view, overjet view, left distal molar view, left tongue view, lingual incision 52. The method of item 51, comprising one or more of a tooth view, a right tongue view, a right distal molar view, an upper jaw view, and a lower jaw view.
54. Allowing the treatment professional to manipulate a three-dimensional computer model of a tooth using a browser further includes clicking the tooth to adjust the position of the tooth. The method described in 1.
55. The method of claim 54, further comprising displaying x, y, and z axes to allow the treatment professional to adjust the position of the teeth.
56. The method of claim 47 further comprising providing supplementary services to the patient including tooth whitening services.
57. A server for supporting a healthcare e-commerce community having one or more patients and one or more service providers comprising:
A processor adapted to communicate with the network;
A data storage device coupled to the processor and adapted to store data for each patient;
And software for communicating 3D patient data in response to a client request.
58. The server of claim 57, further comprising a browser adapted to receive the client request and transmit the request to the server.
59. The server of claim 58, wherein the browser further includes a viewer plug-in that visualizes patient data in 3D.
60. The server of claim 57, wherein the provider service includes one or more of the following: health care application, dentistry application, beauty enhancement, hair care improvement, liposuction, plastic surgery, or reconstruction surgery.

FIG. 1 is a top view showing the anatomical relationship of a patient's jaw. FIG. 2A shows the patient's mandible in detail and provides a general indication as to how teeth can be moved by the method and apparatus of the present invention. FIG. 2B shows a single tooth from FIG. 2A and defines how the tooth travel distance is determined. FIG. 2C shows the jaw of FIG. 2A with an incremental positioner constructed by the method and apparatus of the present invention. FIG. 3 is a block diagram illustrating a process for making an incremental alignment tool. FIG. 4 is a flowchart illustrating a process for optimizing the final placement of a patient's teeth. FIG. 5 is a flow chart showing tooth placement at various steps of an orthodontic treatment plan. FIG. 6 is a flowchart of a process for determining a tooth path between intermediate positions in an orthodontic treatment plan. FIG. 7 is a flow chart illustrating a process for optimizing the tooth path from the first position to the last position in the orthodontic treatment plan. FIG. 8 is a diagram illustrating a buffering technique for using a collision detection algorithm. FIG. 9 is a flowchart for the collision detection technique. FIG. 10 is a block diagram illustrating a system for making an instrument according to the present invention. FIG. 11 is an illustration of a set of teeth that need to be moved in an extended pattern. FIG. 12 is an exemplary two-dimensional view showing the movement of each tooth in the diagram of FIG. FIG. 13 illustrates an exemplary X-type move. FIG. 14 illustrates an exemplary A-type move. FIG. 15 illustrates an exemplary V-type move. FIG. 16 shows an exemplary XX-type move.

(Detailed description of the invention)
FIG. 1 shows a skull 10 having a maxilla 22 and a mandible 20. The mandible 20 is fixed to the skull 10 at a joint 30. The joint 30 is called a temporary joint (TMJ). The maxilla 22 is associated with the maxilla 101 and the mandible 20 is associated with the mandible 100.

  Models of the jaws 100 and 101 are generated and a computer simulation model between the teeth on the jaws 100 and 101 interacts. Computer simulation allows the system to focus on movement involving contacts between teeth attached to the jaws. Computer simulation allows the system to draw the actual jaw movement, which is physically accurate when the jaws 100 and 101 touch each other. The jaw model places individual teeth at the location to be treated. In addition, this model can be used to simulate jaw movements including protrusion movements, lateral movements, and "tooth guided" movements. The path of the lower jaw 100 is guided by tooth contact rather than the anatomical limits of the jaws 100 and 101. Motion is applied to one jaw, but may be applied to both jaws. Based on the occlusion decision, the last position of the teeth can be confirmed.

  Here, referring to FIG. 2A, the lower jaw 100 includes, for example, a plurality of teeth 102. At least some of these teeth may be moved from the first tooth arrangement to the last tooth arrangement. An optional center line (CL) is drawn through the teeth 102 as a reference frame to explain how the teeth can be moved. With respect to this centerline (CL), each tooth can be moved in the orthogonal direction indicated by axes 104, 106, and 108 (axis 104 is the centerline). It can be rotated about axis 108 (root angle) and axis 104 (torque) as indicated by arrows 110 and 112, respectively. In addition, as indicated by arrow 114, the teeth may be rotated around the centerline. Thus, all possible free-form movements of the teeth can be performed.

  FIG. 2B shows how the magnitude of any tooth movement can be defined in terms of the maximum linear translation of any point P on the tooth 102. When the tooth moves in any orthogonal or rotational direction as defined in FIG. 2A, each point P1 undergoes an accumulated translation. That is, this point usually follows a non-linear path, but there is a linear distance between any point on the tooth if determined at any two times during the procedure. Thus, in fact any point P1 can undergo a true side translation, as indicated by arrow d1, while the second arbitrary point P2 moves along the arcuate path and the last translation d2 may be produced. Many aspects of the invention are defined for the maximum allowable movement of point P1 induced on any particular tooth. Such maximum tooth movement is then defined as the maximum linear translation of this point P1 on the tooth that undergoes the maximum tooth movement for this tooth in any treatment step.

  FIG. 2C shows an adjustment device 111 worn by the patient to achieve an incremental repositioning of individual teeth in the jaw, generally as described above. The appliance is a polymer shell having teeth that receive cavities. This is described in US application Ser. No. 09 / 169,036 filed Oct. 8, 1998, which is a priority of US application Ser. No. 08 / 947,080 filed Oct. 8, 1997. And claims the priority of provisional application No. 06 / 050,352 (collectively earlier applications) filed on June 20, 1997, the entire disclosures of which are incorporated herein by reference.

  As described in the earlier application, each polymeric shear can be configured such that the teeth receiving the cavity have a geometry corresponding to the intermediate tooth placement or the last tooth placement intended for the appliance. The patient's teeth are repositioned from the patient's first tooth placement to the last tooth placement by placing a series of incremental positioning devices over the patient's teeth. Adjustment appliances are generated at the start of the procedure and the patient wears each appliance until the pressure of each appliance on the teeth can no longer be left. In this regard, the patient continuously replaces the current adjustment device with the next adjustment device until no more devices are left. Traditionally, instruments are generally not secured to teeth and the patient can place and replace the device at any time during the procedure. The last set of appliances or some appliances may have some geometry or a selected geometry to overcorrect the tooth placement (ie, the tooth placement that has been selected as the “last”) With a geometry that moves beyond individual teeth (if fully achieved). Such overcorrection is desirable to correct for potential recurrence after the relocation method is completed (ie, allowing some movement of individual teeth back to the precorrected position of the teeth). possible. Overcorrection can also be beneficial to accelerate the correction speed. That is, by having an appliance with a geometry that is placed beyond the desired intermediate or final position, the individual teeth are shifted to that position at a greater speed. In such a case, the use of the appliance can be terminated before the teeth reach the position defined by the appliance.

  The polymer shell 111 can be secured over all teeth present in the lower or upper jaw. Often, if only certain of the teeth are repositioned and the appliance 111 provides the remaining repositioning force against the tooth to be repositioned, the other teeth will either be the base region that holds the appliance 111 or Provides an anchor area. However, in complex cases, multiple teeth can be repositioned at some point during the procedure. In such cases, the tooth being moved may also function as a base region or anchor region that supports the repositioning device.

  The polymerization device 111 of FIG. 2C can be formed from a thin sheet of a suitable elastomeric polymer such as the thermoformed dental material Tru-Tain 0.03 available from Tru-Tain Plastics, Rochester, Minnesota. Usually, no wires or other means are provided to hold the appliance over the teeth. However, in some cases, it may be desirable or necessary to provide corresponding receptacles or openings in the appliance 100 in individual anchors or teeth, and the appliance may be on a tooth that would not be possible without such an anchor. The upward force can be applied.

  FIG. 3 shows a process 200 for generating an incremental alignment device for subsequent use by a patient to reposition the patient's teeth. In the first step, an initial digital data set (IDDS) representing the initial tooth placement is obtained (step 202).

  In some implementations, the IDDS is data obtained by scanning a physical model of the patient's teeth (such as scanning the patient's teeth for positive or negative impressions using a laser scanner or destructive scanner). including. Positive and negative impressions can be scanned while interlocking with each other to provide more accurate data. The initial digital data set may also contain volumetric image data of the patient's teeth, and the computer may use this image data for a 3D geometric model of the tooth surface, for example using conventional marching cube technology. Can be converted to In some embodiments, the individual tooth model includes data indicating hidden tooth surfaces (eg, roots imaged by X-ray, CT scan, or MRI techniques). The roots and hidden surfaces can also be extrapolated from the visible surface of the patient's teeth. The IDDS is then operated using a computer with an appropriate graphical user interface (GUI) and software suitable for viewing and modifying this image. Detailed aspects of this process are described in detail below.

  Individual teeth and other elements can be segmented or separated in the model, allowing individual relocation or removal from the digital model. After segmenting or separating elements, users often reposition teeth in the model by following rules or other specifications provided by treatment professionals. Alternatively, the user may reposition one or more teeth based on visual appearance or computer programmed rules and algorithms. Once the user is satisfied, the last tooth placement is incorporated into the last digital data set (FDDS) (step 204).

  At step 204, a determination is made by generating a computer representation of the patient's mastication system. The occlusion of the upper and lower teeth is calculated from the computer display, and the functional occlusion is calculated based on the interaction in the computer display of the mastication system. This occlusion can be determined by generating an ideal set of teeth models. Each ideal model in the set of ideal models is an abstract model of idealized tooth placement, customized for the patient's teeth. After applying the ideal model to the computer display, the tooth position is optimized to fit the ideal model. An ideal model can be specified by one or more arc shapes or can be specified using various characteristics associated with the teeth.

  The FDDS is generated by following orthodontic rules to move the teeth in the model to their last position. In one embodiment, this rule is built into the computer and automatically calculates the final position of the tooth. In another alternative embodiment, the user moves the teeth to the last position by manipulating one or more teeth independently while satisfying the prescribed limits. Various combinations of the above techniques may be used to reach the final tooth position.

  One method for generating the FDDS includes moving the teeth in a specific order. First, the center of each tooth model can be aligned using multiple methods. One method is a standard arch. The tooth model is then rotated until the root is in the proper vertical position. The tooth model is then rotated around the vertical axis to the proper orientation. The tooth model is then observed from the side and translated vertically to the appropriate vertical position. Finally, the two arches are placed on each other and the tooth model is moved slightly to ensure that the upper and lower arches are properly joined together. Coupling the upper and lower arches together is visualized using a collision detection process to highlight the tooth contact points.

  Based on IDDS and FDDS, a plurality of intermediate digital data sets (INTDDS) are defined to correspond to incrementally adjusted instruments (step 206). Finally, a set of incremental alignment instruments is generated based on a series of INTDDS and FDDS (step 208).

  After the teeth and other elements are placed or removed to generate a model of the last tooth placement, it is necessary to create a treatment plan that produces a series of INTDDS and FDDS, as described above. In order to generate these data sets, it is necessary to define or map selected individual tooth movements from the first position to the last position over a series of consecutive positives. Furthermore, it is necessary to add other characteristics to the data set to produce the desired characteristics in the treatment instrument. For example, for specific purposes (to reduce gum pain, to avoid periodontal problems, to maintain gaps between appliances and specific areas of teeth or jaws to allow caps, etc.) It may be desirable to add wax patches to the image to define the cavities or recesses of the image. More often, it is necessary to provide a receptacle or opening intended to accommodate the anchor, which is manipulated by the teeth in the manner required for the anchor (eg, should be lifted relative to the jaw). Placed on the tooth to allow it to be done.

  In the above aspect, information regarding how the patient's teeth should move from the first untreated state to the last untreated state is used to generate a rule or treatment plan. The rules consider the following:

1. “Start position”: Detailed description of the first malocclusion. 2. “Last Position”: Detailed description of the patient's treatment objective. “Movement”: a detailed and continuous description of how the patient's teeth should move to achieve the desired goal for the final placement (1. Initial position)
The selection of the initial position is described in detail in the patient's malocclusion. Considerations include the following: a. Dense b. Gap c. Excision d. Stripping
In addition, consideration for the last position described below may be used.

(2. Last position)
This section is a detailed description of the last location object and treatment goal (both static and functional). These considerations include: a. Overjet b. Capping occlusion c. Center line d. Functional occlusion e. Classification f. Torque g. Chip h. Rotation i. Tongue / palate j. Cheek / face k. Intercuspal fitting l. Initial position of occlusion-CR / CO considerations m. Internal arch tissue n. Tissue within the arch o. Gap 3. Movement The movement part specifies the order in which the patient's teeth are moved to achieve the goal for the final placement. In this process, the orthodontist has precise control over which teeth the orthodontist wants to move and which teeth he wants to fix (rather than move), thereby separating the treatment Disassemble to the stage. Movement order information is obtained for both the upper and lower arches.

  At each stage, large tooth movement and small tooth movement are analyzed. Large movements usually occur early in the tooth movement. Small movements usually occur as “fine” movements that occur near the end of treatment. On average, each aligner should be able to achieve a movement of about 0.25-0.33 nm and be rotated about 5-10 degrees within a two week period. However, biological variability, patient and clinician preferences are also considered. In addition, various movements such as centrifugation, tip, and torque can have separate parameters.

  Based on these considerations, a plan for moving the teeth is generated. FIG. 4 shows a process 300 for generating tooth movement while minimizing tooth index, as discussed in co-pending US application Ser. No. 09 / 169,034. The contents of this application are incorporated herein by reference. Initially, the process 300 identifies various features associated with each tooth, either automatically or with human assistance, to arrive at a tooth model (step 302). An ideal set of teeth is then generated either from the patient's dental mold or from a patient with a known acceptable occlusion (step 303).

  From step 302, the process 300 positions the tooth model in the approximate final position based on the feature match to the ideal model (step 304). In this step, each tooth model is moved so that its features are adjusted to the corresponding tooth features in the ideal model. The feature may be based on a crest, fossae, ridge, spacing-based criteria, or shape-based criteria. The distance based on the shape can be expressed in particular as a function of the patient's arch.

  Next, the process 300 calculates an orthodontic / occlusion index (step 306). One index that can be used is a PAR (Peer Assessment Rating) index. In addition to PAR, other metrics can be used, such as a shape based metric or a spacing based metric. The PAR indicator identifies how far the teeth are from good meshing. Scores are assigned to various occlusal characteristics that tailor malocclusion. The individual scores are summed to obtain a total sum representing the normal sequence and the degree of case deviating from the occlusion. Normal occlusion and alignment is defined as all anatomically adjacent contact points with good intercuspation between the teeth in the upper and lower mouth and non-excessive overjet and overbite .

  In PAR, a score of 0 indicates a good sequence and a higher score indicates an increased level of irregularity. The total score is recorded in the dental template before and after treatment. The difference between these scores represents the degree of improvement as a result of orthodontic intervention and active treatment. The eleven elements of the PAR indicator are upper right segment, upper front segment, upper left segment, lower right segment, lower front segment, lower left segment, right cheek occlusion, overjet, over bite, center line, and left cheek occlusion is there. In addition to the PAR indication, other indications may be based on the separation of the tooth features from the ideal position or ideal shape.

  From step 306, process 300 determines whether further index reduction movement is possible (step 308). Here, all possible movements are attempted, including small movements along each major axis and small movements with small rotations. The index value is calculated after each small move and the move that best suits the result is selected. As used herein, the best results are those that minimize one or more metrics such as PAR-based metrics, shape-based criteria, or interval-based criteria. Optimization may use a number of techniques, including simulated annealing techniques, hilly climbing techniques, best first techniques, Powell methods, and heuristic techniques. A simulated annealing technique can be used when the index is temporarily increased and other paths in the search space with lower minimum values can be found. However, by starting with a tooth that is in an almost ideal position, any drop in the index should converge to the best result.

  In step 308, if the index can be optimized by moving the teeth, an input of an increase index reduction movement is added (step 310) and the process loops back to step 306 to calculate the orthodontic / occlusion index. Continue. Alternatively, if the index cannot be further optimized, the process 300 ends (step 312).

  In the step 310 of generating an indicator that reduces the movement, the process considers a set of movement forcings that affect the tooth path movement plan. In one embodiment, travel information for about 50 distinct stages is specified. Each stage represents a single aligner, which is expected to be replaced about every two weeks. Thus, each stage represents a period of about 2 weeks. In one embodiment, a two-dimensional array is used to track a specific movement for each tooth with a specific period. One dimension of the array is associated with tooth identification while the second dimension is associated with a time period or stage. Considerations regarding when teeth can be moved include the following:

a. Mesial b. Distal c. Cheek / face d. Tongue / Palate e. Expansion f. Space g. Past tooth movement h. Intrusion i. Extension j. Rotation k. Which teeth move when?
l. Which tooth moves first?
m. Which teeth need to move before other teeth are moved?
n. What moves can be made easily?
o. Fixed p. Orthodontic user's view of moving away molars and small extensions in adults In one embodiment, the user may change the number of desired treatment stages from the beginning to the target dental condition. Any component that is not moved is assumed to remain stationary, so that its final position is assumed to be similar to the initial position (one or more keyframes are applicable components). The same is true for all intermediate positions).

  The user may further identify a “keyframe” by selecting an intermediate state and changing to component position (s). In some embodiments, if not otherwise indicated, the software will automatically and linearly identify all users' specified positions (initial position, all keyframe positions, and target position). Interpolate between). For example, if only the final position is specified for a particular component, the stage of each connection after the first stage is simply equal to the component and the linear distance and rotation closer to the final position (especially by quaternion) Indicates. If the user specifies two keyframes for the component in question, the component “moves” linearly from the first position through a different stage to the position defined by the second keyframe. It then moves to the position defined by the second keyframe, linearly in as different directions as possible. Finally, it moves to the target position linearly, possibly in a further different direction.

  These operations can be done independently at each component, so that keyframes for one component do not affect other components unless another component is further moved by the user at that keyframe. Some components may accelerate along a curve between a pair of stages (eg, stages 3 and 8 in a treatment plan with many applicable stages), while other components are separated linearly. Move between pairs of stages (e.g., stages 1-5), then suddenly change direction and slow down along a linear path to a later stage (e.g., stage 10). This flexibility allows considerable freedom in planning patient treatment.

  In some implementations, non-linear interpolation is used instead of or in addition to linear interpolation to configure the treatment path between key frames. In general, non-linear paths such as spline curves created to fit between selected points are shorter than paths formed from straight segments joining points. “Treatment path” describes a transformation curve that is applied to a particular tooth to move the tooth from its initial position to its final position. Typical treatment paths include several combinations of rotational and translational movement of the corresponding teeth, as described above.

  FIG. 5 shows step 310 in more detail. First, the first tooth is selected (step 311). Next, the constraints associated with the tooth are retrieved for the current stage or period (step 312). Thus, for embodiments that maintain a two-dimensional array to track a specific movement for each tooth at a specific period of time, tooth identification and time period or stage information is derived from the array and associated with the current tooth. Used to search for a constraint to be performed.

  Next, a tooth movement plan that takes into account the constraints is generated (step 313). The process of FIG. 5 then detects whether the planned movement causes a collision with an adjacent tooth (step 314). The collision detection process determines which of the geometry describing the tooth surfaces intersects. If there are no obstacles, the space is considered free. If not, it will be disturbed. A suitable collision detection algorithm is discussed in more detail below.

  If a collision occurs, a “push” vector is created to shift the planned path of travel (step 315). Based on the push vector, a “bounce” from the current tooth collision and a new tooth movement are generated (step 316). From step 314 or 316, the current tooth movement is terminated.

  Next, the process of FIG. 5 determines whether a tooth movement plan has been generated for all teeth (step 317), and if it is determined that it has been generated, the process ends. Alternatively, the next tooth in the treatment plan is selected (318) and the process of FIG. 5 loops back to step 312 to continue generating the tooth movement plan.

  The resulting final path contains a series of vectors, each of which represents a transforming translational and rotating component group of interpolation parameters of the moving tooth. Collectively, these constitute a schedule of tooth movement that avoids interdental interference. Pseudo code for generating a tooth path in terms of specified constraints is shown as follows:

For each tooth path model For each path increase Load constraint related to each tooth Move teeth in terms of restraint Perform tooth collision detection When a collision occurs, Create a “push” vector and a “bounce” after a collision to avoid the end. End tooth path model FIG. 6 is a flowchart of a process performed by a computer to generate a non-linear treatment path, The patient's teeth move along this path during treatment. Non-linear paths are usually generated automatically by a computer program, but in some cases are generated with human assistance. The program receives as input the initial and final positions of the patient's teeth and uses this information to select an intermediate position for each tooth being moved (step 1600). The program then applies a conventional spline curve calculation algorithm to create a spline curve that connects the initial position of each tooth to the final position of the tooth (step 1602). In many situations, the curve is constrained and follows the shortest path between intermediate positions. The program then samples each spline curve between the intermediate positions (step 1604) and applies a collision detection algorithm to the sample (step 1606). If any collision is detected, the program selects a new position for one of the intermediate steps (step 1608) and creates a new spline curve (1602) to create at least one tooth in each colliding pair. Change the route. The program then samples the new path (1604) and again applies the collision detection algorithm (1606). The program continues in this manner until no collision is detected. The routine then stores the path by saving the coordinates of each point in the tooth at the path location in an electronic storage device such as a hard disk (step 1610).

  The path generator program selects the treatment location so that the tooth treatment path is approximately equal in length between each adjacent pair of treatment steps, whether using linear or non-linear interpolation. The program further avoids treatment positions that push the tooth part to move above a given maximum speed. For example, the teeth may be scheduled to move along the first path T1 from the initial position T11 to the final position T13 via the intermediate position T12. The intermediate position T12 exists closer to the final position T13. Another tooth is scheduled to move via the intermediate position T22 from the initial position T21 to the final position T23 along a shorter path T2. The intermediate position T22 is equidistant from the first position T21 and the final position T23. In this situation, the program is that these two intermediate positions T14 are approximately equidistant from the initial position T11 and intermediate position T12, and the intermediate position T12 is separated from the final position T13 by approximately the same distance. One may choose to insert along the first path T1 separating positions. Changing the first path T1 in this way ensures that the first tooth moves in equal sized steps. However, changing the first path T1 further introduces an additional treatment step in which there is no counterpart in the second path T2. The program allows the second tooth to remain stationary during the second treatment step, i.e. the first tooth moves from one intermediate position T14 to another intermediate position T13, or This situation can be reacted in various ways, such as by changing the second path T2 to include four equidistant treatment locations. The program determines how to react by applying a series of orthodontic constraints that limit tooth movement.

  The orthodontic constraints that can be applied by the path generator are the minimum and maximum distances allowed between adjacent teeth at any given time, the maximum linear or rotational speed at which the tooth should be moved, the treatment step The maximum distance the tooth is moved between, tooth shape, tissue characteristics and bones surrounded by the tooth (eg, tough teeth cannot be moved at all), and aligner material characteristics (eg, aligner The maximum distance that a given tooth can be moved over a given time period). For example, the patient's age and jaw density may indicate a certain “safety limit” beyond which the patient's teeth cannot force movement. In general, the gap between two adjacent, relatively vertical, non-pointed, lateral teeth should not close more than about 1 mm every 7 weeks. The material properties of orthodontic appliances also limit the amount that the appliance can move teeth. For example, conventional retainer materials typically limit the movement of individual teeth to about 0.5 mm between treatment steps. The constraint has a defect value that is given to the patient if no special value is calculated or provided to the user. Restraint information is available from a variety of sources including textbooks and treating clinicians.

  In selecting an intermediate position for each tooth, the path generation program calls a collision detection program to determine whether a collision occurs along the selected path. The program also examines the patient's occlusion at each treatment step along the path to ensure that the teeth are aligned to form an acceptable engagement over the course of treatment. If a collision or unacceptable engagement occurs, or if the required constraints are not met, the program will iteratively change the wrong tooth path until all conditions are met. The virtual articulator described above is one tool for testing the bite bite at the intermediate treatment position.

  As shown in FIG. 7, when the path generation program establishes a collision-free path in which each tooth is moved, the program transforms the curve for each tooth between the initial position and the final position more linearly. Call an optimization routine that tries to do that. The routine places, for example, two sample points between each treatment step at a point during the treatment step (step 1702) and calculates a more linear treatment path that fits between the sample points for each tooth. Starts by sampling each treatment route (step 1704). The routine then applies a collision detection algorithm to determine if the collision is a result from a modified path (step 1706). If so, the routine again samples the modified path (step 1708) and then configures an alternative path between samples for each tooth (step 1710). The routine continues in this manner until no collision occurs (step 1712).

  In some embodiments, as mentioned above, the software automatically computes a treatment route based on IDDS and FDDS. This is accomplished using a patch scheduling algorithm that determines the speed of each component, i.e., each tooth, and moves along the path from the initial position to the final position. The patch scheduling algorithm is a "smooth path that avoids round-tripping, i.e. avoids moving the tooth along a gap larger than the gap absolutely necessary to straighten the tooth. Such movement is less desirable and has a potentially negative effect on the patient.

  One implementation of the path scheduling algorithm first attempts to schedule or achieve tooth movement by constraining each tooth to the treatment path from the most linear initial position to the final position. The algorithm then relies on a non-direct route to the final position only if a collision occurs between the teeth along a linear path or if a forced constraint is violated. The algorithm applies one of the above path generation processes, if necessary, to construct a path where there is no intermediate treatment step along the linear transformation curve between the initial and final positions. Alternatively, the algorithm schedules treatment paths by deriving a preferred treatment database for exemplary tooth placement. This database, over time, observes the treatment of various processes and identifies treatment plans that prove to be most successful with the first tooth placement of each general class, Can be configured. The route scheduling algorithm may create several alternative routes and present each route graphically to the user. The algorithm provides the path selected by the user as output.

  In other implementations, the route scheduling algorithm utilizes probability search techniques to find unimpeded routes through a configuration space describing the impossible treatment plan. One approach to the scheduling operation between two users in which a global key frame is defined is described as follows. Scheduling beyond a time interval that includes intermediate keyframes involves dividing the time interval into subintervals that do not include intermediate keyframes, scheduling each of these intervals independently, and then combining the resulting schedules. Achieved by:

The collision or failure detection algorithm used in one embodiment is Stefan.
Gottschalk et al., SIGGRAPH paper (1996): “OBBTTree: A Hierarchical Structure for Rapid Interference Detection.”. The contents of the SIGGRAPH paper are incorporated herein by reference.

  The algorithm is centered around a recursive subdivision of the space occupied by the object, and the object is organized in a binary tree-like manner. In DDS, triangles are used to represent teeth. Each node of the tree is referred to as an oriented bounding box (OBB) and contains a subset of triangles that appear in the parent of the node. The child of the parent node contains all of the triangle data stored in the parent node between them.

  The bounding box of the node is oriented to fit tightly around all triangles at the node. The leaf nodes in the tree ideally contain a single triangle, but could contain more than one triangle. Detecting a collision between two objects includes determining whether the object's OBB trees intersect. If the OBB of the root node of the tree overlaps, the root children are checked for overlap. The algorithm proceeds in a recursive manner until leaf nodes are reached. In this regard, a strong triangle crossing routine is used to determine if the triangle at the branch is included in the collision.

  The collision detection techniques described herein provide some increase to the collision detection algorithm described in the SIGGRAPH paper. For example, the OBB tree can be built in a slack fashion to save memory and time. This approach arises from observing that some parts of the model are never involved in the collision, and in conclusion, the OBB tree for such parts of the model need not be computed. The OBB tree is expanded by separating internal nodes as needed during the recursive collision determination algorithm.

  In addition, triangles in the model where no collision data is required can be specifically excluded from consideration when the OBB tree is built. For example, movement can be seen at two levels. Objects can be conceptualized as “moving” in an overall sense. Or they can be conceptualized as “moving” in relation to other objects. Since the state of collision between such objects does not change, additional information improves the time acquired for collision detection by avoiding recalculation of collision information between objects that are dormant with respect to each other. To do.

  FIG. 8 shows an alternative collision detection scheme, where one scheme calculates a “collision buffer” oriented along the z-axis 1802 along which the two teeth 1804, 1806 are aligned. A collision buffer is calculated for each position along the treatment path where each treatment step or collision detection is required. To create a buffer, an x, y plane 1808 is defined between the teeth 1804, 1806. The plane must be “neutral” with respect to the two teeth. Ideally, the neutral plane is positioned so as not to intersect any teeth. If an intersection with one or both teeth is unavoidable, the neutral plane is oriented so that there are as many teeth as possible on the opposite side of the plane. In other words, the neutral plane, like the other teeth, minimizes the amount of surface area on each tooth on the same side of the plane.

  Within the plane 1808 is a separation portion that is a grating, the resolution of which depends on the resolution required for the collision detection routine. A typical high resolution collision buffer includes a 400 × 400 grid. A typical low resolution buffer includes a 20 × 20 grid. The z-axis 1802 is defined by a line perpendicular to the plane 1808.

  The relative positions of the teeth 1804, 1806 are determined by calculating a linear distance parallel to the z-axis 1802 between each of the points in the grid, the plane 1808 and the surface closest to each tooth 1804, 1806. . For example, at any given grid point (M, N), the closest surfaces of plane 1808 and back tooth 1804 are separated by a distance represented by the value Z1 (M, N), while plane 1808 and The closest surfaces of the front teeth 1806 are separated by a distance represented by the value Z2 (M, N). The collision buffer is defined such that the plane 1808 is at z = 0 and the positive value of z is towards the rear tooth 1804, where the teeth 1804, 1806 are arbitrary grid points (M, N ) In the case of Z1 (M, N) Z2 (M, N).

  FIG. 9 is a flowchart of a collision detection routine for executing this collision buffer scheme. The routine initially receives data from one of the digital data sets indicating the position of the tooth surface to be tested (step 1900). The routine then defines a neutral x, y plane (step 1902) and creates a z-axis perpendicular to the plane (step 1904).

  The routine then determines a linear distance in the z-direction between the plane and the closest surface of each tooth for the x, y position of the first grid point on the plane (step 1906). To detect a collision at the x, y-position, the routine determines whether the z-position of the nearest surface of the rear tooth is less than or equal to the z-position of the nearest surface of the front tooth (step 1908). If it is below the z-position, the routine creates an error message and displays it to the user or feeds back to the path generator program to inform that a collision occurs (step 1910). The routine then determines whether all x, y-positions associated with the grid points on the plane have been tested (step 1912), and if not, the step is repeated for each remaining grid point. A collision detection routine is performed for each pair of adjacent teeth in the patient's mouth at each treatment step.

  The system may further incorporate a “movie” function, where the user uses the “movie” function to show a moving movie from the initial state to the target location at any point. This is useful for visualizing the movement of the entire component over the treatment process.

  As described above, one suitable user interface for component identification is a three-dimensional interactive graphical user interface (GUI). The three-dimensional GUI is further advantageous for component operators. Such an interface provides a professional treatment or user with immediate and visible interaction with digital model components. The 3D GUI provides the interface with the advantage of allowing only one low level command to instruct the computer to manipulate a particular segment. In other words, the GUI adapted for operation is better in many respects than the interface and accepts commands such as “translate this component to the right by 0.1 mm”. Such low-level commands are useful for fine tuning. However, if they were a single interface, the component manipulation process would be tedious and time consuming interaction.

  Prior to and during the manipulation process, one or more dental components may be augmented by a root template model. Manipulating tooth models augmented with root templates is useful, for example, in situations involving striking under the gum line. These template models include, for example, x-ray representations on digitized patient teeth.

  The software further allows for annotating data sets that may include text and / or instrument sequence numbers. The annotation is added as interrupted text (ie it is a 3-D geometry) so that it appears on the printed positive model. The annotation may be placed on the part of the mouth covered by the repositioning device, but is not important for tooth movement, and the annotation may appear on the delivered repositioning device (s).

  The above component identification and component manipulation software is designed to operate with the same standards of refinement as the operator's skill level. For example, component operation software can assist a computer operator by providing feedback on permitted and forbidden operations of teeth without performing orthodontic practice. On the other hand, orthodontists have excellent skills in oral physiology and tooth movement dynamics, easily use component identification and manipulation software as a tool, disable advice, or otherwise Can be ignored.

FIG. 10 is a simplified block diagram of the data processing system 500. Data processing system 500 typically includes at least one processor 502 that communicates with a number of peripheral devices via bus subsystem 504. These peripheral devices typically include a storage subsystem 506 (memory subsystem 508 and file storage subsystem 514), a set of user interfaces and output devices 518, and an interface to an external network 516 (a public switched telephone). Network). This interface is shown schematically as a “Modems and Network Interface” block 516 and is coupled via a communication network interface 524 to corresponding interface devices in other data processing systems. Data processing system 500 may include a terminal or low-end personal computer or high-end personal computer, workstation or mainframe. The user interface input device typically includes a keyboard and may further include a pointing device and a scanner. The pointing device can be an indirect pointing device such as a mouse, trackball, touchpad, or graphics tablet, or a direct pointing device such as a touch screen embedded in a display. Other types of user input devices such as voice recognition systems can be used.

The user interface output device may include a printer and a display subsystem, which includes a display controller and a display device coupled to the controller. The display device can be a flat panel device such as a cathode ray tube (CRT), a liquid crystal display (LCD), or a projection device. The display subsystem may further provide a non-visual display such as audio output. The storage subsystem 506 maintains the basic programming and data organization that provides the functionality of the present invention. The software modules described above are typically stored in the storage subsystem 506. Storage subsystem 506 typically includes a memory subsystem 508 and a file storage subsystem 514.

The memory subsystem 508 typically includes a plurality of main random access memory (RAM) 510 for storing instructions and data during program execution and a read only memory (ROM) 512 in which fixed instructions are stored. Includes memory. In the case of a Macintosh-compatible personal computer, the ROM includes a part of the operating system, and in the case of an IBM-compatible personal computer, this is the BIOS (basic
input / output system).

  The file storage subsystem 514 provides persistent (non-volatile) storage for program and data files, typically associated with at least one disk drive and at least one floppy disk drive (removable media associated) Included). In addition, other devices such as CD-ROM drives, optical drives (all associated with removable media) may be used. In addition, the system may include a type of drive having a removable media cartridge. The removable media cartridge can be, for example, a hard disk cartridge such as that sold by Imega. One or more drivers may be located in a remote location, such as a server on a local area network or a site on the Internet's World Wide Web.

  In this context, the term “bus subsystem” is generally used to include various mechanisms and to allow various components and subsystems to communicate with each other as intended. Other than the input device and the display, the other components need not be in the same physical arrangement. Thus, for example, portions of the file storage system can be coupled via various local area or wide area network media including telephone lines. Similarly, the input device and display need not be co-located with the processor, but it is expected that the present invention will be performed frequently in the ConPCS and workstation text.

  Although the bus subsystem 504 is shown schematically as a single bus, a typical system is a multiple bus such as a local bus and one or more expansion buses (eg, ADB, SCSI, ISA, EISA, MCA, NuBus, or PCI), and a serial or parallel port. The network connection is usually established via a device such as one of these expansion buses or a modem network adapter on a serial port. The client computer can be a desktop system or a portable system.

  The scanner 520 is responsible for scanning the patient's dental mold obtained from the patient or from an orthodontist and providing the scanned digital data set information to the data processing system 500 for further processing. In a distributed environment, the scanner 520 may be remotely located and communicate scanned digital data set information to the data processing system 500 via the network interface 524.

  The manufacturing device 522 manufactures dental instruments based on the intermediate and final data set information received from the data processing system 500. In a distributed environment, the manufacturing device 522 may be remotely located and receive data set information from the data processing system 500 via the network interface 524.

  The system of FIG. 10 may generate a series of continuous instruments as defined by the treatment plan. The treatment plan may be specified by a treatment professional such as a dentist or orthodontist. FIGS. 11-16 illustrate an exemplary treatment specification using a tooth movement planning system. FIG. 11 exemplarily shows a set of 14 teeth numbered 601, 602, 604, 606, 610, 612, 614, 616, 614, 616, 618, 620, 622, 624 and 625. In the example of FIG. 11, teeth 601, 602, 604 need to move or expand toward the left side of the figure, while teeth 606, 608, 610 and 612 are curvilinearly toward the left Need to move extended. In contrast, the teeth 614, 616 and 618 need to be moved in a curvilinear manner on the right side of the figure and the teeth 618, 620, 622, 624 and 625 need to be moved to the right. . As a result of the end of the definition illustrated in FIG. 11, the teeth are moved within the expansion pattern.

  Returning now to FIG. 12, an illustration of the movement diagram of FIG. 11 is shown as specified on the two-dimensional array. In FIG. 12, the top row identifies the identity of the tooth, and the left row number indicates the stage arrangement for each tooth. In this case, each stage takes about 2 weeks and the duration can be increased or decreased. In the example of FIG. 12, the tooth 601 is moved between the stages 1-10. Similarly, teeth 602, 604, 606 are moved between stages 1-10. In stages 10-20, teeth 608 are moved. Further, the teeth 610 to 616 are moved on the stages 20 to 30. Teeth 618 are moved between stages 10-20. Also, teeth 620, 622, 624 and 625 are moved into stages 1-10. The net result is an extended movement pattern as specified by the two-dimensional array.

  13-16 illustrate exemplary extended movement patterns, other patterns can be identified using a two-dimensional array as well. These patterns can be incorporated into a library of migrations. For a given initial position and final collected position of the patient's teeth, the system generates an in-between stage by finding the stage position of each tooth by the selected movement. FIGS. 13-16 illustrate exemplary movement patterns: X-type movement, A-type movement, V-type movement, and XX-type movement and others. These exemplary movement patterns are discussed next.

  An exemplary X movement is shown in FIG. X-type movement is also known as “all equal movement”. In this movement, all teeth in a given group are moving simultaneously. The tooth path is determined by dividing the starting frame. The frame includes teeth in half frames and recursively determines intermediate paths in each half. Recursion stops when the distance traveled within each frame meets a given criterion. As the movement is made, the system adjusts the tooth movement so that each frame does not exceed one or more distance constraints.

  Next, type A movement is discussed. In this type of movement, the front teeth move first, followed by the back teeth. The movement is similar to the letter A because the front tooth moves to the next front. In each tooth, the adjacent tooth starts moving when the current tooth reaches the target position of the current tooth. A diagram of A-type movement is shown in FIG.

  V-shaped movement is shown in FIG. Conceptually, V-type movement is the opposite of A-type movement. The back teeth move first, followed by the next front teeth. In one implementation, a reverse A movement is made to the rear teeth, but the front teeth pass through the X-type movement.

  FIG. 16 shows XX type movements, including two equal movements. The rear teeth all perform the same movement (type X) first, and the front teeth all pass the same movement.

  Various alternatives, modifications, and equivalents may be used in place of the above components. The final position of the tooth can be determined using computer-aided techniques, and the user can move the tooth to the final position independently by manipulating one or more teeth while satisfying prescribed limits. .

  In addition, the techniques described herein may be incorporated into hardware or software, or a combination of the two. The technology is a computer program that runs on a programmable computer, each including a processor, storage media readable by the processor (including volatile or non-volatile memory and / or storage elements), and appropriate input and output devices. Can be incorporated into. The program code is applied to data entered using an input device to perform the functions described and generate output information. The output information is applied to one or more output devices.

  Each program may be executed in a high-level procedural or object-oriented programming language and operate in conjunction with a computer system. However, if desired, the program can be executed in assembly or machine language. In some cases, the language may be an edited or translated language.

  Each such computer program is a storage medium readable by a general purpose or special purpose programmable computer for configuring and operating the computer when the storage medium or device is read by a computer and performs the procedures described. Or it can be stored on a device (eg, CD-ROM, hard disk, or magnetic disk). The system can also be implemented as a computer readable recording medium configured with a computer program. Here, since the storage medium is configured as described above, the computer can operate in a specific manner and a predetermined manner.

  The present invention has been described with respect to particular embodiments. Other embodiments are within the scope of the claims. For example, the three-dimensional scanning method described above can be used to analyze the material properties (eg, contractility and expandability) of the materials forming the tooth casting and aligner. Further, the 3D tooth model and graphical interface described above can be used to assist clinicians treating patients with conventional braces or other conventional orthodontic appliances. In this case, the constraints imposed on the teeth are changed accordingly. In addition, the dental model may be presented on a hypertext transfer protocol (http) website for limited access by the corresponding patient and treating clinician.

  Furthermore, while the invention has been shown and described with reference to embodiments of the invention, the foregoing and other formal and detailed changes may be made without departing from the spirit and scope of the claims. Those skilled in the art will understand that this can be done.

Claims (5)

  A computer-implemented method for performing dental-related electronic commerce comprising:
  In accordance with authorized requests, transmitting dental data related to the patient from the dental server to the treatment specialist's computer via the Internet;
  Displaying a three-dimensional computer model of the tooth on the treatment professional's computer using a browser;
  Allowing the treatment professional to manipulate the three-dimensional computer model of the tooth using the browser and to identify the use of a tooth movement pattern from a stored library of tooth movement patterns; ,
  Transmitting the computer model from the treatment specialist's computer to the server;
  Generating an instrument for treating the patient based on the computer model of the tooth;
  Including the method.   The method of claim 1, wherein allowing a treatment professional to manipulate a three-dimensional computer model of a tooth using the browser further comprises displaying a plurality of dental views.   The dental view includes right cheek view, left cheek view, posterior view, anterior view, mandibular occlusion view, maxillary occlusion view, overjet view, left distal molar view, left tongue view, tongue incisor view, right tongue view 3. The method of claim 2, comprising one or more of: a right distal molar view, an upper jaw view, and a lower jaw view.   The method of claim 1, wherein allowing a treatment professional to manipulate a three-dimensional computer model of a tooth using the browser further comprises clicking on the tooth to adjust the position of the tooth. Method.   The method of claim 4, further comprising displaying x, y, and z axes to allow the treatment professional to adjust the position of the teeth.

Images