Abstract:
A computer-implemented method of machine-learning including obtaining a dataset of 3D point clouds. Each 3D point cloud includes at least one object. Each 3D point cloud is equipped with a specification of one or more graphical user-interactions each representing a respective selection operation of a same object in the 3D point cloud. The method further includes teaching, based on the dataset, a neural network configured for segmenting an input 3D point cloud including an object. The segmenting is based on the input 3D point cloud and on a specification of one or more input graphical user-interactions each representing a respective selection operation of the object in the 3D point cloud.
Abstract:
The invention notably relates to a memory storage having a linear track and having recorded thereon a multi-resolution image system of an object, the multi-resolution image system including a set of images, each image representing the object and having a respective resolution, wherein the recording is according to a continuous injection from a space-filling curve of the set of images to the linear track, the space-filling curve interlaces the different images, and the intersection between the space-filling curve and each image is on a Hilbert curve.The invention improves the way to record a multi-resolution image system of an object on a memory storage.
Abstract:
Described is a computer-implemented method for partitioning a 3D scene into a plurality of zones, each zone representing an area or a volume of the 3D scene and being processed by a computing resource. The method comprises obtaining a 3D scene comprising one or more objects, each object generating a computing resource cost, computing a first map that represents a density of computing costs of the provided 3D scene, defining a second map that represents constraints on the shapes of zones that will be obtained as a result of a partitioning of the 3D scene, discretizing the obtained 3D scene into cells by computing a space quantization of the 3D scene free of dynamic objects, computing, for each cell, a computing cost from the first map of the 3D scene, aggregating the cells into one or more zones in accordance with the second map.
Abstract:
The invention notably relates to a computer-implemented method for designing a 3D assembly of modeled objects. The method comprises rendering on a second computer a 3D assembly of modeled objects by merging a second 3D modeled object with at least one raster image of a first 3D modeled object, the at least one raster image having being streamed from a first computer to the second computer; sending from the second computer to the first computer first data related to the second 3D modeled object for contact computation between the first and second 3D modeled objects; and computing on the first computer a contact between the first and second 3D modeled objects.
Abstract:
The invention notably relates to a computer-implemented method for compressing a three-dimensional modeled object. The method comprises providing a mesh of a three-dimensional modeled object, parameterizing (u,v) the mesh on a two-dimensional plane, converting the parameterized mesh into an image I, defining a grid of cells from the image I, each cell being defined by a set of control points, computing a relevance of each cell of the grid, determining at least one cell having a relevance lower than a pre-determined threshold, resizing the at least one determined cell and computing a resulting grid, computing a transformation for each pixel of the image from the resulting grid, and applying the computed transformation to the image I.
Abstract:
The invention is directed to a computer-implemented method for partitioning a three-dimensional scene into a plurality of zones, each zone being processed by a computing resource. The method comprises providing a three-dimensional scene comprising one or more objects, each object generating a computing resource cost; determining a set of locations in the three-dimensional scene; filling each location with its maximum occupancy of objects that reaches the most expensive computing cost; computing, for each location of the three-dimensional scene, the maximum computing cost density; and grouping adjacent locations into one or more zones, each zone having a resulting computing cost density guarantying a real-time performance of the zone.
Abstract:
It is proposed a computer-implemented method for simulating an assembly of fabric pieces. The method comprises providing a plurality of parallel solvers, a first solver simulating at least one first fabric piece and a second solver simulating at least one second fabric piece, and maintaining the first and the second fabric pieces tight by computing a common frontier by the first and second solvers.