Systems and methods for compressing 3d printer data

US2020364907A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2020364907-A1
Application numberUS-201916413048-A
CountryUS
Kind codeA1
Filing dateMay 15, 2019
Priority dateMay 15, 2019
Publication dateNov 19, 2020
Grant date

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Two dimensional layer data representing successive layers of objects to be 3D-printed is reduced in size to reduce storage requirements and transmission bottlenecks that increase costs and reduce the efficiency of 3D printers, by encoding the layer data in accordance with systems and methods that take into account 2D and 3D regularities inherent in such layer data, and allow for efficient and lossless reconstruction of the original 3D layer data when it is needed by the 3D printer.

First claim

Opening claim text (preview).

What is claimed: 1 . A method for reducing the amount of data required by a 3D printer to print an object, said data including a plurality of bitmap layers each comprising a 2D array of pixels representing a cross sectional layer of the object, wherein said method includes the steps of: a) forming a first differential bitmap representing differences between corresponding pixels of a bitmap layer and an adjacent bitmap layer; and b) forming a second differential bitmap representing the differences between corresponding pixels in adjacent rows or columns of the first differential bitmap. 2 . The method of claim 1 , wherein the first differential bitmap is formed by computing a bitwise XOR between corresponding pixels of the bitmap layer and the adjacent bitmap layer. 3 . The method of claim 1 , wherein the second differential bitmap is formed by computing a bitwise XOR operation between corresponding pixels in adjacent rows or columns of the first differential bitmap. 4 . The method of claim 3 , further comprising the step of quadtree tiling the second differential bitmap to form a quadtree bitmap and a quadtree tile array. 5 . The method of claim 4 , wherein the quadtree tile array includes pixel values of tiles having one or more non-zero pixels. 6 . The method of claim 4 wherein the quadtree bitmap represents tiles having one or more non-zero pixels by a pixel of value 1, and tiles having all zero pixels by a pixel value of 0. 7 . The method of claim 4 wherein the quadtree tile array and quadtree bit map are entropy coded. 8 . An encoding method for reducing the amount of data required by a 3D printer to print an object, said data including a plurality of bitmap layers, each comprising a 2D array of pixels representing a cross sectional layer of the object, wherein said method includes the steps of: a) forming a first differential bitmap representing the differences between adjacent rows of a first bitmap layer; b) forming a second differential bitmap representing the differences between adjacent rows of a second bitmap layer; and c) forming a third differential bitmap representing the differences between the first and second differential bitmaps. 9 . The method of claim 8 wherein the first differential bitmap layer is formed by computing the bitwise XOR between corresponding pixels in adjacent rows of the first bitmap layer. 10 . The method of claim 8 wherein the second differential bitmap layer is formed by computing the bitwise XOR between corresponding pixels in adjacent rows of the second bitmap layer. 11 . The method of claim 8 wherein the third differential bitmap layer is formed by computing the bitwise XOR between corresponding pixels of the first and second differential bitmaps. 12 . The method of claim 8 , further comprising the steps of quadtree tiling the third differential bitmap to form a quadtree bitmap and a quadtree tile array. 13 . The method of claim 12 , wherein the quadtree bitmap and quadtree tile array are entropy coded. 14 . The method of claim 1 , further comprising the step of forming a third differential bitmap representing the differences between adjacent columns of the first differential bitmap layer. 15 . A method of compressing data corresponding to a plurality of bitmap layers each comprising a 2D array of pixels, comprising the steps of: a) forming a first differential bitmap representing differences between adjacent bitmap layers, b) forming a second differential bitmap representing differences between adjacent rows or columns of the first differential bitmap, and c) quadtree tiling the second differential bitmap to form a quadtree bitmap and a quadtree tile array. 16 . The method of claim 15 , further including the step of entropy coding the quadtree tile array and quadtree bit map. 17 . A method of compressing data corresponding to a plurality of bitmap layers each comprising a 2D array of pixels, comprising the steps of: a) forming a first differential bitmap representing differences between adjacent rows of a first bitmap layer, b) forming a second differential bitmap representing differences between adjacent rows of a second bitmap layer, c) forming a third differential bitmap representing the differences between the first and second differential bitmaps, and d) quadtree tiling the second differential bitmap to form a quadtree bitmap and a quadtree tile array. 18 . The method of claim 17 , further including the step of entropy coding the quadtree tile array and quadtree bit map. 19 . A method of decompressing data compressed in accordance with claim 16 , said method decompressing a bitmap layer back to its original content by performing the steps of: a) reversing the entropy coding to reconstruct the quadtree tile array and quadtree bit map; b) using the reconstructed quadtree tile array and quadtree bit map to reconstruct the second differential bitmap, c) using the second differential bitmap to reconstruct the first differential bitmap; and d) using the first and second differential bitmaps to reconstruct the bitmap layer. 20 . A non-transitory computer-readable medium that stores program instructions capable of being executed by a processor to perform the steps of claim 15 . 21 . A non-transitory computer-readable medium that stores program instructions capable of being executed by a processor to perform the steps of claim 19 .

Assignees

Inventors

Classifications

  • Image coding (bandwidth or redundancy reduction for static pictures H04N1/41; coding or decoding of static colour picture signals H04N1/64; methods or arrangements for coding, decoding, compressing or decompressing digital video signals H04N19/00) · CPC title

  • G06T9/40Primary

    Tree coding, e.g. quadtree, octree · CPC title

  • Process efficiency · CPC title

  • Data acquisition or data processing · CPC title

  • B29C64/386Primary

    Data acquisition or data processing for additive manufacturing · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US2020364907A1 cover?
Two dimensional layer data representing successive layers of objects to be 3D-printed is reduced in size to reduce storage requirements and transmission bottlenecks that increase costs and reduce the efficiency of 3D printers, by encoding the layer data in accordance with systems and methods that take into account 2D and 3D regularities inherent in such layer data, and allow for efficient and l…
Who is the assignee on this patent?
Desktop Metal Inc
What technology area does this patent fall under?
Primary CPC classification G06T9/40. Mapped technology areas include Physics.
When was this patent published?
Publication date Thu Nov 19 2020 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).