# US 2017/0286567 A1 · Interactive Digital Drawing and Physical Realization

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2017/0286567 A1
- Document ID: US20170286567A1
- Status: Published application
- Kind: A1
- Application number: 15/628,387
- Filed: 2017-06-20
- Published: 2017-10-05
- Earliest claimed: 2013-10-10
- Inventors: Barbara Hana
- Web page: https://patentgrep.com/patent/US20170286567A1

## CPC

- G06T 17/20: Finite element generation, e.g. wire-frame surface description, {tesselation}
- B33Y 50/00: Data acquisition or data processing for additive manufacturing
- G06F 30/17: Mechanical parametric or variational design
- G06T 17/10: Constructive solid geometry [CSG] using solid primitives, e.g. cylinders, cubes
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- B33Y: ADDITIVE MANUFACTURING, i.e. MANUFACTURING OF THREE-DIMENSIONAL [3D] OBJECTS BY ADDITIVE DEPOSITION, ADDITIVE AGGLOMERATION OR ADDITIVE LAYERING, e.g. BY 3D PRINTING, STEREOLITHOGRAPHY OR SELECTIVE LASER SINTERING
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Inventive systems and methods for interactively producing 3D realizations of vector graphics are disclosed. A vector graphic primitive is defined and then used to construct more complex, composite vector graphics from which volume encompassing 3D printable meshes are generated. This 3D printable meshes are automatically converted into instructions for a 3D printer that then produces a physically realized object corresponding in shape and size to the composite vector graphic. In one embodiment, the composite vector graphic is a constructed using a predetermined growth algorithm that automatically generates a number of start-locations at which instantiations of the vector graphic primitive are produced. In a further embodiment, 3D lattice structures are produced using unit cells as vector graphic primitives and the vertices of a 3D lattice as the growth algorithms.

## Claims

### Claim at position 1

1: A method for producing a 3D printed object, comprising:
providing a 3D printer;
providing a digital computing device;
providing a drawing device;
using said drawing device to define a vector graphic primitive comprising a primitive type, a start point and an end point;
automatically generating a 3D printable mesh from said vector graphic primitive;
converting said 3D printable mesh into instructions readable by said 3D printer; and
printing said converted 3D printable mesh using said 3D printer, thereby creating said 3D printed object corresponding in shape to said vector graphic primitive.

### Claim at position 2 (depends on 1)

2: The method of claim 1, wherein, said primitive type is a user-input sketch, and further comprising said user selecting one or more object start locations in a current input plane; and, automatically generating an instantiation of said vector graphic primitive at each selected object start location.

### Claim at position 3 (depends on 2)

3: The method of claim 2, further comprising, said user selecting one of size randomization and a structural randomization, or a combination thereof; and wherein if size randomization is selected each instantiation of said vector graphic primitive generates a random-sized instantiation of said user-input sketch; and if structural randomization is selected, each instantiation of said vector graphic primitive generates a randomly-structured instantiation of said user-input sketch.

### Claim at position 4 (depends on 2)

4: The method of claim 2, further comprising a predetermined growth algorithm, and wherein said object start locations are selected according to said predetermined growth algorithm.

### Claim at position 5 (depends on 1)

5: The method of claim 1, wherein, said primitive type is a user-selected unit-cell, and further comprising:
said user selecting a predetermined growth algorithm;
automatically generating, using said predetermined growth algorithm, one or more object start-locations; and
automatically generating an instantiation of said vector graphic primitive at each selected object start-location, thereby creating a composite vector graphic.

### Claim at position 6 (depends on 5)

6: The method of claim 5, wherein, said user-selected unit-cell is a cube-shaped wire frame, said predetermined growth algorithm generates two or more vertices of a 3D lattice structure, said composite vector graphic is a wire-frame model of a 3D lattice, and said 3D printed object is a 3D printed lattice.

### Claim at position 7 (depends on 1)

7: The method of claim 1, wherein said graphic primitive is one of a convex polyhedron, a cube, a parallelepiped, a sphere, a diamond, a pyramid, and an ellipsoid; and wherein said 3D printable mesh is a polygonal mesh.

### Claim at position 8 (depends on 7)

8: The method of claim 7, wherein, said graphic primitive is selected to be a cube; said start point and end point are separated by a distance D; and further comprising automatically generating a first square and a second square, each having sides of length D defined by a set of four vertices; and automatically generating a set of vectors connecting all of said vertices, thereby defining said cube as said 3D printable mesh.

### Claim at position 9 (depends on 8)

9: The method of claim 8, wherein, a plane of each of said squares is orthogonal to a base vector joining said start point and said end point, the first square is centered on said start point, and said second square is centered on said end point, and each square has two sides that are perpendicular to an input plane in which said cube was selected.

### Claim at position 10 (depends on 7)

10: The method of claim 7, wherein, said graphic primitive is selected to be a sphere, said start point and end point are separated by a distance 2R and wherein said sphere is approximated by automatically dividing said distance 2R into N equal lengths, of size x=2R/N, and constructing polygons at each of the nodes created by said division, said polygons being in an orthogonal plane to a joining vector joining said start and end points, and being drawn on circles centered on said joining vector and having a radius equal to SQRT(2R·nx−nx·nx), where n represents which number node the polygon is being drawn at.

### Claim at position 11 (depends on 1)

11: The method of claim 1, wherein defining said vector graphic primitive, further comprises:
selecting a first 2D input plane using said drawing device;
defining said start point by an x and a y coordinate referenced with respect to said first 2D input plane;
selecting a second 2D input plane having a first angle of rotation with respect to said first 2D input plane;
defining said end point having an x and a y coordinate referenced with respect to said second 2D input plane;
converting said start and end points to a single 3D frame of reference having an x, a y and a z coordinate;
and defining a graphic primitive type, incorporating said converted start and end points.

### Claim at position 12 (depends on 11)

12: The method of claim 11, wherein said graphic primitive type is a user-input sketch and where said user-input sketch comprises one or more first plane points having x and y coordinates selected in said 1st 2D input plane, and one or more second plane points having x and y coordinates selected in said 2nd 2D input plane

### Claim at position 13 (depends on 12)

13: The method of claim 12, wherein, said drawing device comprises a 2D touch screen.

### Claim at position 14 (depends on 13)

14: The method of claim 13, wherein, said first angle of rotation is about an axis is selected from being parallel to, or having an orthogonal component to, said first 2D input plane.

### Claim at position 15 (depends on 12)

15: The method of claim 12, wherein, said drawing device comprises a virtual 2D input plane.
