EP1546936A1 - Systeme informatique et procede de comparaison d'ensembles de donnees de corps tridimensionnels - Google Patents

Systeme informatique et procede de comparaison d'ensembles de donnees de corps tridimensionnels

Info

Publication number
EP1546936A1
EP1546936A1 EP03790960A EP03790960A EP1546936A1 EP 1546936 A1 EP1546936 A1 EP 1546936A1 EP 03790960 A EP03790960 A EP 03790960A EP 03790960 A EP03790960 A EP 03790960A EP 1546936 A1 EP1546936 A1 EP 1546936A1
Authority
EP
European Patent Office
Prior art keywords
data
database
bodies
computer system
selected body
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
EP03790960A
Other languages
German (de)
English (en)
Inventor
Frank Epple
Markus Zajc
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Cadenas Konstruktions- Softwareentwicklungs- und Vertriebs GmbH
Original Assignee
Cadenas Konstruktions- Softwareentwicklungs- und Vertriebs GmbH
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 Cadenas Konstruktions- Softwareentwicklungs- und Vertriebs GmbH filed Critical Cadenas Konstruktions- Softwareentwicklungs- und Vertriebs GmbH
Publication of EP1546936A1 publication Critical patent/EP1546936A1/fr
Ceased legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/50—Information retrieval; Database structures therefor; File system structures therefor of still image data
    • G06F16/58—Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually
    • G06F16/583—Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually using metadata automatically derived from the content
    • G06F16/5854—Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually using metadata automatically derived from the content using shape and object relationship
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
    • G06V10/00—Arrangements for image or video recognition or understanding
    • G06V10/70—Arrangements for image or video recognition or understanding using pattern recognition or machine learning
    • G06V10/74—Image or video pattern matching; Proximity measures in feature spaces
    • G06V10/75—Organisation of the matching processes, e.g. simultaneous or sequential comparisons of image or video features; Coarse-fine approaches, e.g. multi-scale approaches; using context analysis; Selection of dictionaries
    • G06V10/752—Contour matching

