Disney Enterprises, Inc.

Ptc Inc.

Solidworks Corporation

Dassault Systemes Solidworks Corporation

Eth Zurich (eidgenoessische Technische Hochschule Zurich)

Onshape Inc.

Ilya Baran

Wojciech Matusik

Robert Walker Sumner

Nicholas J Eyre

Wojciech Jarosz

Ricardo Chin

Michael Holroyd

Robert P Zuffante

Michael R Lauer

John Sweeney

Philip Gareth Thomas

Parapura Rajkumar

Scott S Harris

Lana Saksonov

Rick Chin

Jason Davis Lawrence

Kevin Campanella

Louis V Gallo, Iii

Markus H Gross

Stelian Coros

Derek Nowrouzezahrai

Christopher N Ryan

Kenny Mitchell

Paul R Chastell

John Rousseau

Malay Kumar

Johannes Schmid

Jon K Hirschtick

Saul Rothstein

Daniel Vlasic

Linjie Luo

Andrew John Morris

Rammohan Vangapalli

Jiawen Chen

Frédo Durand

Marie-Paule Cani

Antoine Milliez

Steven C Hess

Karl Evan Nowak

Ravi Nallapareddy

Adriana Schulz

Disclosed is a parametric feature-based 3D CAD system that allows multiple users to simultaneously edit a parametric feature-based 3D CAD model consisting of 3D parts and assemblies of those parts (3D Model). Several CAD users, each using their own computer, phone, or tablet, can edit the same 3D Model at the same time. Editing may be separate and simultaneous—there is no need for users to worry about locking, checking out, or otherwise restricting each other's access to 3D Models. Within each user's editing interface, the model may be presented in different representations, with edits to any representation applied and displayed across all representations.

Multi-directional editing within a multi-user cloud parametric feature-based 3D CAD system

A method allows transferring references from vertices, edges, and faces of a solid or surface model to an edited model, by finding correspondences between vertices, edges, faces, and bodies of the models. The method begins by quickly finding matching bodies and aligning them, considering factors such as size, complexity, and the location of its vertices, edges, and faces. For every pair of matched bodies, it then matches exactly coincident vertices, edges, and faces. Of the remaining unmatched topology, it matches edges and faces in the new model that overlap those of the old model considerably. It uses near-neighbor structures to speed up the search for correspondences by eliminating old-new pairs of vertices, edges, and faces that do not overlap. Finally, it iteratively matches unmatched vertices, edges, and faces whose adjacent vertices, edges, and faces are in exact correspondence between the old and new models.

B-rep matching for maintaining associativity across CAD interoperation

Disclosed is a parametric feature-based 3D CAD system that allows multiple users to simultaneously edit a parametric feature-based 3D CAD model consisting of 3D parts and assemblies of those parts (3D Model). Several CAD users, each using their own computer, phone, or tablet, can edit the same 3D Model at the same time. Editing may be separate and simultaneous&#x2014;there is no need for users to worry about locking, checking out, or otherwise restricting each other's access to 3D Models. As a result, users see each other's changes occur in real-time, and may also identify what aspects other users are actively modifying through visible Collaboration Cues.

Multi-user cloud parametric feature-based 3D CAD system with bi-directional editing

Multi-user cloud parametric feature-based 3D CAD system with branch and merge

Multi-user cloud parametric feature-based 3D CAD system

The disclosure provides a technique for recursively partitioning a 3D model of an object into two or more components such that each component fits within a predefined printing volume. The technique includes determining a set of planar cuts each of which partitions the 3D model into at least two components, evaluating one or more objective functions for each cut in the set of planar cuts, and selecting a cut from the set of planar cuts based on the evaluations of the objective functions. In addition, the technique includes, upon determining that a component resulting from the selected cut does not fit within the predefined printing volume, further partitioning that component.

Partitioning models into 3D-printable components

