patent.fyi
Applications  /  US 2026/0354935
United States Patent Application Publication

US 2026/0354935 A1

Published
Nov 12, 2026
Filed
Jul 7, 2026
Earliest date on the face
Oct 3, 2022
Classification
A61C 7/002
First published here
Nov 19, 2026

Generated automatically. Not reviewed by a person. Not legal advice or an opinion.

Section 1 · machine-generated

What if?

Questions about how individual parts of claim 1 might be changed. A question may describe something different from what the claim language recites, or a version of it; no view is offered on which.

1.1Check each operation in place

What ifWhat if each planning operation runs its quality checks on its own working data before it saves the result?
Claim language“receiving an output workflow”

The tooth positioning routine computes contact depth and crown displacement directly from its working meshes before saving each stage. If a check fails, the routine keeps the last accepted stage and records the affected tooth and measurement.

1.2Check mesh connectivity

What ifWhat if the routing check uses a mesh connectivity rule to identify defective appliance surfaces?
Claim language“a range of acceptable parameter values”

A half-edge mesh links adjacent triangles through paired edges. The checker traverses the links and routes the case for surface repair if it finds an exposed edge away from the intended trim boundary.

1.2Calculate limits from scan uncertainty

What ifWhat if the routing module computes its contact tolerance from the current scan and registration data?
Claim language“accesses a database of acceptable parameter values”

The module estimates local surface uncertainty from overlapping scan patches and combines that estimate with the registration residual. It flags predicted interpenetration whose depth exceeds three times the combined uncertainty.

1.3Verify flags against scan data

What ifWhat if the verifier clears a flagged contact by independently measuring the planned surfaces against the original scan data?
Claim language“a review of the patient-specific prescription”

The verifier reconstructs the two tooth surfaces from the original scan and applies the planned rigid-body transforms. It clears the flag if a fresh contact calculation places the separation within the configured tolerance.

1.3Encode instructions in structured fields

What ifWhat if the prescription stores treatment instructions as tooth identifiers, operation codes, and numeric fields?
Claim language“dental treatment instructions in a natural language text”

A prescription form stores a tooth identifier, a movement type, a signed target in millimeters or degrees, and an allowed deviation. The verifier compares a flagged measurement with the authorized deviation for that tooth and movement type.

Section 2 · machine-generated

Variations

Further arrangements of the same subject matter, described here as of the publication date at the foot of this page.

Other field of use

Inspection routing for sheet metal bending

A fabrication planner generates a bend sequence from a digital part model and a job sheet containing written fabrication instructions. An inspection module compares each planned bend angle and inside radius with limits stored by material grade and sheet thickness. A reviewer checks each flagged value against the job sheet and records whether the instructions specify that value for the affected bend. The routing module sends bends with unresolved flags to a fabrication planner for manual sequencing.

Component substitution

Interval tree for parameter range checks

A versioned configuration file and an in-memory interval tree replace the database used for acceptable parameter values. At startup, the routing service loads one tree per measurement type and dentition group, with each interval expressed in the same units as the output measurements. The service queries the corresponding tree for each value and sends values outside all stored intervals to a reviewer who reads the prescription text. The service transmits a manual processing task for each affected step with an unresolved flag.

Digital caliper capture for model verification

A digital caliper replaces software-derived linear measurements during quality checks on printed dental models. An operator scans the model identifier, selects the prescribed landmark pair in a capture interface, and transfers the reading from the caliper over a wired serial link. The post-routing module compares the stored reading with the range for that landmark pair and opens the prescription text alongside each flagged reading. The dispatch service sends a manual model preparation task when a flagged reading has no documented prescription exception.

Parameter or scale variation

Timed review of queued measurements

A queue groups completed dental workflow outputs into batches of up to 50 cases and releases a batch when it fills or the oldest case has waited 30 seconds. The post-routing worker loads one version of the range table per batch and compares each measured value with its corresponding limits. Each flagged measurement opens a review task containing the case identifier, tooth identifier, value, and prescription text. When review closes, the dispatcher sends one manual processing indicator per affected step and includes all unresolved flags for that step.

Combination with existing systems

Routing through a dental laboratory system

A dental laboratory information system assigns a case identifier and stores the prescription text alongside the digital dental model. When processing completes, the planning service returns measured values indexed by case, processing step, and tooth, and the routing service compares those values with its stored limits. The laboratory interface presents flagged measurements beside the prescription so a reviewer can record any instruction that accounts for the measured value. The laboratory system places each affected step with an unresolved flag into the manual work queue under the same case identifier.

Automated or data-driven variant

Geometry checks from staged dental meshes

An automated measurement worker receives segmented tooth meshes and the rigid transform of each tooth at each planning stage. For each tooth, it computes translation at the mesh centroid and rotation from the relative transform between consecutive stages, then returns tooth and stage identifiers with the measurements. The routing service compares the measurements with stored limits by tooth class and presents flagged stages alongside the prescription text for review. The dispatcher sends a manual planning task for each flagged stage whose measurement has no recorded prescription exception.

