Autodesk, Inc.

Massachusetts Institute of Technology

Jonathan Bachrach

Saul Thomas Griffith

Martin Wicke

Tucker Gilman

Geoffrey Irving

Keith Pasko

Daniel Benoit

Samuel Eli Calisch

Sam Calisch

Jacob S Beal

Embodiments disclosed herein provide systems and methods for preparing geometry for 3D printing. In one embodiment, a 3D printing preparation application receives 3D geometry and repairs non-manifold edges and non-manifold vertices, producing a topological manifold geometry. The 3D printing preparation application then welds coincident edges without coincident faces and fills holes in the geometry. The 3D printing preparation application may further perform resolution-aware thickening of the geometry by estimating distances to a medial axis based on distances to distance field shocks, and advecting the distance field using a velocity field. A similar approach may be used to perform resolution-aware separation enforcement. Alternatively, one component may be globally thickened and subtracted from another for separation enforcement. The 3D printing preparation application may also split large models and add connectors for connecting the split pieces after printing. In addition, the 3D printing preparation application may generate a 3D print preview.

Three-dimensional printing preparation

One embodiment of the invention is a slicing engine that generates two or more slices of a virtual 3D model given a slice plane. The slicing engine then determines connection points on each of the slices that indicate how the 3D model is to be reconnected by the user when the 3D model is fabricated. The slicing engine also determines an optimized layout for the various slices of the 3D model on fabrication material for minimal use of the material. The user is then able to 'print' the layout on the fabrication material via 3D printers, and connect the various printed slices according to the connection points to build a physical representation of the 3D model.

Techniques for slicing a 3D model for manufacturing

Embodiments of the invention provide systems and methods for nesting objects in 2D sheets and 3D volumes. In one embodiment, a nesting application simplifies the shapes of parts and performs a rigid body simulation of the parts dropping into a 2D sheet or 3D volume. In the rigid body simulation, parts begin from random initial positions on one or more sides and drop under the force of gravity into the 2D sheet or 3D volume until coming into contact with another part, a boundary, or the origin of the gravity. The parts may be dropped according to a particular order, such as alternating large and small parts. Further, the simulation may be translation- and/or position-only, meaning the parts do not rotate and/or do not have momentum, respectively. Tighter packing may be achieved by incorporating user inputs and simulating jittering of the parts using random forces.

Nesting using rigid body simulation

A system for generating a three-dimensional puzzle comprises a processor and a memory. The processor is configured to generate a three dimensional mesh representation. The processor is further configured to convert polygons comprising the three-dimensional mesh representation to one or more puzzle piece representations. The processor is further configured to add attachment points and receiving points to the one or more puzzle piece representations. The processor is further configured to provide the one of more puzzle piece representations with attachment points and receiving points. The memory is coupled to the processor and configured to provide the processor with instructions.

3D puzzle generation, algorithms for generation, and physical instantiations

Techniques for two-way slicing of a 3D model for manufacturing

Embodiments disclosed herein provide techniques for decomposing 3D geometry into developable surface patches and cut patterns. In one embodiment, a decomposition application receives a triangulated 3D surface as input and determines approximately developable surface patches from the 3D surface using a variant of k-means clustering. Such approximately developable surface patches may have undesirable jagged boundaries, which the decomposition application may eliminate by generating a data structure separate from the mesh that contains patch boundaries and optimizing the patch boundaries or, alternatively, remeshing the mesh such that patch boundaries fall on mesh edges. The decomposition application may then flatten the patches into truly developable surfaces by re-triangulating the patches as ruled surfaces. The decomposition application may further flatten the ruled surfaces into 2D shapes and lay those shapes out on virtual sheets of material. A person, or machinery, may cut out those shapes from physical sheets of material based on the layout.

Decomposition of 3D geometry into developable surface patches and 2D cut patterns

Techniques are described for decomposing three-dimensional (3D) geometry into an assemblable collection of two-dimensional (2D) panels. Importantly, the 3D geometry is automatically encoded into the 2D panels, allowing the 3D geometry to be recreated simply by joining the 2D panels at the appropriate seams and creating the appropriate bends/folds in each panel. Further, each panel has edges, vertices, and faces which can be encoded in the panelization, allowing assembly instructions to be algorithmically generated, Doing so allows users to be provided with a step-by-step instructions carried out to realize the 3D geometry encoded in the 2D panels.

Surfacing algorithm for designing and manufacturing 3D models

A system for generating a three-dimensional puzzle comprises a processor and a memory. The processor is configured to generate a three dimensional mesh representation. The processor is further configured to convert polygons comprising the three-dimensional mesh representation to one or more puzzle piece representations. The processor is further configured to add attachment points and receiving points to the one or more puzzle piece representations. The processor is further configured to provide the one or more puzzle piece representations with attachment points and receiving points. The memory is coupled to the processor and configured to provide the processor with instructions.

To manage energy demands of a plurality of appliances, a meter controller apparatus receives a first message from a first appliance controller apparatus coupled to a first appliance of the plurality of appliances. The first message comprises first information regarding a first power demand of the first appliance and a first demand category associated with the first appliance, wherein the first demand category is one of a plurality of demand categories. The meter controller apparatus computes an updated meter controller model for the plurality of appliances based at least in part on the first message received from the first appliance controller apparatus and a present meter controller model for the plurality of appliances.

Methods and apparatus for energy demand management

Methods, apparatuses and systems for managing energy demand of one or more appliances. In one example, an appliance controller apparatus is provided, comprising a user interface configured to receive a user input indicative of a demand flexibility associated with an appliance, a communication interface configured to receive a control input indicative of a request to modify a power demand of the appliance, and a processor programmed to determine whether the power demand of the appliance is to be modified based on the user input and the control input. In a further aspect, a meter controller apparatus is provided, comprising a communication interface configured to receive a message from an appliance controller apparatus coupled to an appliance, the message comprising information regarding a power demand of the appliance and a demand category associated with the appliance. The meter controller apparatus may further comprise a processor programmed to compute an updated meter controller model based on the message received from the appliance controller apparatus and a present meter controller model.

Growing community of inventors

Berkeley, CA, United States of America

Jonathan Bachrach