The disclosure provides an approach for determining, in 3D rendering, the integrals of visibility-masked spherical functions using visibility silhouettes. For a given shade point, the visibility silhouette for that shade point includes a set of edges from the scene geometry which form the boundaries between visible and invisible regions of a hemisphere having the shade point as its center. For each shade point, a rendering application determines a set of contour edges of scene geometry, the contour edges being a superset of the set of visibility silhouette edges, by querying a 4D dual mesh. The rendering application then evaluates the integral of the visibility-masked spherical function for a given shade point by integrating over segments of discrete u-isolines for which an overlap function indicates that a ray from the shade point would not intersect scene geometry.

Visibility silhouettes for masked spherical integration

Rendering a scene with participating media is done by generating a depth map from a camera viewpoint and a shadow map from a light source, converting the shadow map using epipolar rectification to form a rectified shadow map (or generating the rectified shadow map directly), generating an approximation to visibility terms in a scattering integral, then computing a 1D min-max mipmap or other acceleration data structure for rectified shadow map rows and traversing that mipmap/data structure to find lit segments to accumulate values for the scattering integral for specific camera rays, and generating rendered pixel values that take into account accumulated values for the scattering integral for the camera rays. The scattering near an epipole of the rectified shadow map might be done using brute force ray marching when the epipole is on or near the screen. The process can be implemented using a GPU for parallel operations.

Rendering images with volumetric shadows using rectified height maps for independence in processing camera rays

Rendering 3D paintings can be done by compositing brush strokes embedded in space. Image elements are rendered into an image representable by a pixel array wherein at least some of the image elements correspond to simulated painting strokes. A method may include determining stroke positions in a 3D space, determining stroke orders, and for each pixel to be addressed, determining a pixel color value by determining strokes intersections with a view ray for that pixel, determining a depth order and a stroke order for intersecting fragments, each fragment having a color, alpha value, depth, and stroke order, assigning an intermediate color to each of the fragments, corresponding to a compositing of nearby fragments in stroke order, and assigning a color to the pixel that corresponds to a compositing of the fragments using the intermediate colors assigned to the fragments. The compositing may be done in depth order.

Mixed-order compositing for images having three-dimensional painting effects

Metabrushes for digital painting (such as 3D painting) are provided. Metabrushes may be defined by 3D paint strokes embedded on an elementary piece of geometry. Paint strokes are replicated in 3D over a user's painting gesture, allowing a fast embedding of numerous strokes using only a few user input gestures. Hierarchical metabrushes are further provided for providing faster and more diverse creation of digital paintings.

Metabrushes for digital painting

A set of two-dimensional layers is determined based on a digital three-dimensional model. An image corresponding to each of the layers is rendered on each of a corresponding number of sheets of at least partially transparent material. The sheets of material are assembled together to produce a three-dimensional structure corresponding to the digital model.

System and method for producing three-dimensional multi-layer objects from digital models

Deforming a three-dimensional computer-generated model to cause a change of shape of the three-dimensional model includes representing a surface of the model using a surface representation initially comprised of an original surface definition, deriving smooth three-dimensional mapping functions where each mapping function defines a deformation to the surface and at least one mapping function is non-affine, constructing a composition of the mapping functions and the original surface definition where each mapping function is included in the composition in succession in accordance with the order of derivation, and applying the composition after each successive mapping function is included in the composition causing the surface of the three-dimensional model to be deformed while preserving the smoothness to the lowest degree of smoothness of the mapping functions.

Deformation of a computer-generated model

Provided herein is a computer-based system for viewing a two-dimensional electronic drawing, including processes for pointing to similar components in different views, animation of views, hyperlinking components between views and virtual folding of an electronic drawing.

Electronic drawing viewer

Modeling of a three-dimensional object includes storing data representing a computer model of the three-dimensional object. The data includes a number of feature objects each of which defines a feature of the computer model. A feature chain is formed and includes at least one feature object having a design effect limited in scope such that an operation for removing material operates to affect the feature of the computer model defined by another feature object in the same feature chain and does not affect the feature of the computer model defined by the feature object not in said same feature chain. Multiple feature chains can be combined to form an interrelationship among feature objects that represents a hierarchy defining construction of the model from the feature objects.

Model management technology using grouping of features

Growing community of inventors

Cambridge, MA, United States of America

Ilya Baran