WO2014009568A1 - Procédé, système et produit-programme d'ordinateur pour manipuler des mailles ayant plusieurs dimensions référencées en tant que hors-cœur - Google Patents

Procédé, système et produit-programme d'ordinateur pour manipuler des mailles ayant plusieurs dimensions référencées en tant que hors-cœur Download PDF

Info

Publication number
WO2014009568A1
WO2014009568A1 PCT/EP2013/064951 EP2013064951W WO2014009568A1 WO 2014009568 A1 WO2014009568 A1 WO 2014009568A1 EP 2013064951 W EP2013064951 W EP 2013064951W WO 2014009568 A1 WO2014009568 A1 WO 2014009568A1
Authority
WO
WIPO (PCT)
Prior art keywords
resolution
mesh
data
dimensions
low
Prior art date
Application number
PCT/EP2013/064951
Other languages
English (en)
Inventor
Leonardo Hidd Fonteles
Anis MEFTEH
Marc Antonini
Original Assignee
Université de Nice-Sophia Antipolis
Le Centre National De La Recherche Scientifique
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Université de Nice-Sophia Antipolis, Le Centre National De La Recherche Scientifique filed Critical Université de Nice-Sophia Antipolis
Publication of WO2014009568A1 publication Critical patent/WO2014009568A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G06T17/20—Finite element generation, e.g. wire-frame surface description, tesselation
    • G06T17/205—Re-meshing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2210/00—Indexing scheme for image generation or computer graphics
    • G06T2210/36—Level of detail

