CN106156437B - The automatic structured data for calculating product is realized by interconnection constraint multiaxis simulation figure - Google Patents
The automatic structured data for calculating product is realized by interconnection constraint multiaxis simulation figure Download PDFInfo
- Publication number
- CN106156437B CN106156437B CN201610552704.9A CN201610552704A CN106156437B CN 106156437 B CN106156437 B CN 106156437B CN 201610552704 A CN201610552704 A CN 201610552704A CN 106156437 B CN106156437 B CN 106156437B
- Authority
- CN
- China
- Prior art keywords
- vertex
- transmitting
- constraint
- queue
- definition
- 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.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- Geometry (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present invention relates to a kind of Design of Industrial Product method or algorithms, realize automatic reckoning product in the simulation architecture data in multiaxis space more particularly to by association, constraints graph, including using the two-dimentional interconnection constraint multiaxis simulation figure based on digraph to realize the automatic structured data for calculating product, the problems such as it determines for Planar Mechanisms, the fully defining state of geometry and constrains solution efficiency, it proposes based on constraints graph and utilizes free topology degree and about beam contention mechanism, by inverted constraint direction come Constraints of Equilibrium, and then pass through the algorithm of sequence progress constraint solving.This method, by Constraints of Equilibrium, carries out the judgement of Planar Mechanisms based on constraints graph, and geometry is avoided to cross caused by definition without solving equations；The judgement of the fully defining state of geometry is carried out, foundation is provided for design work, improves Human-computer Interactive Design efficiency；By solving Queue Algorithm, Complex Constraints figure is decomposed, solving speed, efficiency are improved, realizes constraint solving, solves the problem of management of Complex Constraints information.
Description
Technical field
The present invention relates to computer programs and industrial design field, and in particular to the method for Design of Industrial Product, algorithm, packet
It includes and realizes the automatic structured data for calculating product using the two-dimentional interconnection constraint multiaxis simulation figure based on digraph.
Background technique
It is provided on the market for being designed to object, engineering, multiple system and programs of manufacture.CAD is computer
The abbreviation of Computer Aided Design, for example, it is related to the software solution for design object, conventional CAD systems generally require user
Input by sentence geometric figure is constructed, but the constructivity description of some figures is not easy to, in order to make up conventional CAD systems not
Foot preferably meets the requirement of conceptual design, improves design efficiency, is attempted to introduce the thought of artificial intelligence and method
Intelligent CAD is formed into CAD system.The main feature and mark of intelligent CAD are parametrization and variable design.
Later period occur parametric technology be firstly introduced constraint concept, parametric technology by one group of parameter and control zero
One group of structure size sequence of component geometry figure is corresponding, when assigning different parameter values, so that it may generate a series of tools
There are the components of similar geometry figure.Parameterize Solid Modelling the characteristics of be: design based on features, it is full-scale constraint,
Totally according to the modification of related Dimension Drive design.
Variation technology is the primary leap of parametric technology.Variation technology is complete as one by entire designing draft
System consider, it is unrelated with the sequence of construction process, by sketch control size and topological relation all indicated with constraint,
It is fully defining that this can not be the sketch at design initial stage, and not fully defining control size and topological relation are become
Amount stores, temporarily with current drafting size assignment.Designer can any stage in sketch any size and
Topological relation is redefined, while this redefining the change that need not also involve all geometry entities in sketch.Variable
The mode for the flexible more model that change technology provides effectively supports the conceptual design of CAD, can make the creation of designer
Power and imagination are more fully played.
The core of parametric technology and Variation technology is several sizes and topological relation once given designing draft,
System can automatically generate corresponding design drawing, and the process of this Geometric Constraint Solving can be understood as the automatic of geometric construction
Change process.
Summary of the invention
It is pushed away automatically the technical problem to be solved in the present invention is that providing a kind of realize by interconnection constraint multiaxis simulation figure
The structured data for calculating product is solved, vertex representation geometric element using the two-dimensional constrains based on digraph, and side indicates constraint, about
Beam figure is by the geometry for being mutually related all together with constraint relationship.
In order to solve the above-mentioned technical problem, the present invention is accomplished by the following way:
The automatic structured data for calculating product is realized by interconnection constraint multiaxis simulation figure, specifically includes following step
It is rapid:
1) constraints graph that product is made of vertex and binding side is established in selection；
2) Planar Mechanisms judgement is carried out according to any constraint direction chosen in constraints graph；
3) confined equilibrium is carried out to the constraints graph of construction；
4) constraint solving sequence is carried out according to the constraints graph after adjustment confined equilibrium.
In order to improve the interaction design ability of system, and the appearance of Planar Mechanisms situation is avoided, it is complete that the invention proposes geometry
Full definition status (state when shape of geometry and position determine completely), the judgement for meeting following all conditions is that geometry is complete
Definition status:
(1) Planar Mechanisms are not present in the preceding commitments beam of geometric object；
(2) the remaining freedom degree of geometric object is 0；
(3) in constraints graph, any one preceding commitments beam of the reversed geometry is reversely lost using confined equilibrium method
It loses, i.e. all preceding commitments beams of the geometric object can not be reversed.
For above-mentioned steps 2) in Planar Mechanisms judgement for, specific judgment method is as follows:
(21) confined equilibrium fails, then there are Planar Mechanisms；Otherwise Planar Mechanisms are not present；
(22) after confined equilibrium failure, all constraints reversely to fail are all Planar Mechanisms in constraints graph；
(23) geometric object that Planar Mechanisms are directed toward is the geometric object where Planar Mechanisms.
For above-mentioned steps 3) in confined equilibrium, specific confined equilibrium method and step is as follows:
(31) found definition vertex first (remaining freedom degree is less than 0 vertex or conflicting constraint tramsfer vertex)；
(32) it selects a constraint in crossing the preceding commitments beam for defining vertex to carry out reversely, it is desirable that cross definition vertex after reversed
No longer it was definition vertex, (33) is entered step after inverted constraint, if can be reversed without suitable preceding commitments beam, divided following
Two kinds of situations:
(321) if cross definition vertex be because inverted constraint caused by cross definition vertex, then restore constraint direction, weight
Constraint direction is held before new selection one is suitable, is carried out step (32)；
(322) if crossing definition vertex is that initial crosses definition vertex, there are Planar Mechanisms, confined equilibriums for the constraints graph
Failure；
(33) the constraint tramsfer vertex being reversed, if transmitting vertex was not the vertex of definition, confined equilibrium is successful, i.e.,
Constraints graph adjusts successfully, and Planar Mechanisms are not present in constraints graph；If transmitting vertex was definition vertex, definition was treated as on transmitting vertex
Vertex continues step (32).
For above-mentioned steps 4) in constraint solving sequence the specific method is as follows:
(41) the transmitting vertex I of a new addition or new modification constraint is selected；
(42) vertex I will be transmitted as a solution queue element (QE) and be put at the tail of the queue for solving queue；
(43) the transmitting constraint of traversal transmitting vertex I goes to step if transmitting constraint all traversals of transmitting vertex I finish
Suddenly (48) otherwise choose the transmitting not traversed a constraint I, obtain the transmitting vertex II of transmitting constraint I；
(44) if transmitting vertex II records the father vertex of transmitting vertex II not in solving queue, vertex II will be transmitted
As new transmitting vertex I, step (42) are gone to；If transmitting vertex II in solving queue, the father vertex of transmitting vertex I is obtained
To transmit vertex III, then transit shed is emptied, transmitting vertex I is pressed into transit shed；
(45) transmitting vertex III is pressed into transit shed, if transmitting vertex III is exactly vertex transmitting vertex II, or transmitting
Vertex III, transmitting vertex II belong to the same solution queue element (QE) and (illustrate to solve in queue from transmitting vertex II to transmitting vertex
The vertex of I constitutes loop), step (46) are gone to, otherwise, the father vertex for transmitting vertex III are treated as into new transmitting vertex
III goes to step (45), if transmitting vertex III does not have father vertex (i.e. transmitting vertex III is starting point), goes to step (47)；
(46) adjustment solves queue, the queue element (QE) where transit shed inner vertex is merged into one, new queue element (QE)
Element is placed in the position for solving queue element (QE) where transmitting vertex II in queue, goes to step (43)；
(47) if solving in queue, after queue element (QE) where queue element (QE) where transmitting vertex II comes transmitting vertex I, turn
It otherwise adjusts to step (43) and solves queue, vertex II place queue element (QE) will be transmitted and transmitted about along transmitting vertex II
After queue element (QE) where all vertex that Shu Fangxiang is traversed comes the queue element (QE) where transmitting vertex I, step is gone to
(43)；
(48) if transmitting vertex I does not have father vertex (i.e. transmitting vertex I is starting point), algorithm is ended here；If transmitting
Vertex I has father vertex, then returns to the father vertex of transmitting vertex I, and the father vertex for transmitting vertex I is treated as new transmitting vertex I, is turned
To step (43).
Compared with prior art, the present invention possessed by the utility model has the advantages that
It is proposed by the invention to be associated together geometric element and constraint based on constraints graph, it is constrained by balancing,
The judgement for carrying out Planar Mechanisms avoids geometry from crossing caused by definition and calculates without solving equations；Carry out the fully defining state of geometry
Determine, provides foundation for the design work of designer, improve Human-computer Interactive Design efficiency；It, will be complicated by solving Queue Algorithm
Constraints graph is decomposed, and solving speed, efficiency are improved, and realizes constraint solving, solves the problem of management of Complex Constraints information.
Detailed description of the invention
Fig. 1 a is geometric representation constructed by the present invention；
Fig. 1 b is the constraint schematic diagram of Fig. 1 a；
Fig. 2 a is that fully defining state judges geometric representation；
Fig. 2 b is the constraint schematic diagram of Fig. 2 a；
Fig. 3 a is that Planar Mechanisms judge geometric representation；
Fig. 3 b is the constraint schematic diagram of Fig. 3 a；
Fig. 4 a is the confined equilibrium schematic diagram I of constraints graph in the present invention；
Fig. 4 b is the confined equilibrium schematic diagram II of constraints graph in the present invention；
Fig. 4 c is the confined equilibrium schematic diagram III of constraints graph in the present invention；
Fig. 4 d is the confined equilibrium schematic diagram IV of constraints graph in the present invention；
Fig. 4 e is the confined equilibrium schematic diagram V of constraints graph in the present invention；
Fig. 4 f is the confined equilibrium schematic diagram VI of constraints graph in the present invention；
Fig. 5 is the geometric representation in the present invention after the confined equilibrium of constraints graph.
Specific embodiment
Specific embodiments of the present invention will be described in further detail in the following with reference to the drawings and specific embodiments.
The establishment process of constraints graph is exactly to create new vertex and binding side, and the process that they are linked together.Top
Point indicates a certain geometric elements such as point, straight line or circle, and vertex and transmitting vertex are held in vertex can be divided into again before, the arrow of constraint refers to
To vertex be known as the transmitting vertex of the constraint, vertex is held before being known as the constraint in the vertex of the arrow starting of constraint.
Binding side is indicated with directive side with the arrow, and commitments beam and transmitting constraint, are directed toward before being divided into
The binding side on vertex is known as the preceding commitments beam on the vertex, and the binding side originated from the vertex is known as the transmitting constraint on the vertex.
As shown in Figure 1a, 6 geometric element vertex being made of 3 point P1, P2, P3 and 3 straight lines L1, L2, L3 are created
Triangle；Then constraint e1, e2, e3, e4, e5, the e6 of this 6 vertex on straight line are created, wherein e1 is that point P1 is directed toward directly
Line L1, e2~e6 are processed similarly, and how shown in 1b, then add the distance restraint of 10mm between P1 and P2 on its basis
P2 is directed toward by P1 in e9, the direction for constraining e9, indicates the position of P1 by the distance of 10mm come the position of obligatory point P2；Then it adds
30 between the horizontal restraint e8 and straight line L1 and L3 of the fixed constraint e7 and straight line L1 of P10Constrain e10.
As shown in Fig. 2 a, 2b, point P1 " has fixed constraint e1 ", and there is also points to constrain on straight line between point P1 " and straight line L1 "
E2 ", straight line L2 " have horizontal restraint e3 ", while there are Parallel Constraint e4 between straight line L1 " and L2 " ".Therefore use it is above-mentioned rule into
The judgement of the fully defining state of row geometry:
P1 " preceding commitments beam e1 " is not that the remaining freedom degree of Planar Mechanisms, P1 " is that 0, e1 " cannot be reversed, therefore P1 " is complete
Definition status；
Straight line L1 " preceding commitments beam e2 ", e4 " are not Planar Mechanisms, and the remaining freedom degree of straight line L1 " is 0, reversed e2 " and
E4 " fail (e3 " and e4 " constraint conflict each other, while, there is definition in while being directed toward straight line L2 "), therefore straight line L1 " is complete
Definition status；
Straight line L2 " preceding commitments beam e3 " is not Planar Mechanisms, but the remaining freedom degree of straight line L2 " is 1, therefore straight line L2 is " no
It is fully defining state, and in deficient definition status.
Since the constraint redundancy of geometry causes the geometry that is known as of constraint solving failure to cross definition, and leads to constraints graph there are several
The constraint what crosses definition is known as Planar Mechanisms, when geometry freedom degree and its preceding commitments beam all constraint degrees and difference be known as geometry
Remaining freedom degree, and the reason of causing geometry to cross definition be: geometry remaining freedom degree is less than zero or there are constraint conflicts.
How shown in 3a, 3b, e1'~e4' is that constraint and e5' are that the horizontal restraint of straight line L1', e6' are to point on straight line
The vertical constraint of straight line L2', e7' are the tangent constraint of round C1 Yu straight line L2'.Addition straight line L1' is parallel with straight line L2''s again
E8' is constrained, carries out confined equilibrium according to algorithm, as a result confined equilibrium unsuccessfully has Planar Mechanisms；E5', e6' and e8' in constraints graph
Reversed failure (due to the mechanism of constraint conflict, other constraints are not reversed), is determined as Planar Mechanisms；Straight line pointed by them
L1' and L2' is geometry where Planar Mechanisms, i.e., it is horizontal, erect it is perpendicular and parallel be constrained to Planar Mechanisms, straight line L1' and L2' is Planar Mechanisms institute
Geometry.
The vertical constraint e11 of L2 and L1 is newly added in Figure 1b, and as shown in fig. 4 a, it may be newly added for crossing definition vertex
Constrain the transmitting vertex L1 of e11；Since L1 was definition vertex, preceding commitments beam e11 and e8 constraint conflict, and the residue of L1 is certainly
It, can only inverted constraint e8 or the e11 (mistake of other reversed preceding commitments Shu Wufa releasing L1 since there are constraint conflicts by spending less than 0
Definition status), L1 was still definition status after inverted constraint e8, restored the direction of constraint e8, and inverted constraint e11 makes L1 no longer be
Definition vertex is crossed, as shown in Figure 4 b.
As illustrated in fig. 4 c, the transmitting vertex L2 for constraining e11 became definition vertex, and remaining freedom degree is less than 0, reversed L2
Preceding commitments beam e3, making L2 no longer was definition vertex；After inverted constraint e3, the transmitting vertex P2 for constraining e3 became definition top
Point, remaining freedom degree is less than 0, and the preceding commitments beam e9 of reversed P2, making P2 not had been definition vertex, as shown in figure 4d.Then
After inverted constraint e9, the transmitting vertex P1 for constraining e9 became definition vertex, and P1 can be reversed without suitable preceding commitments beam,
Restore the direction of e9；A preceding commitments beam e2 for reselecting P2 is carried out reversely, and making P2 no longer was definition vertex such as Fig. 4 e institute
Show, inverted constraint e2 failure is obtained according to analysis method section before, restores the direction of e2, and then P2 is without suitable preceding commitments
Beam can be reversed, therefore restore the direction of constraint e3.
Further, a preceding commitments beam e4 of L2 is selected to carry out reversed, making L2 no longer was definition vertex such as Fig. 4 f institute
Show, after reversed e4, the transmitting vertex P3 of e4 was also not definition vertex, i.e. constraints graph adjusts successfully.
By carrying out constraint solving queue order to being adjusted to the constraints graph after function, as shown in fig. 4f.
The transmitting vertex L2 indentation of new addition vertical constraint e11 is solved into queue, solving queue at this time is L2；Then just time
The transmitting constraint e4 for going through L2, must play transmitting vertex P3, P3 not in solving queue, by P3 indentation solution queue, asking at this time
Dequeue is classified as P3；Since P3 does not transmit constraint, finished back to the father vertex L2 of P3, then to the transmitting constraint traversal of L2, L2
It is starting point, algorithm terminates.Solution queue: L2 → P3 is finally obtained, that is, first passes through geometry L1, P2 and constraint e11, e3 is calculated
L2, then P3 is calculated by geometry L2, L3 and constraint e4, e5.Finally obtained figure be exactly one be filled foot institute it is constrained as scheme
Geometric figure shown in 5.
The above is only embodiments of the present invention, is stated again, and those skilled in the art are come
It says, without departing from the principle of the present invention, several improvement can also be carried out to the present invention, these improvement are also included in the present invention
In scope of protection of the claims.
Claims (3)
1. the method for calculating product structure data automatically based on interconnection constraint multiaxis simulation figure, it is characterised in that: specifically include
Following steps:
1) constraints graph that product is made of vertex and binding side is established in selection；Vertex representation geometric element, vertex can be divided into again
Before hold vertex and transmitting vertex, the vertex that the arrow of constraint is directed toward is known as the transmitting vertex of the constraint, the arrow starting of constraint
Vertex is held before being known as the constraint in vertex；Binding side is indicated with directive side with the arrow, and preceding commitments can be divided into
Beam and transmitting constraint, the binding side for being directed toward vertex are known as the preceding commitments beam on the vertex, and the binding side originated from the vertex is known as should
The transmitting on vertex constrains；
2) Planar Mechanisms judgement is carried out according to any constraint direction chosen in constraints graph；
3) confined equilibrium is carried out to the constraints graph of construction；
4) constraint solving sequence is carried out according to the constraints graph after adjustment confined equilibrium；
Confined equilibrium in the step 3), specific confined equilibrium method and step are as follows:
(31) definition vertex was found first；
(32) it selects a constraint in crossing the preceding commitments beam for defining vertex to carry out reversely, it is desirable that cross definition vertex no longer after reversed
It was definition vertex, (33) is entered step after inverted constraint, and if can be reversed without suitable preceding commitments beam, divided following two
Situation:
(321) if crossing definition vertex, then restoring the direction of constraint, is selected again because crossing definition vertex caused by inverted constraint
Constraint direction is held before selecting one suitably, is carried out step (32)；
(322) if crossing definition vertex is that initial crosses definition vertex, there are Planar Mechanisms, confined equilibriums to lose for the constraints graph
It loses；
(33) the constraint tramsfer vertex being reversed, if transmitting vertex was not the vertex of definition, confined equilibrium success constrains
Figure adjusts successfully, and Planar Mechanisms are not present in constraints graph；If transmitting vertex was definition vertex, definition top was treated as on transmitting vertex
Point continues step (32).
2. the method according to claim 1 that product structure data are calculated based on interconnection constraint multiaxis simulation figure automatically,
It is characterized by: specific judgment method is as follows for the Planar Mechanisms in the step 2) judge:
(21) confined equilibrium fails, then there are Planar Mechanisms；Otherwise Planar Mechanisms are not present；
(22) after confined equilibrium failure, all constraints reversely to fail are all Planar Mechanisms in constraints graph；
(23) geometric object that Planar Mechanisms are directed toward is the geometric object where Planar Mechanisms.
3. the method according to claim 1 that product structure data are calculated based on interconnection constraint multiaxis simulation figure automatically,
It is characterized by: the specific method is as follows for the constraint solving sequence in the step 4):
(41) the transmitting vertex I of a new addition or new modification constraint is selected；
(42) vertex I will be transmitted as a solution queue element (QE) and be put at the tail of the queue for solving queue；
(43) the transmitting constraint of traversal transmitting vertex I goes to step if transmitting constraint all traversals of transmitting vertex I finish
(48), the transmitting not traversed a constraint I otherwise, is chosen, the transmitting vertex II of transmitting constraint I is obtained；
(44) if transmitting vertex II records the father vertex of transmitting vertex II not in solving queue, transmitting vertex II is treated as
New transmitting vertex I, goes to step (42)；If transmitting vertex II in solving queue, the father vertex of transmitting vertex I is obtained to pass
Vertex III is passed, then empties transit shed, transmitting vertex I is pressed into transit shed；
(45) transmitting vertex III is pressed into transit shed, if transmitting vertex III is exactly vertex transmitting vertex II, or transmitting vertex
III, transmitting vertex II belong to the same solution queue element (QE), go to step (46), otherwise, will transmit the father vertex of vertex III
As new transmitting vertex III, step (45) are gone to, if transmitting vertex III does not have father vertex, go to step (47)；
(46) adjustment solves queue, the queue element (QE) where transit shed inner vertex is merged into one, new queue element (QE) is set
In the position for solving queue element (QE) where transmitting vertex II in queue, step (43) are gone to；
(47) if solving in queue, after queue element (QE) where queue element (QE) where transmitting vertex II comes transmitting vertex I, step is gone to
Suddenly (43), otherwise, adjustment solve queue, transmit constraint side by queue element (QE) where transmitting vertex II and along transmitting vertex II
After coming the queue element (QE) where transmitting vertex I to the queue element (QE) where all vertex traversed, step (43) are gone to；
(48) if transmitting vertex I does not have father vertex, algorithm is ended here；If transmitting vertex I has father vertex, transmitting top is returned to
The father vertex for transmitting vertex I is treated as new transmitting vertex I, goes to step (43) by the father vertex of point I.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610552704.9A CN106156437B (en) | 2016-07-14 | 2016-07-14 | The automatic structured data for calculating product is realized by interconnection constraint multiaxis simulation figure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610552704.9A CN106156437B (en) | 2016-07-14 | 2016-07-14 | The automatic structured data for calculating product is realized by interconnection constraint multiaxis simulation figure |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106156437A CN106156437A (en) | 2016-11-23 |
| CN106156437B true CN106156437B (en) | 2019-09-03 |
Family
ID=58062567
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610552704.9A Active CN106156437B (en) | 2016-07-14 | 2016-07-14 | The automatic structured data for calculating product is realized by interconnection constraint multiaxis simulation figure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106156437B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111178829B (en) * | 2019-12-19 | 2021-06-18 | 中国人民解放军国防科技大学 | Conflict resolution method based on graph algorithm in software project management |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101038602A (en) * | 2007-04-19 | 2007-09-19 | 复旦大学 | Clock deviation arrangement method driven by production yield under technique parametric variation |
| CN101488142A (en) * | 2008-12-09 | 2009-07-22 | 南京大学 | Three-dimensional solid model retrieval method based on face topological interconnection constraint |
| CN104183019A (en) * | 2013-05-20 | 2014-12-03 | 三菱电机株式会社 | Method for Reconstructing 3D Lines |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2884454A1 (en) * | 2013-12-16 | 2015-06-17 | Thomson Licensing | Method for watermarking a three-dimensional object |
-
2016
- 2016-07-14 CN CN201610552704.9A patent/CN106156437B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101038602A (en) * | 2007-04-19 | 2007-09-19 | 复旦大学 | Clock deviation arrangement method driven by production yield under technique parametric variation |
| CN101488142A (en) * | 2008-12-09 | 2009-07-22 | 南京大学 | Three-dimensional solid model retrieval method based on face topological interconnection constraint |
| CN104183019A (en) * | 2013-05-20 | 2014-12-03 | 三菱电机株式会社 | Method for Reconstructing 3D Lines |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106156437A (en) | 2016-11-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101675458B (en) | The automatic generation of the assembling instruction of building element model | |
| Renner et al. | Genetic algorithms in computer aided design | |
| US20100318327A1 (en) | Method of design optimisation | |
| CN108763827B (en) | Transmission tower finite element model establishing method and device | |
| CN104239601A (en) | Simulation of an assembly of fabric pieces | |
| EP3086293B1 (en) | Simulation device | |
| CN109388840B (en) | Special programming computer for numerical simulation of metal forming processes with predefined load paths and corresponding grid adjustment schemes | |
| CN106156437B (en) | The automatic structured data for calculating product is realized by interconnection constraint multiaxis simulation figure | |
| CN115270500A (en) | Boolean difference calculation method and device and electronic equipment | |
| CN114237259B (en) | Floating resource-based multi-agent path planning method, navigation server and readable storage medium | |
| Quagliarella et al. | Sub-population policies for a parallel multiobjective genetic algorithm with applications to wing design | |
| US9639992B2 (en) | Methods and systems for multilevel editing of subdivided polygonal data | |
| CN113627646B (en) | Path planning method, device, equipment and medium based on neural network | |
| CN102495751A (en) | Method and device for realizing simulation scene | |
| Katz | Parametric description of bridge structures | |
| JP6559582B2 (en) | Behavior control system, method and program thereof | |
| Jones | Interoperable software for parametric structural analysis and optimization | |
| CN102289749A (en) | Method for sequencing tasks based on multi-agent concerted evolution | |
| Aghaei Meibodi | Generative Design Exploration: Computation and Material Practice | |
| CN111781920B (en) | Automatic driving method, apparatus and storage medium | |
| JP2008299641A (en) | Parallel solving method of simultaneous linear equations and node sequencing method | |
| Renner | Genetic algorithms in computer-aided design | |
| Lynch | Swarmsim: A framework for execution and visualization of drone swarm simulations | |
| Stouffs et al. | A software environment for designing through robotic fabrication | |
| CN108121868A (en) | A kind of space face domain generation method and system based on KDtree for sheet metal component modeling |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20190726 Address after: 610041 China (Sichuan) Free Trade Pilot Zone 1114, No. 1616 Nanhua Road, Chengdu High-tech Zone Applicant after: Sichuan Pingyue Technology Co., Ltd. Address before: 610072 No. 902, 13th Floor, Building No. 27, Qinglong Street, Qingyang District, Chengdu City, Sichuan Province Applicant before: Chengdu easy for Information Technology Co., Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: Structured data for obtaining automatic calculation product through association and constraint multi-axial simulation graphs Effective date of registration: 20200608 Granted publication date: 20190903 Pledgee: Zhejiang Mintai commercial bank Limited by Share Ltd. Chengdu Gaoxin Branch Pledgor: Sichuan Pingyue Technology Co.,Ltd. Registration number: Y2020510000063 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right |