Patent application number | Description | Published |
20080220395 | Design of Dental Appliances - Electronic models of components of dental appliances can be generated based on the outer surface of an electronic model of the dental appliance. The outer surface may be generated based on the dentition and anatomy of the patient. For example, automated processes may identify landmarks in the anatomy and define the outer surface based on the identified landmarks. Alternatively, the outer surface may be generated based on statistical data. A management system coordinates automated processes with interactive processes to facilitate collaboration of remotely located technicians and equipment in generating electronic models. | 09-11-2008 |
20090148816 | DESIGN OF DENTAL APPLIANCES - Electronic models of components of dental appliances can be generated based on the outer surface of an electronic model of the dental appliance. The outer surface may be generated based on the dentition and anatomy of the patient. For example, automated processes may identify landmarks in the anatomy and define the outer surface based on the identified landmarks. Alternatively, the outer surface may be generated based on statistical data. A management system coordinates automated processes with interactive processes to facilitate collaboration of remotely located technicians and equipment in generating electronic models. | 06-11-2009 |
20100185718 | PERFORMING PROCESS MIGRATION WITH ALLREDUCE OPERATIONS - Compute nodes perform allreduce operations that swap processes at nodes. A first allreduce operation generates a first result and uses a first process from a first compute node, a second process from a second compute node, and zeros from other compute nodes. The first compute node replaces the first process with the first result. A second allreduce operation generates a second result and uses the first result from the first compute node, the second process from the second compute node, and zeros from others. The second compute node replaces the second process with the second result, which is the first process. A third allreduce operation generates a third result and uses the first result from first compute node, the second result from the second compute node, and zeros from others. The first compute node replaces the first result with the third result, which is the second process. | 07-22-2010 |
20120291284 | Dental Prosthesis Manufacturing Aids - Dental prostheses may be manufactured based on electronic models of the prostheses. Manufacturing aids may be used to check manufacturing quality of the dental prosthesis and components thereof. For example, a jig may be used during and after the manufacture of the dental prostheses and systems and methods for using the same. A customized tooth die may be designed and fabricated to fit a dental prosthesis or components thereof in a jig for inspection. A customized jig may be designed and fabricated for inspecting a dental prosthesis or components thereof throughout the manufacturing process. | 11-22-2012 |
20150074993 | Dental Prosthesis Manufacturing Aids - Dental prostheses may be manufactured based on electronic models of the prostheses. Manufacturing aids may be used to check manufacturing quality of the dental prosthesis and components thereof. For example, a jig may be used during and after the manufacture of the dental prostheses and systems and methods for using the same. A customized tooth die may be designed and fabricated to fit a dental prosthesis or components thereof in a jig for inspection. A customized jig may be designed and fabricated for inspecting a dental prosthesis or components thereof throughout the manufacturing process. | 03-19-2015 |
Patent application number | Description | Published |
20080275683 | kD TREE AND ENVELOPE TO IMPROVE IDENTIFICATION OF NEAREST ATOMS - A method and apparatus for performing a molecular modeling simulation is disclosed. The simulation may be configured to store the position of atoms for a first and second molecule in a first and a second kd-tree. The simulation may also generate an envelope that contains all atoms of the second molecule, parse the kd-tree generated for the first molecule to identify atoms of the first molecule within the kd-tree of that are within the envelope. For each such atom, the simulation may search the kd-tree generated for the second molecule to identify corresponding nearest atom of the second molecule. | 11-06-2008 |
20080275685 | MISS-ACCUMULATION IN A BINARY SPACE PARTITIONING TREE - Embodiments of the invention provide a technique for improving the efficiency of a molecular modeling simulation. In one embodiment, the simulation may parse a kd-tree representing a receptor atom to identify atoms of the receptor within a specified distance of a target point. The target point may represent the center of a spherical envelope enclosing atoms of a ligand atom. A miss-accumulation vector may be used to accumulate a miss distance representing the minimum distance between a target point and a given node of the kd-tree. Thus, although the search algorithm may only evaluate the distance between the target point and a splitting dimension at each node of the kd-tree, the miss-accumulation vector may be used to account for distances over multiple dimensions. | 11-06-2008 |
20080275686 | ENVELOPE TECHNIQUE FOR EXCLUSION OF ATOMS IN AN HBOND CHECK - A technique for reducing the number of actions performed as part of a molecular modeling simulation is disclosed. For example, embodiments of the invention may be used to reduce the number of comparisons performed in a simulation of binding affinity between a first molecule (e.g., a protein receptor site) and a second molecule (e.g., a ligand). Because such a simulation is typically performed a very large number of times for even one particular first and second molecule, and is further performed for different combinations of first and second molecules, the effect of reducing the number of comparisons is leveraged and can provide a significant impact on overall simulation performance. | 11-06-2008 |