Definitions

  • the present invention relates to the field of bulky meshes with several dimensions, referred to as out-of-core, such as three-dimensional (3D) meshes and, more specifically, the manipulation of these bulky meshes, particularly in order to display these bulky meshes.
  • out-of-core such as three-dimensional (3D) meshes
  • out-of- core such as three-dimensional (3D) meshes
  • 3D three-dimensional
  • 3D three-dimensional
  • This volume of data can be stored on a hard disc of a user's personal computer.
  • this volume of data presents technical problems during manipulation, i.e. during the display or the use of the corresponding bulky 3D meshes.
  • the random access memory of the graphics card of a personal computer can contain some tens of millions of polygons. Consequently, insofar as the bulky 3D meshes comprise more than one billion polygons, these meshes are too substantial for a personal computer to be able to store all of the data regarding these meshes in the random access memory of the graphics card.
  • the solutions used, in particular, to display such bulky 3D meshes consist in using powerful remote servers, called render servers. Thus, these render servers can store an entire bulky 3D mesh in their random access memory.
  • the user When a user wishes to display the bulky 3D mesh on his personal computer, the user must send a request from his personal computer via the internet network in order to communicate with the render server.
  • the request comprises a display request pertaining to a bulky 3D mesh.
  • the render server then loads, into its random access memory, the bulky 3D mesh associated with the 3D object and performs the calculations necessary in order to respond to the user's request.
  • the render server transmits a two- dimensional (2D) version, i.e. a 2D image of the 3D object, to the user's personal computer.
  • the two-dimensional version of the 3D object comprises a volume of data which is much smaller than the volume of data pertaining to the bulky 3D mesh.
  • the user's personal computer can store in its random access memory the data pertaining to the two-dimensional version of the bulky 3D mesh in order to allow the user to manipulate these data.
  • the user manipulates only the two-dimensional version of the 3D object.
  • the user cannot directly access the 3D data pertaining to the 3D object in order to perform processing of these data. Consequently, each modification of the 2D image generated by the manipulation by the user is automatically transmitted to the render server in order to apply to the bulky 3D mesh the changes arising from the modifications.
  • Each manipulation therefore corresponds to the transmission of a request to the render server, which greatly limits the interactivity between the user and the bulky 3D mesh.
  • the response time of the render server is extremely variable.
  • the response times of the render server, for each request depend upon the transmission delay associated with the network and on the calculation time associated with each request.
  • certain users must be subject to a waiting time which is sometimes restrictive before accessing on their personal computer the 2D image as recalculated and transmitted by the render server.
  • the document US 6,933,946 describes a method which consists in cutting the 3D object into a mesh comprising an assembly of 3D subcubes.
  • Such an assembly comprises a volume of data compatible with the storage capacities of the random access memory of a graphics card.
  • the totality of the data pertaining to these subcubes is organised into a tree structure with nodes for increasing the speed of access to the data.
  • Each node of the tree contains information describing the corresponding cubic cells.
  • the method also comprises steps of predicting the object's movements, based on the interaction with the user. Thus, zones likely to be displayed are pre-loaded into the random access memory of the graphics card to accelerate the displaying speed.
  • the loading and the navigation are associated with the volume of the 3D object and not with the surface of the 3D object insofar as the mesh is cut into cubic cells.
  • the polygons contained in each subcube are loaded into the random access memory of the graphics card, even if only some of the polygons are in the visible zone. Indeed, another group of these polygons is not visible either because the polygons are out of the field of vision or situated facing away from the camera.
  • the tree cutting considerably increases the number of polygons in the starting mesh. By way of example, in the document US 6,933,946, the number of polygons in the mesh considered increases from 13 million to 100 million.
  • the movement prediction step slows the display of the mesh when the movement effectively carried out by the user is different from the predicted movement.
  • the aim of the present invention is to propose a method, a data manipulation system and a computer program product which make it possible to overcome at least any aforementioned disadvantages.
  • a first object of the invention relates to a method for manipulating a high-resolution first mesh with n dimensions representing an object with n dimensions and comprising a first volume of data associated with first indices, said method comprising the following steps:
  • said generation step comprising a merging step for generating a double-resolution mesh in order to link the data of the high- resolution first mesh with n dimensions and the data of the low-resolution second mesh with n dimensions by means of relationships of correspondence.
  • the method comprises a selecting step to reduce the number of data within the low-resolution second mesh in order to select the pertinent data relative to the data pertaining to the predetermined zone.
  • the method comprises a displaying step to display the submesh of the high-resolution first mesh pertaining to the predetermined zone.
  • a second object of the invention relates to a system for manipulating a high- resolution first mesh with n dimensions representing an object with n dimensions and comprising a first volume of data associated with first indices, said system comprising: - an indexing component for determining the first indices of the relationships of correspondence between the data pertaining to the high-resolution first mesh and the data pertaining to a low-resolution second mesh with n dimensions;
  • a merging component for combining the data pertaining to the low-resolution second mesh and the relationships of correspondence in order to create a double-resolution mesh with n dimensions;
  • the system comprises a simplifying component for creating the low-resolution second mesh with n dimensions comprising a second volume of data smaller than the first volume of data.
  • the system comprises a selection component for reducing the number of data within the low-resolution second mesh in order to select the pertinent data relative to the data pertaining to the predetermined zone.
  • the system comprises a determining component for determining the list of the first indices associated with the data pertaining to the predetermined zone.
  • the system comprises a displaying component for displaying a high-resolution submesh of the high-resolution first mesh, said high-resolution submesh being associated with the predetermined zone.
  • a third object of the invention relates to a computer program product comprising stored computer-executable instructions for the implementation of the method according to the first object of the invention when said instructions are executed by a data processor.
  • Figure 1 represents a data manipulation system according to an embodiment of the invention, by way of example
  • Figure 2 represents a specific object associated with the high-resolution 3D mesh according to an embodiment of the invention, by way of example;
  • Figure 3 represents a diagram of the steps of the method of creating the double-resolution mesh according to an embodiment of the invention, by way of example;
  • Figure 4 shows a representation of the low-resolution 3D mesh according to an embodiment of the invention, by way of example
  • Figure 5 represents a diagram of the steps of the method of manipulating data according to an embodiment of the invention, by way of example;
  • Figure 6 represents the structure of the double-resolution file of a double-resolution mesh, comprising data blocks according to an embodiment of the invention, by way of example;
  • Figure 7 represents a schematic illustrating the data blocks of the double- resolution file, according to an embodiment of the invention, by way of example;
  • Figures 8a, 8b, 9a, 9b, 10a, 10b, 11a and lib represent isolated surfaces of the schematic of Figure 7, according to an embodiment of the invention, by way of example;
  • Figure 12 shows a representation of the high-resolution 3D mesh according to an embodiment of the invention, by way of example. Detailed description of an embodiment
  • the described embodiment comprises a representation with n dimensions such as a three-dimensional (3D) representation where n represents the number of variables which make it possible to define the object to be represented.
  • the number of variables is greater than or equal to 2.
  • FIG. 1 shows a user's personal computer 100.
  • the personal computer 100 comprises a central unit 102 and a computer screen (not shown).
  • the central unit 102 comprises in particular a hard disc 110 of which the capacity is, for example, 250 gigabytes (Gb).
  • the hard disc 110 comprises a data set corresponding to the three-dimensional (3D) representation of a specific object such as a statue. These data comprise three-dimensional surface data. These data were acquired by means of a data acquisition device such as a laser scanner comprising a component for storing data and connected to the hard disc 110.
  • These data comprise information pertaining to the various polygons which constitute a first mesh, which makes it possible to represent the surface of the specific object.
  • this information relates, for example, to the location of all the vertices of the polygons by means of indices associated with the polygons as well as the number of these polygons.
  • These polygons are, for example, triangles and the indices are for example the vertices of these triangles.
  • the number of polygons can reach, for example, more than one billion polygons.
  • These polygons represent a first mesh with n dimensions, as shown in figure 12, where n represents the number of variables which make it possible to define the object.
  • n comprises for example the variables pertaining to the location of the object in the 3D space, represented by the x, y and z coordinates.
  • the first mesh comprises, for example, a bulky 3D mesh which is referred to as out-of-core. These data are hereafter named the high-resolution 3D mesh data and correspond to a first volume of data. These high-resolution 3D mesh data are stored on the hard disc 110.
  • the central unit 102 also comprises a random access memory component 120, of which the capacity is, for example, 2 Gb, and a graphics card 130 comprising a random access memory 131, of which the capacity is, for example, around 1 Gb.
  • the central unit 102 is equipped with a data manipulation system 140 in order to create an interface, such as a graphic interface, for the user when manipulating the high- resolution 3D mesh.
  • the manipulation comprises access to the data of the high- resolution 3D mesh, particularly the displaying of the high-resolution 3D mesh as described hereafter, the statistical calculation based particularly on the data of the high-resolution 3D mesh, the modification of the data of the high-resolution 3D mesh and the navigation within the high-resolution 3D mesh.
  • the central unit 102 also comprises a processor (not shown) in order to implement the data manipulation system 140 within the computer 100.
  • the system 140 comprises a creation component 150.
  • the creation component 150 comprises a simplification component 152, an indexing component 154 and a merging component 156.
  • the simplification component 152 comprises for example an application to make it possible to generate a second representation of the specific object, as shown in figure 4, in accordance with a 3D mesh comprising polygons.
  • This second representation comprises a resolution smaller than the resolution of the high- resolution first 3D mesh obtained during the acquisition of data.
  • the simplification component 152 can also comprise an application in order to perform steps of simplifying a high-resolution 3D mesh as described in the method defined in the prior art by Martin Isenburg in the document "Large Mesh Simplification Using Processing Sequences" for obtaining a set of low-resolution 3D data.
  • the simplification component 152 makes it possible to obtain a low-resolution 3D mesh comprising low-resolution 3D mesh data in a step 200.
  • the low-resolution 3D mesh obtained comprises a number of polygons suitable for the capacity of the random access memory 131 of the graphics card 130.
  • the low-resolution 3D mesh contains, for example, one million polygons.
  • the user can adapt the level of resolution of the application of the simplification component 152 in order to obtain a number of polygons of the low-resolution 3D mesh compatible with the storage capacities of the random access memory component 120 of his personal computer 100.
  • the simplification component 152 thus makes it possible to create a second 3D mesh, i.e. a low-resolution version of the high-resolution first 3D mesh representing the specific object as shown in figure 4.
  • the low-resolution 3D mesh comprises a volume of data smaller than the volume of data of the high-resolution 3D mesh.
  • the simplification component 152 remains optional. Indeed, the simplification component 152 is not necessary when two representations of the 3D mesh are available and the resolutions of each of the representations are different from one another.
  • the creation component 150 also comprises an indexing component 154 for defining a correspondence between the polygons of the low- resolution 3D mesh and the polygons of the high-resolution 3D mesh in a step 202.
  • the indexing component 154 comprises an indexing algorithm as shown below for creating relationships of correspondence between the data pertaining to the polygons of the low-resolution 3D mesh and the data pertaining to the polygons of the high-resolution 3D mesh.
  • the indexing component 154 makes it possible to reduce the volume of data representing the high-resolution 3 D mesh pertaining to a predetermined view. Indeed, as mentioned above, the volume of the set of data pertaining to the high- resolution 3 D mesh is too large to be entirely loaded into the random access memory component 131 of the graphics card 130.
  • the indexing component 154 applies the indexing algorithm according to an indexing method in two steps. In a first indexing step, the indexing component 154 applies calculation methods which are known in the prior art in particular by using orthogonal projections. Thus, the indexing component 154 calculates the orthogonal projection of each vertex of each polygon of the high-resolution 3D mesh onto the planes associated with each polygon of the low-resolution 3D mesh.
  • the indexing component 154 then applies validity conditions to the orthogonal projections.
  • the orthogonal projection is considered to be valid if, and only if, this orthogonal projection is within the low- resolution triangle associated with the projection plane. This calculation can be performed, for example, by using a vector product.
  • each high-resolution point can have 0, 1 or p valid projections.
  • the indexing component 154 determines the nearest orthogonal projection to the vertex under consideration.
  • the indexing component 154 then attributes to each vertex of the high-resolution 3D mesh an index which is representative of the associated polygon in the low-resolution 3D mesh.
  • the application of the indexing algorithm by means of the indexing component 154 makes it possible to establish, in this first indexing step a relationship of correspondence between each vertex of the polygons of the high-resolution 3D mesh and each polygon of the low-resolution 3D mesh. This is a high-resolution vertex - low-resolution polygon relationship.
  • the second indexing step consists in using the existing relationship between the vertices of the high-resolution 3D mesh and the polygons of the low-resolution 3D mesh to establish a relationship of correspondence between the polygons of the high-resolution 3D mesh and the polygons of the low-resolution 3D mesh.
  • the indexing component 154 thus once again uses the indices associated with the vertices of each polygon of the high-resolution 3D mesh and applies a majority rule.
  • each triangle comprises three vertices and each vertex possesses an index of a low-resolution triangle.
  • the index allocated to the low-resolution triangle is the index with the highest occurrence. In the case of equality, i.e.
  • the indexing algorithm makes it possible to select an index at random.
  • the indexing component 154 determines a final index allocated to each polygon of the high-resolution 3D mesh.
  • the indexing component 154 also makes it possible to create a relationship of correspondence between the polygons of the high-resolution 3 D mesh and the polygons of the low-resolution 3 D mesh according to a high-resolution polygon - low-resolution polygon association in a step 204.
  • the indexing component 154 makes it possible to represent on the low- resolution 3 D mesh, all of the polygons of the high-resolution 3 D mesh.
  • Each polygon of the low-resolution 3 D mesh represents one or more polygons of the high-resolution 3 D mesh by means of the high-resolution polygon - low-resolution polygon relationship detailed above.
  • the creation component 150 also comprises a merging component 156.
  • the merging component 156 comprises a merging algorithm such as shown below:
  • This algorithm performs various steps so as to generate a double-resolution file pertaining to a double-resolution 3D mesh.
  • the double-resolution file makes it possible to establish the correspondence between the high-resolution 3D mesh and the low-resolution 3D mesh.
  • the double-resolution 3D mesh integrates the high- resolution polygon - low-resolution polygon relationship, the representation of the polygons of the high-resolution 3D mesh and of the polygons of the low-resolution 3D mesh.
  • the merging algorithm proceeds to various steps.
  • the merging algorithm determines the number of vertices of the polygons of the high-resolution and low- resolution 3D meshes to proceed to the construction of the double-resolution 3D mesh.
  • the reading of the correspondence tables then makes it possible to construct a double-resolution file comprising blocks associated on the one hand with the geometric and topological representation of the high-resolution and low-resolution 3D meshes and on the other hand with the relationship of correspondence between the polygons of these two 3D meshes.
  • Each block comprises a polygon of the low- resolution 3D mesh, the corresponding polygons of the associated high-resolution 3D mesh, as well as an indication of the number of these polygons of the high- resolution 3D mesh as indicated in figure 6.
  • the block 500 comprises an indication of the numbers NbrS_MB and NbrS_MH representing respectively the number of vertices within the low-resolution 3D mesh (MB) and the high-resolution 3D mesh (MH).
  • the block 502 comprises the indication of the various vertices pertaining to the low-resolution 3D mesh.
  • the block 504 comprises the x, y, z coordinates of the various vertices of the various polygons of the high-resolution 3D mesh.
  • the block 506 comprises the indication of the number NbrT_MB which represents the total number of vertices within the low-resolution 3D mesh.
  • the block 508 comprises various sub-blocks 510 and 511 pertaining to the relationship of correspondence between the vertices of the polygons of the low-resolution 3D mesh SBl, SB2, SB3 and the vertices of the polygons of the high-resolution 3D mesh SHI, SH2, SH3.
  • the merging algorithm makes it possible to obtain the representation of the low- resolution 3D mesh by using the high-resolution polygon - low-resolution polygon relationship of correspondence.
  • the merging algorithm modifies the final index for representing the polygons of the high-resolution 3D mesh of each block in order to obtain a modified final index. This modified final index corresponds to the representation of the polygons of the high-resolution 3D mesh within each corresponding block.
  • Figure 6 shows a representation of a sub-block 510 by means of a graphic representation of a specific zone of the 3D object.
  • a triangle with vertices SBl, SB2, SB3 is considered.
  • Figure 5 represents the steps performed by the merging algorithm to obtain the content of a block 510.
  • a polygon is considered which corresponds to the surface of the triangle SBl, SB2, SB3 within the low-resolution 3D mesh represented in figure 4.
  • the merging algorithm indexes the geometry indices associated with the triangle vertices SBl, SB2, SB3 in order to represent this triangle in three-dimensional space (x, y, z).
  • the merging algorithm makes it possible to generate the topology indices of the vertices of the various triangles located within the triangle SBl, SB2, SB3.
  • the geometrical coordinates of the vertices of the triangle (SBl, SB2, SB3) in the x, y, z starting reference 0 (0,0,0) are, according to figure 7:
  • the topology indices of the vertices of the triangles located inside the triangle are, according to figures 8a, 8b, 9a, 9b, 10a, 10b, 11a and lib: triangle 1 vertices (SB1 SB2 0) according to figures 10a and 10b, triangle 2 vertices (0 SB2 SB3) according to figures 8a and 8b,
  • the merging algorithm proceeds to the reading of the correspondence tables in order to associate the vertices of the triangles from the high-resolution 3D mesh with the triangles of the low-resolution 3D mesh.
  • the merging component 156 makes it possible to create in a step 206 a double- resolution 3D mesh comprising the set of data pertaining to the high-resolution 3D mesh, to the low-resolution 3D mesh and to the high-resolution polygon - low- resolution polygon relationship of correspondence.
  • the creation component 150 therefore makes it possible to create a double- resolution 3D mesh, i.e. associating the high and the low resolution by using the representation of the low-resolution 3D mesh and the file associated with this mesh.
  • the simplification component 152 the random access memory 131 of the graphics card 130 of the user's personal computer 100 can store the entire low- resolution 3D mesh.
  • the indexing component 154 and the merging component 156 the user can optimally use the file to manipulate the high- resolution 3D mesh.
  • the application relates to data from the high- resolution 3D mesh for displaying a bulky 3D mesh. Other applications pertaining to the access to the data of the high-resolution 3D mesh are also possible.
  • the data manipulation system 140 also comprises a manipulation component 160 such as a displaying component 160 according to the present embodiment.
  • the displaying component 160 comprises a displaying algorithm as shown below:
  • Tri_ Visible culling (MB) (Determine the set of indices of the visible triangles labeled Tri_Visible by calling the culling function which takes
  • the display component 160 makes it possible to display data pertaining to a zone of interest of a high-resolution 3D mesh, as predetermined by the user.
  • the displaying is an example of the use of a double-resolution file obtained by means of the creation component 150.
  • the displaying component 160 comprises two selection components 161 and 162 and a determining component 163.
  • the first selection component 161 makes it possible to determine the zone of interest of the low-resolution 3D mesh as determined by the user.
  • the presence of the selection component 161 is optional depending on the parameterisation of the displaying component 160 and depending on the purpose of the use of the manipulation system.
  • the predetermined zone of interest can also be parameterised as being the zone as displayed on the computer screen, without prior selection by the user.
  • the selection component 162 comprises a selection algorithm.
  • the selection component 162 applies the selection algorithm to the predetermined zone of interest, within the low-resolution 3D mesh.
  • the selection component 162 reduces the number of high-resolution polygons to be displayed by applying a known reduction technique, the "culling" technique.
  • the speed of the application of this technique increases as the number of triangles decreases.
  • the low-resolution 3D mesh generally allows efficient use of the culling technique.
  • the "culling” can be performed according to different variants and according to various criteria.
  • the culling is applied to the low- resolution 3D mesh considering the zone of interest.
  • a first variant referred to as "backface culling” consists in deleting from the mesh the polygons which face away from the camera, for example, during user interaction. The user therefore does not see these polygons on the computer screen, depending on the view being considered of the specific object.
  • a second variant named “occlusion culling” consists in eliminating from the 3D mesh, i.e. from the depiction, the polygons or other objects hidden by other polygons. The user therefore does not see these polygons on the computer screen.
  • a third variant named “frustum culling” consists in eliminating the polygons or objects located outside of the field of vision.
  • a fourth variant named "contribution culling” consists in eliminating the polygons which are of an extremely small size on the computer screen and which therefore make a very small contribution in the final depiction.
  • the selection component 162 makes it possible to select only the pertinent polygons, i.e. those pertaining to the predetermined zone of interest.
  • the non- pertinent polygons comprise for example the polygons located outside of the predetermined zone of interest as described above.
  • the result of this reduction step comprises a list comprising polygons from the low-resolution 3D mesh. The indices of these polygons belong to the zone of interest which the user wishes to manipulate on the screen of his personal computer 100.
  • step 400 the selection component 162 fully loads the low-resolution 3D mesh associated with the high-resolution 3D mesh determined by the user into the random access memory 131 of the graphics card 130 of the personal computer 100. Then, in a step 402, the user selects a zone of interest called the predetermined zone of interest within the low-resolution 3D mesh. In a step 404, the selection component 162 reduces the number of polygons within the low-resolution 3D mesh in order to isolate the predetermined zone of interest.
  • the determination component 163 performs a search within the predetermined zone of interest in order to obtain the list of indices pertaining to each polygon forming the predetermined zone of interest.
  • the determination component 163 searches in the double-resolution file for the indices of the polygons from the high-resolution 3D mesh associated with the indices of the polygons from the low-resolution 3D mesh as present in the list obtained during the step 404.
  • the determination component 163 performs in a step 410 the loading, into the random access memory 131 of the graphics card 130 of the personal computer 100, of only the necessary visible zones of the high-resolution 3D mesh, as required by the user for the displaying of a particular view of the specific 3D object.
  • the displaying component 160 by means of the determination component 163, makes it possible to generate a high-resolution 3D submesh associated only with the visible zones required by the user for the final depiction.
  • This high- resolution 3D submesh defines zones which comprise the polygons from the high- resolution 3D mesh corresponding to the visible zones of the low-resolution 3D mesh.
  • the generation of the high-resolution 3D submesh also integrates connectivity relationships between the various zones such as defined in the high- resolution 3D mesh.
  • the selection component 162 can define new connectivity relationships between the various zones.
  • each zone is associated with a connectivity location of which the topological indices start from 0.
  • the determination component 163 loads or stores in the random access memory 131 of the graphics card 130 the zone selected from the various blocks of the high-resolution 3D mesh.
  • the graphics card 130 can then load and display the zone selected.
  • the user obtains on the screen of the personal computer 100 an overall depiction which displays blocks of which the size is compatible with the storage capacities of the graphics card 130.
  • extracts from bulky 3D meshes which are referred to as "out-of-core" can be displayed on the graphics cards 130 of which the storage capacities are limited to 1 Gigabyte, for example.
  • the selection component 162 For each subsequent selection of a zone on the low-resolution 3D mesh by the user, the selection component 162 performs the "culling" step 400. This step makes it possible to obtain a list of indices containing the polygons which the user can see.
  • the determination component 163 performs an updating of the zone already displayed on the screen of the personal computer 100.
  • the determination component 163 performs a comparison step in order to compare the indices of the polygons already loaded during a first selection by the user and the indices obtained during a subsequent selection.
  • the selection component 162 determines the new visible polygons which the user wishes to display and the determination component 163 deletes from the display the polygons which are not visible taking into account the new zone to be displayed.
  • the present invention makes it possible to perform a surface analysis of data to obtain an optimisation of the manipulation of the data, whilst maintaining the integrity of the high-resolution mesh considered.
  • the generation of the submesh of the mesh with several or n high-resolution dimensions makes it possible to reconstitute a specific zone of the mesh with n high-resolution dimensions without distorting the representation of the specific zone compared to the original form of this zone in the high-resolution mesh.
  • the present invention allows an automation of the constitution of the double- resolution file.
  • the present invention makes it possible to automatically generate the high-resolution submesh associated with a mesh zone selected by the user.
  • the present invention makes it possible to manipulate the data of a mesh with n or several dimensions such as bulky 3D meshes referred to as out-of-core on a personal computer, whilst avoiding loading into the random access memory of the graphics card of the personal computer the totality of the high-resolution 3D mesh data, thereby avoiding the use of a remote render server.
  • the manipulation of the data of these meshes with n dimensions is optimised with regard to the calculation time in particular to display the meshes with n dimensions in high resolution.
  • the manipulation is also optimised with regard to the costs associated with this manipulation which no longer requires the use of expensive servers with large data storage capacities.

Landscapes

  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Computer Graphics (AREA)
  • Geometry (AREA)
  • Software Systems (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Processing Or Creating Images (AREA)

Abstract

La présente invention concerne un procédé servant à manipuler une première maille de haute résolution ayant n dimensions représentant un objet ayant n dimensions et comprenant un premier volume de données associées à des premiers indices. Ledit procédé comprend les étapes suivantes : a) obtenir une deuxième maille de basse résolution ayant n dimensions représentant l'objet ayant n dimensions et comprenant un deuxième volume de données associées à des deuxièmes indices, ledit deuxième volume de données étant plus petit que le premier volume de données ; b) sélectionner une zone prédéterminée dans la deuxième maille de basse résolution ayant n dimensions, ladite zone prédéterminée étant associée à des deuxièmes indices prédéterminés ; c) obtenir des deuxièmes indices prédéterminés associés à la représentation des données présentes dans la zone prédéterminée de la deuxième maille de basse résolution ayant n dimensions ; d) rechercher, dans un fichier à double résolution, les premiers indices prédéterminés associés aux deuxièmes indices prédéterminés afin de représenter les données de la première maille de haute résolution selon les données de la deuxième maille de basse résolution, ladite étape de recherche étant précédée par une étape d'indexation servant à créer des relations de correspondance entre les premiers indices de la première maille de haute résolution ayant n dimensions et les deuxièmes indices de la deuxième maille de basse résolution ayant n dimensions et par une étape de génération dudit fichier de double résolution qui établit la correspondance entre la première maille de haute résolution ayant n dimensions et la deuxième maille de basse résolution ayant n dimensions ; e) obtenir des premiers indices prédéterminés pour représenter les données se rapportant à la première maille de haute résolution ayant n dimensions et correspondant aux données se rapportant à la deuxième maille de basse résolution ayant n dimensions pour la zone prédéterminée ; f) générer une sous-maille ayant n dimensions associée aux premiers indices prédéterminés des données de la première maille de haute résolution ayant n dimensions pour représenter la zone prédéterminée afin d'autoriser, dans la première maille de haute résolution ayant n dimensions, la manipulation des données d'une partie du premier volume de données se rapportant à la zone prédéterminée, l'étape de génération comprenant une étape de fusionnement servant à générer une maille de double résolution afin de lier les données de la première maille de haute résolution ayant n dimensions et les données de la deuxième maille de basse résolution ayant n dimensions au moyen des relations de correspondance.
PCT/EP2013/064951 2012-07-13 2013-07-15 Procédé, système et produit-programme d'ordinateur pour manipuler des mailles ayant plusieurs dimensions référencées en tant que hors-cœur WO2014009568A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FR1256822 2012-07-13
FR1256822A FR2993383B1 (fr) 2012-07-13 2012-07-13 Procede, systeme et produit-programme d’ordinateur pour manipuler des maillages a plusieurs dimensions dits out-of-core

