The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jul. 19, 2022

Filed:

Mar. 28, 2019
Applicant:

Mitsubishi Electric Research Laboratories, Inc., Cambridge, MA (US);

Inventor:

Matthew Brand, Newton, MA (US);

Attorneys:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G05B 19/408 (2006.01); G05B 19/25 (2006.01); G05B 19/4093 (2006.01); G05B 19/4155 (2006.01); G05B 19/4103 (2006.01); G05B 19/4097 (2006.01);
U.S. Cl.
CPC ...
G05B 19/408 (2013.01); G05B 19/25 (2013.01); G05B 19/4097 (2013.01); G05B 19/40938 (2013.01); G05B 19/4103 (2013.01); G05B 19/4155 (2013.01);
Abstract

A data conversion system includes an interface to receive path data, a memory to store a computer-executable program including a lattice full algorithm and a dynamic programming algorithm, a processor, in connection with the memory, configured to execute the computer-executable program. The processor is configured to perform steps including providing a coordinate system including admissible points, forming, from the path data, a target polyline on the coordinate system, wherein the target polyline represents an approximated surface line of an object, dividing the target polyline into line segments, generating a set of rational vectors by approximating slopes of the line segments based on the lattice full algorithm, arranging the rational vectors to form lower convex hull lines arranged on or above corresponding line segments, wherein the lower convex hull lines are arranged onto the admissible points, wherein the admissible points are on or above the corresponding line segments, selecting a set of endpoints of the lower convex hull lines, and forming a final polyline by merging the endpoints based on the dynamic programming algorithm, wherein the final polyline is arranged to lay on or above the target polyline.


Find Patent Forward Citations

Loading…