Definitions

  • the invention relates to a computer system for making available technical information, 5 which includes a data processing unit, a database, a data input unit, and a data display unit, whereby in the database, data of a quantity of three-dimensional bodies can be stored.
  • Such a computer system is known from WO 01/09742 A2, in which a web portal for 0 engineering information is disclosed.
  • the computer system includes data and drawings for technical elements, which are bought by a consumer.
  • the drawings can be stored in a customer computer (client) and integrated in a CAD system.
  • the known system is limited to reproducing the parts themselves and simple 5 information about the parts, for example, their dimensions.
  • Data-containing three-dimensional models have characteristics, which are essential for the compilation of algorithms for describing the three-dimensional structure; in contrast 0 to pictorial representations or screen representations, three-dimensional models do not depend on the configuration of cameras, light sources, or surrounding objects, for example, mirroring elements. As a result, they also contain no reflections, shadows, inclusions, projections, and the like. Thus, it is possible with the assistance of algorithms to describe conformity between objects of the same type. 5
  • a method for calculating 3D model signatures and degrees of dissimilarity is described, which is suited for the desired object.
  • the basic idea is that the signature of an object is to be represented by a shape distribution, which is obtained from a shape function, which describes the global geometric characteristics of the object.
  • the basic idea of this approach is to transform any 3D model into a function, which can be easily compared with others.
  • the characteristic of a three-dimensional object is reproduced by a feasibility distribution, which was obtained from a shape function.
  • the shape function dispenses with the geometric characteristics of the object.
  • Such a shape distribution provides, for example, the distribution of Euclidean removal between pairs of points selected according to random criteria on the surface of a three-dimensional model again.
  • the distribution describes the entire surface of the selected object.
  • the dissimilarity between the two objects can be determined by means of metrics, which dispenses with the distances between the distributions, for example, the L N -norm, whereby possibly a standardizing step is necessary for adjusting the dimensional scales.
  • each 3D model can be covered in a parameterized function, which can be easily compared with others.
  • the computing method is based on the original polygons of a 3D model. With this method, also such objects can be separated from one another, which have different fine structures.
  • Shape distributions have the necessary invariance, for example, relative to rotations and scaling. They are robust against small disturbances.
  • the description of the deviation between two bodies assumes the metrics of the used standards, for example, the L N -norm.
  • the building of the shape distributions for a data compilation of 3D models can be achieved quickly and efficiently.
  • the shape distributions are independent from the type of their representation, topology, or the application area of the 3D model described with their assistance.
  • a single data component can have also a plurality of different forms.
  • the shape distributions are also suited to describe machine parts.
  • functions for the obtainment of shape distributions for example, the following are considered: functions for measuring the angle between three points selected according to the random principle on a surface of a 3D model, functions for measuring the distance between a determined point and a point selected according to the random principle on a surface, functions for measuring the distance between two points selected according to the random principle on the surface, functions for measuring the third root of the volume of the tetrahedron between four points selected according to the random principle on the surface.
  • this object is solved, in that via the data input unit, data of any selected body can be input and that the data display unit can output at least one body, which in the quantity of the three-dimensional bodies, has the greatest similarity with the selected body.
  • the expensive searching of one component is eliminated, which first must be associated to a determined class of components, in order to arrange its geometry alone with the assistance of the human eye in a specific group. If this type of grouping with simple components, such as a screw or a plate can be performed still with justifiable expense, then with objects comprised of many components, such as a cylinder or an engine, this type of grouping can hardly be performed and requires much time.
  • an automatic recognition of components is made possible, because corresponding components are available in a database as reference parts. Via algorithms, the searched components of a group of reference parts are associated from the database, and therewith, the corresponding attributes are assigned, which relate to these reference parts. Starting from a mathematically comprehensible association with the aid of a computer system, which is programmed accordingly, the search of a desired component is realized in only a portion of the time that would be required with a search by eye and with purely mechanical arrangement means.
  • An industrial manufacturer of a highly complex product for example, an air plane or a ship, can locate individual components, which are mounted or machined on many different points of the product and can determine similarities between these components, when they are combined in a common data line.
  • the body that can be selected according to the invention is either already contained in the database or it is input externally and than pre-processed, broken down into its characteristics, and mathematically described by shape functions, shape distributions, or other scalar or vectoral dimensions, which together form a completely described data set of the body at least in view of its geometry.
  • shape functions, shape distributions, or other scalar or vectoral dimensions which together form a completely described data set of the body at least in view of its geometry.
  • an offline as well as an online reduction can be performed according to the present invention.
  • the data of the body to be searched are input externally.
  • the user of the database can determine the breadth of the database, in which perhaps, with a sufficiently appearing similarity of the components contained in the database, he reduces this to a single component, or if the similarity distances between the parts contained in the database are too large, new parts can be added in the database, in order to increase the complexity and diversity.
  • the computer system of the present invention can be used in particular also during the construction process itself. When the user in the construction processes a new component made up of individual component parts, similar components are searched from the database and are represented on the data display unit in the form of a ranking list of the similarities.
  • the user can interrupt the construction process early, if the components with sufficient similarities can be combined from the parts provided in the database. Or the construction process can be advanced in consideration of the components offered in the database.
  • the first case the use of double parts is avoided; the second case builds on already provided resources and technology.
  • a "crimping" in a component also can be designated as a "groove” or as a "channel”, which leads to difficulty in relocating the same part when it is provided with different designations.
  • Particularly advantageous is a computer system, in which the selected body can be broken down in the data processing unit into individual components. In this manner, the complexity of a body made up of multiple individual components is reduced to the individual component parts themselves.
  • Boolean operations are used, such as for example, those known from W.C. Thibault, B.F. Naylor, "Set operations on polyhedra using binary space portioning tree". Comput. Graph., 21 (4): 153-162, 1987.
  • a characteristic extraction is compiled, by means of which a description is produced, by which the body can be compared with the description of the quantity of bodies already provided in the database.
  • a breakdown of the surface of the selected body into triangular surfaces or other polygonal surfaces is suited.
  • shape distributions are used. With the obtainment of shape distributions, various methods can be used, such as those only cited by way of example in the previously cited attachment.
  • the geometry of the body According to the type of description of the geometry of the body, also various forms or descriptions for "similarity" are created. If different descriptions are provided for each body contained in the database for its geometry, the user of the database also can select which similarity criterion he wants to search. Thus, it can be provided that the selected body is compared with the bodies in the database with reference to the shape distributions and/or the ratio of its surface to its volume.
  • a computer system proves to be one in which the characteristic data set of a selected body can be compared with the characteristic data sets of bodies in the database according to the dynamic time warping method, whereby the shortest distance between the data sets can be found.
  • Dynamic time warping is a known method from voice recognition systems, which serves to determine the conformity between a spoken word and a word sample dependent therefrom, with which the speed of the word is spoken. In this manner, time standardization is necessary, in which the words are temporally expanded or compressed. It is particularly advantageous if only selected parts of the characteristic data set of the selected body are compared with the corresponding parts of the body from the database. Dynamic time warping, then, is applied when shape distributions are contained in the characteristic data set.
  • the characteristic data set can be as long as desired. It combines various criteria obtained by algorithms, so that parts of the characteristic data set can be as long as desired. Dynamic time warping is only applied on the parts, which comprise a function that can be expanded or compressed. It is advantageous if the function is low- noise. However, noise also can be eliminated with the aid of a filter. The expansion or compression of a function is computed with the assistance of dynamic time warping.
  • dynamic time warping cannot be used on this criterion.
  • dynamic time warping is applied on the shape distributions D1, D1 , N1 (with this method, the standard vector of a surface is considered).
  • the present invention relates to a method for comparing data sets of three-dimensional bodies, which are stored in a database of a computer system with a data input unit and a data display unit.
  • the object of the present invention to improve such a method for comparing the bodies or components.
  • the object is resolved, in that via the data input unit, data of any selected body can be input and that by means of the data display unit, at least one body is displayed, which has the greatest similarity with the selected body in the quantity of the three-dimensional bodies.
  • a data cycle can be interrupted when it is determined that the similarity of the body to be compared with the new body is smaller than the similarity between an already, previously compared body and the new body.
  • a method in which, according to a type of evaluation or weight system, points of the individual evaluation algorithms are provided. Each algorithm approaches a margin, within which it distributes points. In this manner, the margin is determined according to the reliability of the algorithm. After running of a plurality of algorithms with a similarity comparison of the selected body with the bodies contained in the database, the points are added up, and the body is determined with the lowest number of points, which proximate the selected body.
  • Each algorithm that evaluates provides points.
  • the algorithm may allocate points. For example, an algorithm A may allocate between 0 and 10 points, an algorithm B may allocate between 0 and 3 points, and an algorithm C may allocate between 0 and 50 points.
  • Each algorithm is used on each part to be compared. The comparison occurs in different ways. For example, with the shape distribution D2, the dynamic time warping is used, while with comparison of volumes to the surface, a simple comparison of both numbers is performed. The determined difference or similarity between the objects to be compared is mirrored further in the number of points allocated by the algorithm.
  • the algorithm A for example, is a shape distribution. This algorithm has a relatively high importance and allocates evaluations between 0 and 10.
  • the algorithm for forming the ratio of volume and surface is, for example, algorithm B. This is a little different for the end result and may allocate as many as three points. The more points that are allocated, then the more marked is the deviation between the selected body and the respective body from the database.
  • the algorithm C is a typical filter. As soon as a part is safely classified as wrong, the algorithm allocates 50 points. In this manner, this part is placed in the ranking list of the most similar parts at a value which signifies a large dissimilarity.
  • the evaluation margin which the individual algorithms permit, is either determined by that made available by the database, or it remains for the user to abandon, after his own specifications determine a valuation of the algorithm.
  • a list of the most similar bodies is displayed on the data display unit.
  • the most similar body as such is displayed in its geometrical appearance on the data display unit, for example, a display screen.
  • the other qualities of the body in particular, its longitudinal dimensions, its material qualities, and the like are displayed.
  • the selected body and the most similar body are shown near one another in a spatial representation in perspective, in order to make possible an optical comparison of parts of the characteristic data set of the selected body with the corresponding parts of the most similar body.
  • the most similar body itself and the selected body are placed in one another, so that the differences in the volumes are visible. In this manner, differences and similarities of the bodies can be viewed and are made particularly well-recognizable.
  • Figure 1 shows a computer system
  • Figure 2 shows a schematic representation of the path for building a database from components
  • Figure 3 shows a flow diagram for achieving a pre-processed 3D-model from the
  • Figures 4a, b show a flow diagram for producing a graphical visualization of differences with a comparison between a selected 3D-model of a body and 3D-data in the database;
  • Figure 5 shows a diagram for illustration the achievement of a ranking list of the most similar models from the database
  • Figures 6a-e show an assembly and its breakdown into individual components, respectively, in perspective view
  • Figures 7a, b show a surface breakdown of the surface of a component, by way of example, a T-shaped tube connection
  • Figures 8a, b show the shape distribution associated with the T-shaped tube connection
  • Figure 9 shows a comparison between the shape distribution of the selected body and a body similar to the selected body.
  • Figures 10a and 10b show a comparison between the shape distribution of the selected body and a body similar to the selected body, respectively, in perspective representation.
  • the computer system is either an individual computer 100 (Fig. 1) or a network of computers, which are connected to one another either via a LAN or via the Worldwide Web.
  • the invention can be realized in hardware in the computer 100, which is programmed accordingly.
  • the invention also can be realized in a client- server environment, in which devices that are remote from one another are connected to each other via a communication network.
  • Program modules can be provided in a local as well as in a remotely arranged storage device.
  • the computer 100 is equipped with a data input unit 110, for example, a keyboard, a data output unit 120, for example, a data display unit, in particular, a display screen, and a data processing unit, that is, a processor (CPU) 150.
  • a data input unit 110 for example, a keyboard
  • a data output unit 120 for example, a data display unit, in particular, a display screen
  • a data processing unit that is, a processor (CPU) 150.
  • a data line 210 is provided for connecting the various components of the computer 100.
  • a database 1 is made available, which serves as the comparison database for the comparison with a desired body.
  • the database 1 (Fig. 2) contains a plurality of 3D models 21, 22, 23, 24, 25,..., which are obtainable as individual technical components and which are available either as such or in connection with one another to a complex component.
  • the models 21 , 2, 23, 24, 25,... are then, for example, available in commerce as purchased parts, or they are parts of such purchased parts.
  • the number of the models 21, 22, 23, 24, 25... is as large as desjred.
  • the models 21 , 22, 23, 24, 25..., for example, are screw nuts of various types, generally square nuts with rounded portions between the corners, cap nuts 22, tube connection pieces 23, wing screws 24, or double-T supports 25.
  • the models 21, 22, 23, 24, 25... are processed in a pre-processing step 3 all in the same manner, such that they all form a common output basis for a characteristic extraction from an object desired by a user of the computer system.
  • Database 1 contains all data sets of all models.
  • the pre-processing step 3 includes a breakdown of the models in individual components, in the event this is necessary. (In the present case, the models 21, 22, 23, 24, 25, however, already are formed as no longer able to be broken down into individual parts). For example, a breakdown of the surfaces of the models 21, 22, 23, 24, 25... into triangles or other polygons can be provided. This step is also designated as tessellating.
  • characteristic data sets are produced, which is saved in the database 1 associated with the respective model 21, 22, 23, 24, 25...
  • the characteristic extraction 4 includes an application of at last one of the known shape functions, which were previously set forth.
  • Each of the models 21, 22, 23, 24, 25... can also be processed by a plurality of functions. Subsequently, the results of the various functions are associated with the respective models 21, 22, 23, 24, 25 and saved in a storage medium.
  • a data set is produced.
  • the models 21 , 22, 23, 24, 25... can be associated also then with pictorial representations of the functions.
  • the representations 51, 52, 53, 54, 55 of the respective models 21 , 22, 23, 24, 25 show the associated distributions of curves, which are related to a selected function; the representations 51 , 52, 53, 54, 55 may also show or represent any other algorithm.
  • multiple curves or other forms of representations are associated.
  • the pre-processing step 3 serves to provide a static analysis of the models 21, 22, 23, 24, 25....
  • the surfaces of the models 21 , 22, 23, 24, 25... are tessellated, that is, broken down into triangles or polygons.
  • the models are shown in another, likewise useable method as scatter plots. Entire data are transferred over import interfaces into the data processing system. Multiple, different methods for processing of the three-dimensional data can also be used in parallel, so that different data sets for each three-dimensional object are provided in the database 1.
  • a next step 31 it is checked whether the models are combined from various components. If this is the case, they are broken down in a further step 32 into their individual components or merged, that is, combined to a single part. This makes possible a comparison of such objects, which are represented in individual components in a database, while they are broken down in the other database as total objects or in other individual components.
  • step 31 a separation of the parts for determining the volume parts (solids) occurs. For example, then, a screw which is screwed into a cube is separated from this.
  • step 33 also information on the original spatial association of the individual parts is obtained and placed in an additional data set.
  • a data set on the complex part made up of individual components is stipulated as a data set.
  • step 34 As far as the models emerging already as individual parts in step 31, they are preferably tessellated in a step 34, that is, their surface is broken down into a plurality of polygonal partial surfaces, for example, in triangular surfaces. Subsequently, it is checked whether the component (model) is completely covered by the selected surfaces. If surfaces are missing, the defective model is repaired. Also, false orientations are repaired. By means of these corrections, the quality of the data is improved; however, a completely, correctly represented model is not necessary, since these errors are improved by the static method of the characteristic extraction. This is also true for the breakdown of the data.
  • step 34 a static equal distribution of the individual surfaces is produced, while as the same time, only a minimal memory use is required.
  • almost any other format for illustration of the model in this representation can be transferred.
  • the pre-processed data of a three-dimensional model are stored in a data structure (step 35), which permits recognition of the connection between individual models and of their combined components or assemblies. All data of the models are collected and the characteristic extraction 4 is applied, in order to take into consideration, for example, global connections from a data set. Alternatively, the data sets are processed separately.
  • the data of a 3-D model are transferred from the pre-processing step 35 (Fig. 3) to a specified interface on a computer unit for performing the characteristic extraction. Through these steps, further pre-processing steps can be performed later within the pre-processing unit 3 (Fig. 2), without requiring that the data obtained in the characteristic extraction be modified.
  • a shape distribution cited in the attachment is applied in a step 41 , or it is used in parallel several times from it.
  • the obtained data is standardized, to which, for example, the L N -norm of Minkowski or the Kolmogorow-Smirnow distance belongs.
  • a method for noise suppression can be used, in order to free the data from disturbing noise signals.
  • a further method involves the use of the VOXEL algorithm.
  • the goal of this algorithm is to observe a body in local regions and from these characteristics, to extract.
  • the body is separated into uniform cells equally distributed over the body. From this, one can extract characteristics, for example, over points or volume parts.
  • Possible methods are the already used methods of the shape distributions (model distribution) and further methods.
  • each cell of one body is compared with the equivalent cell of another body, and thereby a difference amount is formed.
  • a further extraction method is used in parallel, which, for example, exists in the formation of a ratio between the curved to the flat surfaces.
  • the method for data obtainment can be expanded by a flexible data structure.
  • the data sets produced in steps 41 through 43 are either used for filing in the database for the use with a search inquiry of a desired body. With the compilation of the data for the database, the data is used cumulatively, in order to produce a database with high information content. With the search inquiry, the results of steps 41 through 43 are used successively or incrementally, that is, first, a search process with the similarly obtained from a first shape distribution is performed, and then a search process with another shape distribution.
  • a characteristic data set is produced in a step 44 for each component.
  • a characteristic combination is provided in a step 45.
  • the determined data sets are collected according to guidelines, such as, for example, accuracy or memory use and abstracted to the characteristic data set.
  • the data sets (Fig. 4a, b) obtained from the pre-processing (Fig. 2) and by the subsequent characteristic extraction forms the content of the database 1 , which forms a comparison database with the search for a desired body.
  • the characteristics of the body are pre-processed in the same manner as with building the database 1 with the characteristic sets of all models 21, 22, 23, 24, 25 ... in a preprocessing step 7, in order to break down the surface of the body 6 into partial surfaces.
  • the step 8 of characteristic extraction takes place according to the functions, which are contained in the database 1.
  • the body is compared with all of its geometric characteristics with the objects from the database 1 in a comparison step 9.
  • a degree of similarity is produced. From all similarity degrees, a ranking list 10 of the similar models is produced, which is graphically represented on a data output unit 11, for example, a monitor, especially the differences between the body and each of the models 21, 22, 23, 24, 25 ... may be visualized.
  • the bodies (models) to be searched are associated with data sets in the same manner as the components contained in the database 1 , in order to enable a comparison of it with all of the models stored in the database 1 up to that point.
  • the models to be compared is traversed in a processing step 61 (Fig. 5) in the same manner as with the production of the database 1. That is, the pre-processing and the characteristic extraction are applied to the model to be compared. Accordingly, likewise a characteristic data set to the body exists.
  • each data set of the body to be compared is compared with each data set in the database 1.
  • shape distributions which are obtained according to the same shape functions, are placed opposite one another.
  • the comparison provides that the data exceeds a specified, predetermined distance between the shape functions, that is, they are too different, the comparison is interrupted and with the data set of a further component, a new comparison is performed (step 621).
  • the method of "dynamic time warping" (step 620) is used, which is known in language processing, in order to recognize the distortion of the temporal course of a spoken word and compare with a word example.
  • two characteristic data sets are compared with one another. Both data sets are performed from the front to the back, and with each step, the "distance" of the two data sets is adjusted. In this manner, a ranking list 63 of the desired body can be compiled from the most similar models.
  • a multiple-member, essentially T-shaped body 7 (Fig. 6a), which comprises a plurality of individual parts, is broken down into individual components or assemblies, which can be procured by a manufacturer X, connected as such, and are contained as such in the database 1.
  • Individual components for example, are a bar-shaped component 71 (Fig. 6b), a flat component 72 (Fig. 6c), an angular element 73 (Fig. 6d), and a cubical component 74 (Fig. 6e).
  • a surface dispersion (tessellating) of all surfaces into polygons, for example, triangles 81, is provided.
  • a method for producing the shape functions is used.
  • the shape distribution 82 of the tessellated tube connection 80 (Fig.
  • the level axis is represented according to the selected shape distribution, that is, for example, A3, D1 , D2, D3, D4, as are known from the attachment "Matching 3D Models with Shape Distributions", or accordingly to other shape distributions, a value of the tube connection 80, that is, for example, in the case of D2, the length, is shown, and the perpendicular axis provides the frequency of occurrence of the length in this shape distribution.
  • a function for describing the deviation between the shape distributions 82 and 90 (both represented here stretched) is begun at 0, whereby the distances between the shape distributions 82 and 90 are added up according to specified criteria in an addition function 91.
  • the criterion for example, is the distance of the data sets to be compared. If the added-up value is greater than the value found to be greatest in the previous comparison, the comparison that is running is interrupted early.
  • Such a summation method is known, for example, from the attachment "A Dynamic Programming Algorithm Optimization for Spoken Word Recognition", by H. Sakoe, S. Chiba IEEE Trans. On Acoustics, Speech, and Signal processing, ASSP-26(1): 43-49, Feb. 1978.
  • bodies 101 Fig. 10a
  • 102 Fig. 10b
  • the user of the database 1 now distinguishes if one of the components under the bodies, which has the greatest similarity with the desired component, comes into question for his purposes.
  • the comparison of each component stored in the database 1 can take a long time, the inquiry preferably is limited on all of the components with reference to a dimension that is easy to determine, such as the ratio between the surface and volume, in an upstream rough search, which is taken into consideration approximately for a comparison with the desired component.
  • shape functions for the comparison are used.
  • other methods are suitable for accelerating the comparison between the desired body and the components contained in the database 1 , for example, parallel comparison strategies or the distribution of the computing steps on multiple computers running in parallel.
  • the comparison between bodies, which comprise only a single component, or those which combine a plurality of components, to bodies in a database is made possible.
  • a vector for each body is positioned, whose elements provided all of the characteristics of the body, in particular, its geometrical characteristics, however, also other qualities, such as material characteristics, optical characteristics, magnetic characteristics, etc.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Library & Information Science (AREA)
  • Databases & Information Systems (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Evolutionary Computation (AREA)
  • General Engineering & Computer Science (AREA)
  • Artificial Intelligence (AREA)
  • Health & Medical Sciences (AREA)
  • Computing Systems (AREA)
  • Data Mining & Analysis (AREA)
  • General Health & Medical Sciences (AREA)
  • Medical Informatics (AREA)
  • Software Systems (AREA)
  • Multimedia (AREA)
  • Computer Hardware Design (AREA)
  • Geometry (AREA)
  • Processing Or Creating Images (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

L'invention concerne un système informatique (100) servant à rendre disponible des informations techniques. Ledit système informatique (100) comprend une unité de traitement de données (130), une base de données (1), une unité d'entrée de données (110), et une unité d'affichage de données (120). Dans la base de données (1), des données d'une certaine quantité de corps tridimensionnels sont sauvegardées. Au moyen de l'unité d'entrée de données (110), des données de tout corps sélectionné sont entrées, tandis qu'est affiché, par le biais de l'unité d'affichage de données (120), au moins un corps qui présente la plus grande similitude avec le corps sélectionné parmi la quantité des corps tridimensionnels.
EP03790960A 2002-09-02 2003-09-02 Systeme informatique et procede de comparaison d'ensembles de donnees de corps tridimensionnels Ceased EP1546936A1 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE10240940 2002-09-02
DE10240940A DE10240940A1 (de) 2002-09-02 2002-09-02 Computersystem und Verfahren zum Vergleichen von Datensätzen dreidimensionaler Körper
PCT/EP2003/009749 WO2004021216A1 (fr) 2002-09-02 2003-09-02 Systeme informatique et procede de comparaison d'ensembles de donnees de corps tridimensionnels

Publications (1)

Publication Number Publication Date
EP1546936A1 true EP1546936A1 (fr) 2005-06-29

Family

ID=31724354

Family Applications (1)

Application Number Title Priority Date Filing Date
EP03790960A Ceased EP1546936A1 (fr) 2002-09-02 2003-09-02 Systeme informatique et procede de comparaison d'ensembles de donnees de corps tridimensionnels

Country Status (4)

Country Link
EP (1) EP1546936A1 (fr)
AU (1) AU2003264250A1 (fr)
DE (1) DE10240940A1 (fr)
WO (1) WO2004021216A1 (fr)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE102004035838A1 (de) * 2004-07-23 2006-02-16 Faurecia Innenraum Systeme Gmbh Computersystem und Verfahren zur Bestimmung eines Index zur Bewertung der Güte eines Automobil-Innenverkleidungsteils
DE102004053034A1 (de) * 2004-09-17 2006-04-13 Daimlerchrysler Ag Verfahren zur Suche nach eiem ähnlichen Konstruktionsmodell
DE102006017941B4 (de) * 2006-04-18 2008-03-27 Vodafone Holding Gmbh Verfahren zum automatisierten Vergleichen von Datenbanken
GB201008228D0 (en) * 2010-05-18 2010-06-30 Univ Edinburgh Command interface
EP2439664A1 (fr) 2010-09-23 2012-04-11 Dassault Systèmes Conception d'un objet modélisé avec une session de système de conception assistée par ordinateur interagissant avec une base de données
DE102012104609A1 (de) 2012-05-29 2013-12-05 Cadenas Konstruktions-, Softwareentwicklungs- Und Vertriebs Gmbh Verfahren zur Suche dreidimensionaler Objekte in einer Datenbank
CN110472078B (zh) * 2019-08-08 2022-08-19 中国石油集团川庆钻探工程有限公司 一种钻头身份信息录入到钻井数据库的方法

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5418712A (en) * 1993-06-04 1995-05-23 Matsushita Electric Industrial Co., Ltd. Manipulation performance evaluating apparatus for evaluating manipulation performance of a commodity having operating parts
EP1203306A2 (fr) * 1999-07-30 2002-05-08 Web2cad AG Portique web technique

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
BRIBIESCA E.: "A Measure of Compactness for 3D Shapes", COMPUTERS AND MATHEMATICS WITH APPLICATIONS,PERGAMON PRESS, vol. 40, 1 January 2000 (2000-01-01), OXFORD, GB, pages 1275 - 1284, XP002368619, ISSN: 0898-1221 *

Also Published As

Publication number Publication date
AU2003264250A1 (en) 2004-03-19
WO2004021216A1 (fr) 2004-03-11
DE10240940A1 (de) 2004-03-18

Similar Documents

Publication Publication Date Title
Vranic et al. 3D shape descriptor based on 3D Fourier transform
Mian et al. Three-dimensional model-based object recognition and segmentation in cluttered scenes
US8015125B2 (en) Multi-scale segmentation and partial matching 3D models
CN110163863B (zh) 三维物体分割方法、设备和介质
US20060012597A1 (en) Geometry based search method for 3D CAx/PDM repositories
EP3098734A1 (fr) Interrogation d'une base de donnees avec critere de similitude
CN101201845B (zh) 基于中轴点集分层螺旋信息的三维模型检索方法
CN114694139B (zh) 一种数控机床复杂结构件加工特征识别方法及系统
Kim et al. Shape distribution-based approach to comparing 3D CAD assembly models
JP7429430B2 (ja) ３次元アセンブリモデル検索システム、方法およびプログラム
WO2004021216A1 (fr) Systeme informatique et procede de comparaison d'ensembles de donnees de corps tridimensionnels
Iyer et al. A multi-scale hierarchical 3D shape representation for similar shape retrieval
Katayama et al. A retrieval method for 3D CAD assembly models using 3D radon transform and spherical harmonic transform
JP2018013927A (ja) 物体検索装置、三次元物体モデル化装置、方法、及びプログラム
Bolle et al. A complete and extendable approach to visual recognition
CN115455571A (zh) 一种零件参考设计模型筛选方法、装置、设备及存储介质
Hillsman et al. A semi-automatic mold cost estimation framework based upon geometry similarity
Huska et al. A meshless strategy for shape diameter analysis
Msaaf et al. Part data mining for information re-use in a PLM context
Yarotsky Geometric features for voxel-based surface recognition
Rea et al. Interpreting three-dimensional shape distributions
Cardone et al. Similarity assessment based on face alignment using attributed vectors
Martin et al. Turning shape decision problems into measures
Ferrari et al. Free-form feature representation and comparison
Zheng et al. Local scale-based 3D model retrieval for design reuse

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20050307

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL LT LV MK

DAX Request for extension of the european patent (deleted)
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN REFUSED

18R Application refused

Effective date: 20081023