Publications (1)

Publication Number Publication Date
WO2014009568A1 true WO2014009568A1 (fr) 2014-01-16

Family

ID=47191885

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2013/064951 WO2014009568A1 (fr) 2012-07-13 2013-07-15 Procédé, système et produit-programme d'ordinateur pour manipuler des mailles ayant plusieurs dimensions référencées en tant que hors-cœur

Country Status (2)

Country Link
FR (1) FR2993383B1 (fr)
WO (1) WO2014009568A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1997039425A1 (fr) * 1996-04-12 1997-10-23 Multigen, Inc. Procede et dispositif pour restituer des images tridimensionnelles
US6933946B1 (en) 2003-05-07 2005-08-23 At&T Corp. Method for out-of core rendering of large 3D models
US7006088B1 (en) * 2001-01-30 2006-02-28 California Institute Of Technology Hybrid meshes

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1997039425A1 (fr) * 1996-04-12 1997-10-23 Multigen, Inc. Procede et dispositif pour restituer des images tridimensionnelles
US7006088B1 (en) * 2001-01-30 2006-02-28 California Institute Of Technology Hybrid meshes
US6933946B1 (en) 2003-05-07 2005-08-23 At&T Corp. Method for out-of core rendering of large 3D models

Non-Patent Citations (7)