Specific version of a part

Receive a staged model bundle

The receiving module accepts a bundle containing the source scan identifier, per-tooth surface meshes, and a rigid-body transform for each tooth at each treatment stage. A manifest links the bundle to the submitted prescription and identifies the processes that generated it.

Look up stage movement limits

The post-routing module queries a relational database for lower and upper movement bounds keyed by tooth class and movement type. It computes the movement between consecutive stages and flags values that fall outside the retrieved bounds.

Parse written movement exceptions

A text parser extracts the tooth identifier, movement direction, numeric value, and unit from a written instruction authorizing a specific movement. The verifier records an exception when the flagged movement matches the tooth and direction and falls within the amount explicitly authorized.

Send a manual correction task

When a measurement falls outside its bounds and the verifier finds no exception, the routing service sends a task to the manual planning queue. The task identifies the case, affected tooth and stage, measured value, and process to perform manually.

Section 3 · quoted from USPTO records

Other work

Passages reproduced word for word from two earlier-published U.S. patent documents, placed beside the language of claim 1. No characterization is offered. Each passage is marked A or B for the document it comes from; ¶ numbers are the paragraph numbers in the USPTO’s published full text of that document.

Document AUS 2022/0061959 A1
Published
Mar 3, 2022
Filed
Dec 23, 2019
Class
A61C 7/002
Document BUS 11,314,632 B2
Published
Apr 26, 2022
Filed
Oct 29, 2020
Class
G06F 11/3692
Claim 1
Document A
Document B
1.1receiving an output workflow that was generated by performing one or more processes on a digital dental model based on the patient-specific prescription;
In these examples, processing circuitry 4 may select from a group of final setup generation algorithms, which it can then use to generate a final setup and coordinating intermediate setups for the patient which address the particular needs dictated in the prescription.
A · US 2022/0061959 A1 · ¶ 49
1.2determining in a post-routing module if the output workflow contains one or more parameter values having a value that is outside of a range of acceptable parameter values, wherein the post-routing module accesses a database of acceptable parameter values;
As examples, clinician 16 may leverage the data analysis capabilities shown in block 36 to learn about metrics or orthodontic scores to determine whether the metrics/scores are within acceptable ranges, or to identify one or more teeth in need of improvement.
A · US 2022/0061959 A1 · ¶ 71
1.3determining in a false-positive verification module if the one or more parameter values that is outside of the range of acceptable parameter values is an exception based on a review of the patient-specific prescription. wherein the patient-specific prescription comprises a set of dental treatment instructions in a natural language text; and
The method further includes identifying, by the one or more hardware processors, a plurality of false positives from the set of delta alarms, wherein identifying the plurality of false positives comprises: generating an assertion for each the delta alarms from amongst the set of delta alarms; generating at least one annotated code based on an annotation technique, wherein each of the annotated code comprises at least one assertion; pre-processing each of the annotated code ba
B · US 11,314,632 B2 · ¶ 7
1.4transmitting an indicator to manually perform the one or more processes if the post-routing module determined that one or more parameter values was outside of the range of acceptable parameter values and if the false-positive verification module did not identify the exception.
Alternatively, in some examples, the technician may use the prescription received from processing circuitry 4 to manually generate the final setup, in addition to or instead of relying on the final setup generator.
A · US 2022/0061959 A1 · ¶ 50

An empty cell means only that no passage was reproduced there.

Statements in these documents
The goal of the orthodontic treatment planning process is to determine where the post-treatment positions of a person's teeth (setup state) should be, given the pre-treatment positions of the teeth in a malocclusion state.
A · US 2022/0061959 A1 · ¶ 2
While this disclosure describes numerous examples with reference to orthodontic treatment, the systems of this disclosure may implement the described techniques with respect to other types of dental treatments, as well.
A · US 2022/0061959 A1 · ¶ 3
However, even after the suppression of repeated alarms, the existing version-aware static analysis techniques still report many alarms, thus making the identification of false positives challenging.
B · US 11,314,632 B2 · ¶ 5
The method further includes eliminating, by one or more hardware processors, the false positives from the set of delta alarms to obtain a set of delta alarms remaining after the elimination and displaying the remaining delta alarms on a report display screen, wherein the displaying includes reporting the delta alarms remaining after the elimination of the false positives.
B · US 11,314,632 B2 · ¶ 7
Cite aspatent.fyi, US 2026/0354935 A1, claim 1, first published 2026-11-19T06:07:06-05:00, https://patent.fyi/US20260354935/, SHA-256 4a33af3fb7acce17413460c7068f973080a4e6204278bddedb102b950cfeabb0
First published
Permanent addresshttps://patent.fyi/US20260354935/
Content fingerprint (SHA-256)4a33af3fb7acce17413460c7068f973080a4e6204278bddedb102b950cfeabb0
Methodv2026-11-18.2 · automated, not reviewed by a person
Correctionscorrections@patent.fyi