* Cited by examiner, † Cited by third party
Title
AARON W. F. LEE , WIM SWELDENS , PETER SCHRÖDER , LAWRENCE COWSAR , DAVID DOBKIN: "MAPS: Multiresolution Adaptive Parameterization of Surfaces", PROCEEDINGS OF THE 25TH ANNUAL CONFERENCE ON COMPUTER GRAPHICS AND INTERACTIVE TECHNIQUES, 7 January 1998 (1998-01-07), ACM, 2 PENN PLAZA, SUITE 701 - NEW YORK USA, 1998, pages 95 - 104, XP040095392 *
ANIS MEFTAH ET AL: "Measuring errors for massive triangle meshes", 2010 IEEE INTERNATIONAL WORKSHOP ON MULTIMEDIA SIGNAL PROCESSING (MMSP '10), SAINT MALO, FRANCE, 4-6 OCT. 2010, IEEE, IEEE, PISCATAWAY, USA, 4 October 2010 (2010-10-04), pages 379 - 383, XP031830613, ISBN: 978-1-4244-8110-1 *
DECORO C ET AL: "XFastMesh: fast view-dependent meshing from external memory", VIS 2002. IEEE VISUALIZATION 2002. PROCEEDINGS. BOSTON, MA, OCT. 27 - NOV. 1, 2002; [ANNUAL IEEE CONFERENCE ON VISUALIZATION], NEW YORK, NY : IEEE, US, 1 November 2002 (2002-11-01), pages 363 - 370, XP031212986, ISBN: 978-0-7803-7498-0 *
FABIO GANOVELLI ET AL: "OCME: Out-of-Core Mesh Editing Made Practical", IEEE COMPUTER GRAPHICS AND APPLICATIONS, IEEE SERVICE CENTER, NEW YORK, NY, US, vol. 32, no. 3, 1 May 2012 (2012-05-01), pages 46 - 58, XP011442114, ISSN: 0272-1716, DOI: 10.1109/MCG.2011.49 *
ISENBURG M ET AL: "Large mesh simplification using processing sequences", VIS 2003. IEEE VISUALIZATION 2003. PROCEEDINGS. SEATTLE, WA, OCT. 19 - 24, 2003; [ANNUAL IEEE CONFERENCE ON VISUALIZATION], NEW YORK, NY : IEEE, US, 1 January 2003 (2003-01-01), pages 465 - 472, XP031173533, ISBN: 978-0-7803-8120-9, DOI: 10.1109/VISUAL.2003.1250408 *
SUNGYUL CHOE ET AL: "Random Accessible Mesh Compression Using Mesh Chartification", IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, IEEE SERVICE CENTER, LOS ALAMITOS, CA, US, vol. 15, no. 1, 1 January 2009 (2009-01-01), pages 160 - 173, XP011344521, ISSN: 1077-2626, DOI: 10.1109/TVCG.2008.64 *
VOLKOV V ET AL: "Real-time refinement and simplification of adaptive triangular meshes", VIS 2003. IEEE VISUALIZATION 2003. PROCEEDINGS. SEATTLE, WA, OCT. 19 - 24, 2003; [ANNUAL IEEE CONFERENCE ON VISUALIZATION], NEW YORK, NY : IEEE, US, 1 January 2003 (2003-01-01), pages 155 - 162, XP031173493, ISBN: 978-0-7803-8120-9, DOI: 10.1109/VISUAL.2003.1250367 *

Also Published As

Publication number Publication date
FR2993383B1 (fr) 2015-04-10
FR2993383A1 (fr) 2014-01-17

Similar Documents

Publication Publication Date Title
CN110738721B (zh) 基于视频几何分析的三维场景渲染加速方法及系统
CN106919733B (zh) 用于设计建模对象的3d组装的方法、装置、介质和系统
CN110990516A (zh) 地图数据的处理方法、装置和服务器
JP6673905B2 (ja) ネットワーク転送およびリアルタイムレンダリング用に３ｄテクスチャモデルを自動的に最適化するシステム、方法、およびコンピュータプログラム製品
RU2736628C1 (ru) Способ и система рендеринга 3d моделей в браузере с использованием распределенных ресурсов
US20120256914A1 (en) Consulting digital models from lightweight terminals
CN115082632A (zh) 一种基于WebGL的二维和三维一体化GIS系统及应用
CN109872402B (zh) 3d模型处理方法、装置、计算机设备和存储介质
CN106445445B (zh) 一种矢量数据的处理方法及装置
JP6981753B2 (ja) 複数のグラフィックカードの管理
JP6981754B2 (ja) 複数のグラフィックカードの管理
KR100901284B1 (ko) 3ｄ 모델 식별자를 이용한 랜더링 시스템 및 방법
WO2014009568A1 (fr) Procédé, système et produit-programme d'ordinateur pour manipuler des mailles ayant plusieurs dimensions référencées en tant que hors-cœur
Steinlechner et al. Adaptive pointcloud segmentation for assisted interactions
Du et al. Out‐of‐Core Simplification and Crack‐Free LOD Volume Rendering for Irregular Grids
CN117078825B (zh) 一种点云数据线上渲染修改方法、系统、设备及介质
US20230114325A1 (en) Seamless image processing of a tiled image region
CN115661407B (zh) 多细节层次模型的生成方法、装置、电子设备及存储介质
CN116630552B (zh) 面向大规模的三维流程工厂模型的优化渲染方法
Singh et al. Visual Exploration of LiDAR Point Clouds
Abdallah 3D Web-Based Shape Modelling: Data Extraction and Delivery
Fallah et al. A New Object Selecting Technique for Visualization of Large Datasets
CN117034679A (zh) 一种方块转换为物理模型的方法、装置及计算机存储介质
CN116363285A (zh) 一种应用于国产化平台的船载综合探测数据可视化系统
KR101373174B1 (ko) 공간가속구조의 다각형 데이터 처리방법 및 장치

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 13736599

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 13736599

Country of ref document: EP

Kind code of ref document: A1