CN112462689B - Method for generating handicraft digital model random carving four-axis three-linkage cutter path - Google Patents
Method for generating handicraft digital model random carving four-axis three-linkage cutter path Download PDFInfo
- Publication number
- CN112462689B CN112462689B CN202011434774.7A CN202011434774A CN112462689B CN 112462689 B CN112462689 B CN 112462689B CN 202011434774 A CN202011434774 A CN 202011434774A CN 112462689 B CN112462689 B CN 112462689B
- Authority
- CN
- China
- Prior art keywords
- model
- processing target
- raw material
- target model
- digital model
- 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
Images
Classifications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B19/00—Programme-control systems
- G05B19/02—Programme-control systems electric
- G05B19/18—Numerical control [NC], i.e. automatically operating machines, in particular machine tools, e.g. in a manufacturing environment, so as to execute positioning, movement or co-ordinated operations by means of programme data in numerical form
- G05B19/19—Numerical control [NC], i.e. automatically operating machines, in particular machine tools, e.g. in a manufacturing environment, so as to execute positioning, movement or co-ordinated operations by means of programme data in numerical form characterised by positioning or contouring control systems, e.g. to control position from one programmed point to another or to control movement along a programmed continuous path
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B2219/00—Program-control systems
- G05B2219/30—Nc systems
- G05B2219/35—Nc in input of data, input till input file format
- G05B2219/35349—Display part, programmed locus and tool path, traject, dynamic locus
Abstract
The invention discloses a method for generating a handicraft digital model random engraving four-axis three-linkage tool path, which mainly relates to the technical field of numerical control machining; the method comprises the following steps: s1, obtaining a raw material three-dimensional digital model of the raw material to be processed; s2, importing a raw material three-dimensional digital model and a processing target model; s3, rigidly aligning the three-dimensional digital model of the raw material with the processing target model; s4, carrying out grid deformation on the processing target model based on the raw material three-dimensional digital model; s5, adding a supporting block for the processing target model to obtain an edited processing target model; s6, slicing the edited processing target model; s7, generating a four-axis triple-linkage machining tool path of the machining target model by using the sliced data; the invention can reduce the consumption of raw materials in the engraving process, each engraving finished product is different and can be customized individually, and the operation of the whole process is simple and efficient.
Description
Technical Field
The invention relates to the technical field of numerical control machining, in particular to a method for generating a handicraft digital model type-following carving four-axis three-linkage cutter path.
Background
In modern society, numerical control machining center is as the important equipment of machine tooling, and its application is increasingly extensive. How to obtain the numerical control machining code quickly and accurately is an important subject when a numerical control machining center is applied to production and machining. On the other hand, with the development of the machine engraving industry, CNC (computer numerical control) engraving machines are increasingly used in the handicraft engraving industry, and the market also puts higher and more diversified demands on the machine engraving of the handicraft, such as: and carrying out deformation random carving on the processing target model according to the raw material model, and carrying out customized personalized carving according to the requirements of customers.
At present, there are many kinds of software available on the market for auxiliary programming of a numerical control machining center, for example: UNIGRAPHICS of EDS company, I-DEAS of SDRC company, AutoCAD of Auto DESK company, PowerMill of Delcam Pc company, SolidWorks of Solid Works company, etc., and these large-scale professional software have corresponding CAM (computer aided manufacturing) modules, which can convert the three-dimensional entity data generated in the design process into corresponding numerical control processing programs, and then transmit the programs to a machine tool for processing through some communication interfaces.
In the present situation of China, when an artwork processing enterprise is engaged in production and processing behaviors, the following two modes generally exist, and certain problems exist.
The first mode is to use the existing three-dimensional digital model of the handicraft without model deformation and directly without modification to carry out numerical control machining programming by using auxiliary programming software of a numerical control machining center to obtain a corresponding numerical control machining program, and then carry out machining and engraving. The method can not deform along with the carving of the raw materials, the processed finished products are uniform, the raw materials can not be well utilized, the individual requirements of consumers can not be met, the selling price is low, and the profits obtained by enterprises are limited.
The second mode is that professional three-dimensional modeling software such as 3ds Max, Maya, Rhino3D NURBS and the like is used for modifying and deforming the existing three-dimensional digital model of the handicraft according to the requirements, and then the modified and deformed three-dimensional digital model is input into auxiliary programming software of a numerical control machining center to generate a machining path for machining. This kind of mode does not have the commonality, needs to carry out independent processing to each three-dimensional digital model, and efficiency is comparatively low, and operating personnel need higher learning cost, has both increased the human resource cost to the enterprise, has also lengthened production cycle, is unfavorable for enterprise's production.
Disclosure of Invention
The invention aims to solve the problems in the prior art and provides a method for generating an artware digital model random engraving four-axis three-linkage cutter path, which is used for deforming the existing artware digital model under the constraint of a raw material model obtained by scanning, then generating a four-axis three-linkage numerical control processing program, namely a processing cutter path, and engraving, so that the consumption of raw materials in the engraving process can be reduced, each engraving finished product is different and can be customized individually, and the operation of the whole process is simple and efficient.
In order to achieve the purpose, the invention is realized by the following technical scheme:
the method for generating the handicraft digital model type-following carving four-axis three-linkage tool path comprises the following steps:
s1, obtaining a raw material three-dimensional digital model of the raw material to be processed;
s2, importing a raw material three-dimensional digital model and a processing target model;
s3, rigidly aligning the three-dimensional digital model of the raw material with the processing target model;
s4, carrying out grid deformation on the processing target model based on the raw material three-dimensional digital model;
s5, adding a supporting block for the processing target model to obtain an edited processing target model;
s6, slicing the edited processing target model;
and S7, generating a four-axis triple-linkage machining tool path of the machining target model by using the sliced data.
Preferably, the specific method of step S1 is: and scanning the raw material to be processed by using a three-dimensional scanner based on the calibration points to obtain a three-dimensional digital model of the raw material, and simplifying the grid to a certain degree to obtain the three-dimensional digital model of the raw material.
Preferably, in step S2: and rendering and displaying the imported raw material three-dimensional digital model and the processing target model.
Preferably, the rigid alignment method in step S3 is alignment based on a directional bounding box, including generation of a directional bounding box and alignment based on a directional bounding box;
the generation step of the directed bounding box comprises the following steps: firstly, extracting a long axis and a short axis of a model by adopting a principal component analysis method, and then constructing a directional bounding box;
the step of alignment based on the directional bounding box is as follows: firstly, generating directed bounding boxes for a processing target model and a raw material three-dimensional digital model respectively; then, solving an affine transformation matrix T between the directed bounding box of the processing target model and the directed bounding box of the raw material three-dimensional digital model; and finally, applying transformation T to the processing target model.
Preferably, the step S4 specifically includes the steps of:
s41, selecting a deformation area;
s42, selecting a proper step distance lambda to carry out ARAP deformation;
s43, judging whether the deformed processing target model collides with the three-dimensional digital model of the raw material or not;
and S44, if no collision occurs, the step S42 is carried out, and if the collision occurs, the deformation result of the previous step is returned.
Preferably, the step S5 specifically includes the steps of:
s51, introducing a support block model;
and 52, performing AND operation on the processing target model and the supporting block model, wherein the AND operation is to call a mesh _ bolean () function in an open source computer graphics library libigl, perform AND operation on the processing target model and the supporting block model, and take the AND operation result as a new processing target model.
Preferably, the step S6 specifically includes the steps of:
s61, selecting a proper slice layer height d;
s62, according to the edited minimum value z of the z coordinate of the processing object model min And the current layer number n is obtained, and the current layer height h is equal to z min + nd (n ═ 0, 1.., s), where
S63, solving an intersection set of the edited processing target model and the space plane z ═ h;
and S64, sequencing the vertexes on the intersection point set to obtain a current layer slicing result ordered intersection point set.
Preferably, the step S7 specifically includes the steps of:
s71, obtaining a preliminary tool path according to the slicing data in the step S6;
and S72, performing interference processing.
Compared with the prior art, the invention has the beneficial effects that:
1. the invention can realize semi-automatically obtaining the deformation model of the existing processing target model according to different shapes of processing raw materials, and carries out collision detection in the deformation process, thereby ensuring that the deformed processing target model is always in the boundary constraint range of the raw material model, and leading the processing target model to be more matched with and carve the raw materials on the basis of not causing empty carving so as to realize the free carving;
2. although the existing computer aided design software can also adjust and deform a machining target model, the existing computer aided design software is expensive in price and complex in operation, needs experienced workers to respectively adjust each model, cannot ensure the inclusion and inclusion relationship between the machining target model and a raw material model, and is high in cost and low in efficiency; the method can perform personalized deformation carving aiming at different models and carving raw materials semi-automatically, can quickly generate a four-axis three-linkage cutter path, is simple to operate, and hardly needs manual post-processing.
Drawings
FIG. 1 is an overall flow diagram of the present invention;
FIG. 2 is a schematic diagram showing a rigid alignment before and after alignment;
FIG. 3 is a flow chart of mesh deformation of a processing target model;
FIG. 4 is a comparison of a mesh deformation operation performed on a machining target model;
FIG. 5 is a schematic diagram of control points and free points;
FIG. 6 is an ARAP modification flow chart;
FIG. 7 is a view of the vertex v i And its corresponding unit C i ；
FIG. 8 is an effect view after the addition of the support block;
FIG. 9 is v 0 ，v 1 ，v 2 A graph of position relationship with z as h;
FIG. 10 is a schematic view of a ball nose tool;
FIG. 11 is a schematic view of a miter blade;
FIG. 12 is a schematic view of a flat bed knife.
Detailed Description
The invention will be further illustrated with reference to the following specific examples. It should be understood that these examples are for illustrative purposes only and are not intended to limit the scope of the present invention. Further, it should be understood that various changes or modifications of the present invention may be made by those skilled in the art after reading the teaching of the present invention, and these equivalents also fall within the scope of the present application.
Example (b): as shown in fig. 1-12, the invention relates to a method for generating a handicraft digital model engraving tetraxial triple-linkage tool path, which comprises the following steps:
and S1, acquiring a raw material three-dimensional digital model of the raw material to be processed, specifically, scanning the raw material to be processed by using a three-dimensional scanner to obtain the raw material three-dimensional digital model, preferably, scanning by using a three-dimensional scanner based on a calibration point to obtain the raw material three-dimensional digital model with the lowest precision of 0.05mm, and carrying out grid simplification to a certain extent to facilitate subsequent calculation processing.
And S2, importing the raw material three-dimensional digital model B and the processing object model D, and preferably, rendering and displaying the imported raw material three-dimensional digital model B and the processing object model D.
S3, rigidly aligning the three-dimensional digital model of the raw material with the processing target model;
preferably, the rigid alignment method in step S3 is alignment based on a directional bounding box, including generation of a directional bounding box and alignment based on a directional bounding box;
the generation step of the directed bounding box comprises the following steps: firstly, extracting a long axis and a short axis of a model by adopting a principal component analysis method, and then constructing a directional bounding box;
the method for extracting the long axis and the short axis of the model by adopting the principal component analysis method comprises the following specific steps:
first, model vertex data is represented by P ═ x i ，y i ，z i ) And (i ═ 0, 1.., n); these three-dimensional data are stored in three vectors X ═ X 1 ，x 2 ，...，x n ]，Y＝[u 1 ，y 2 ，...，y n ]，Z＝[z 1 ，z 2 ，...，z n ]In the method, a principal component analysis method is adopted to analyze three dimensions, and the steps are as follows: firstly, data goes to a center; then solving a covariance matrix; solving an eigenvalue and an eigenvector of the covariance matrix; three axes L of the bounding box are obtained，W，H；
The specific steps of constructing the oriented bounding box are as follows:
after obtaining three axes of the directional bounding box, 8 vertexes v of the bounding box can be easily obtained 1 、v 2 、v 3 、v 4 、v 5 、v 6 、v 7 、v 8 And center C; from this, the bounding box can be uniquely determined; for simplifying the operation, converting the points from the current O, x, y and z coordinate system to a C, l, w and h coordinate system, wherein O, x, y and z are a global coordinate system, and C, l, w and h are local coordinate systems;
orthogonal frame conversion; obtaining a range boundary and a bounding box vertex under C, l, w, h coordinates; and converting the bounding box vertex to be under an O, x, y and z coordinate system, and finishing the construction of the bounding box OBB.
The step of aligning based on the directional bounding box is as follows: first, a directed bounding box D is generated for each of the processing target model D and the raw material model B Box And B Box (ii) a Then solve for D Box And B Box An affine transformation matrix T therebetween; finally, the transformation T is applied to the processing target model D to obtain a model D', and the comparison before and after rigid alignment is shown in the attached figure 2.
S4, carrying out grid deformation on the processing target model based on the raw material three-dimensional digital model;
preferably, the step S4 specifically includes the steps of:
s41, selecting a deformation area;
the specific method for selecting the deformation area comprises the following steps: firstly, an A-star path-finding algorithm is adopted to obtain a control point in deformation, and then adjacent points in a certain range are selected around the control point to serve as free points.
Obtaining a control point in deformation by adopting an A-star path-finding algorithm, and firstly, interactively selecting two vertexes V on a processing target model through a mouse by a user S And V E . The specific method comprises the following steps: acquiring screen coordinates clicked by a user; the screen coordinate is processed through a screen coordinate system, a cutting coordinate system and matrix transformation from a camera coordinate system to a model coordinate system, and a triangular surface in the processing target model is obtained through a ray picking algorithmTablet F S And F E Selecting the first vertex in each patch as V s And V E 。
Will V s And V E The method is used as a starting point and a terminating point of an A-star path finding algorithm, then the A-star path finding algorithm is used for obtaining a shortest path between the two points, and all vertexes on a triangular surface patch where the vertexes on the path are located are used as control points. The specific method comprises the following steps:
(a) initial vertex V s Adding into close table;
(b) acquiring the last node S of the close table;
(c) all points around the S point which are not in the close table and not in the open table are obtained, and the open table is added;
(d) calculating the F values of all vertexes in the open list, and obtaining a vertex T with the lowest F value;
(e) deleting T from the open table and adding T into the close table at the same time;
(f) judging the termination point V E If the vertex is in the close table, terminating the operation and obtaining a set P containing all the vertexes on the shortest path; otherwise, executing step (b).
Wherein: the open table is a list for recording all vertexes considered to find the shortest path;
the close table is a list for recording vertexes which are not considered any more, namely, vertexes which are already walked are recorded in the close table; g is the cost of consumption from the starting point to the current vertex, H is the estimated cost from a vertex to the ending point, H is | V in this example E -V C |，V E To terminate the vertex, V C Is the current vertex.
All vertexes contained in the triangular surface patch where the vertexes in the P are located are set as control points, then every 4 control points are spaced, neighborhood vertexes in a certain range around the control points are taken as deformation free vertexes, and a union set of the free vertexes corresponding to all the control points is taken as a free point set of grid deformation. The schematic diagram of the control points and the free points is shown in figure 5.
S42, selecting a proper step distance lambda to carry out ARAP deformation; the method specifically comprises the following steps: and setting an input grid, and constraining the fixed position set by the control point to ensure the deformation of the rigid grid.
And setting an input grid, and taking the processing target model grid as an input grid S of the deformation operation.
Fixed position constraints are set, and in this example, the positions of the control points can be set as: and the position p' of the current control point after moving the proper step distance lambda along the normal direction of the point is p + lambda n, and n is a normal vector of the point p.
And combining the input grid information, the control point set and free point set information and the fixed position constraint information to carry out rigidity-guaranteeing grid deformation. The ARAP transformation process is shown in fig. 6, and comprises: firstly, acquiring adjacent information of a mesh vertex, wherein the mesh vertex and a 1-neighborhood triangular patch form a unit; secondly, defining the rigid energy of each unit, and summing to obtain the integral rigid energy; thirdly, determining an initial guess of the vertex coordinates after deformation; fourthly, using the coordinates of the vertex after the current deformation to calculate the optimal rotation matrix of all the deformation units by using singular value decomposition; and fifthly, solving a linear equation set by using the current optimal rotation matrix to obtain a new vertex coordinate. And sixthly, repeating the fourth step and the fifth step until the integral rigidity energy is less than the threshold set by the user.
First, adjacency information of the input mesh S is acquired. Let the vertex v i Form a unit C with its 1-neighborhood triangular patch i As shown in fig. 7. Defining the rigid energy of each unit, and summing to obtain the overall rigid energy:
wherein S is an input grid, and S' is a deformed input grid; e (S') is the stiffness energy of the entire mesh; n is the number of vertexes in the input grid S; n (i) is the sum of vertex v i A set of adjacent vertices; w is a ij Is an edge e ij Is given by weight of
α ij And beta ij Is an edge e ij Two opposite corners of (a); p is a radical of i Is a vertex v i The position of (a); p is a radical of i Position after deformation is p i ′，p j Is a vertex v j The position of (a); p is a radical of j Position after deformation is p j ′；R i Is a unit C i And transforming the rotation matrixes before and after.
By minimizing the stiffness energy E (S'), a most rigid deformation of the mesh is possible.
Subsequently, the transformed vertex coordinates p are determined i Initial guess of'. For a selected control point, its initial guess is a fixed position constraint that was set previously. For the free point, the initial guess is determined by minimizing | Lp' - δ | purple cells 2 An implementation is where δ — Lp, p is the coordinates of the vertices in the initial mesh input by the user, and p' is the coordinates of the vertices in the mesh after the control point coordinates have changed according to the fixed position constraint described above. | Lp' -delta | ceiling 2 To achieve the minimum, Lp' may be obtained as Lp, where the matrix L is defined as follows:
by further calculation and simplification, one can obtain: a. the T AX free ＝A T (Lp-BX fixed ) Solving the equation system to obtain X free I.e. the initial guess of the free point. Wherein A is a matrix composed of columns corresponding to subscripts of free vertexes in the matrix L, and X is free Is the coordinate of free vertex and is unknown quantity, B is the matrix formed by the columns corresponding to fixed vertex subscript in matrix L, X fixed The coordinates of the vertices are fixed, including the control points and the remaining vertices in the mesh S.
Using the current post-deformation vertex coordinates p i ' the optimal rotation matrix of all the deformation units is calculated by using singular value decomposition.
And solving a linear equation set by using the current optimal rotation matrix to obtain a new vertex coordinate. When Ri is determined, the p 'required to minimize E (S') can be determined by solving a system of linear equations
Implementation, for each p i The following equation can be derived:
the linear combination on the left side of the equation is the discrete laplacian-bertelameter of p', so the system of equations can be written as: lp' ═ b. Solving the system of equations to obtain p'.
In the next iteration, new R and p 'are solved by taking the newly obtained p' as a known quantity, and the process is repeated until the grid rigidity energy is smaller than a threshold value specified by a user.
S43, judging whether the deformed processing target model collides with the three-dimensional digital model of the raw material or not;
the collision detection comprises the following specific steps:
(a) building a BVH (Bounding Volume Hierarchy Bounding box) tree for the raw material model;
(b) circularly traversing each triangular patch F in the deformation region of the processing target model i To F i Construction of its AABB bounding Box B i (Axially-aligned bounding Box axis aligned);
(c) adding a root node of the raw material model BVH tree into a queue Q;
(d) popping up the top element of the Q team, and judging the current Node j Whether the Node is a leaf Node of the raw material model BVH tree or not, if the Node is a leaf Node of the raw material model BVH tree j If the leaf node is the current triangular patch F i And Node j Corresponding triangular patch F j Form a triangular patch pair (F) i ，F j ) Adding a candidate set; if Node j If not, judging B i Node with current Node j Left and right sub-nodes Node p And Node q The intersection of (A) and (B) i Adding the crossed nodes into a queue Q;
(e) repeating (d) until the Q queue is empty.
(f) For all triangular patch pairs (F) in the candidate set i ，F j ) And (4) carrying out accurate intersection judgment, judging that no collision exists if two triangular patches in all the triangular patch pairs are not intersected, and otherwise, judging that collision occurs.
For triangular patch pair (F) i ，F j ) Carrying out accurate intersection judgment, and specifically judging F in sequence i Three sides e in 0 ，e 1 ，e 2 And F j Whether the two are crossed is judged, and then F is judged in sequence j Three sides of (1) and (F) i And if the intersection judgment results are non-intersection, the two triangles are not intersected, otherwise, the two triangles are intersected.
The method for judging the intersection relation between the edge and the triangle is as follows, and F is used i Edge e in 0 ＝p 0 -p 1 And F j The intersection judgment of (1) is as follows: defining matrix D ═ p [ ("p 0 -p 1 )，(t 1 -t 0 )，(t 2 -t 0 )]The vector c is equal to p 0 -v 0 Calculating s ═ D -1 c, if the following conditions are satisfied, e 0 And F j Intersect, otherwise do not.
Wherein p is 0 ，p 1 Is an edge e 0 Two break points of, t 0 ，t 1 ，t 2 Is F j Three vertices in (1).
And S44, if no collision occurs, the step S42 is carried out, and if the collision occurs, the deformation result of the previous step is returned.
S5, adding a supporting block for the processing target model to obtain an edited processing target model;
the step S5 specifically includes the steps of:
s51, introducing a support block model;
and 52, performing and operation on the processing target model and the supporting block model, wherein the and operation is to call a mesh _ bolean () function in an open source computer graphics library libigl, perform and operation on the processing target model and the supporting block model, take the and operation result as a new processing target model, and add the supporting block as shown in fig. 8.
S6, slicing the edited processing target model;
the step S6 specifically includes the steps of:
s61, selecting a proper slice layer height d;
s62, according to the edited minimum value z of the z coordinate of the processing object model min And the current layer number n is obtained, and the current layer height h is equal to z min + nd (n ═ 0, 1.., s), where
S63, solving an intersection set of the edited processing target model and the space plane z ═ h;
the specific method comprises the following steps: traversing all triangular patches in the processing target model to obtain the minimum value z of the z-axis component of the triangular patches imin And maximum value z imax All satisfy z imin H is less than or equal to h and z imax And adding the set F into the triangular patch of more than or equal to h. Circularly traversing all the triangular patches in the F to obtain two intersection points p of each triangular patch and the plane z ═ h 0 And p 1 ：
p 0 ＝v 0 +(v 1 -v 0 )×(h-v 0 )/(v 1 -v 0 )
p 1 ＝v 0 +(v 2 -v 0 )×(h-v 0 )/(v 2 -v 0 )
Wherein v is 0 ，v 1 ，v 2 The three vertexes of the triangular patch are in the position relation as shown in figure 9, v 0 On one side of plane z ═ h, v 1 ，v 2 On the other side.
And S64, sequencing the vertexes on the intersection point set to obtain a current layer slicing result ordered intersection point set.
The method comprises the following steps:
(a) defining a set of ordered vertices P sorted ；
(b) For any vertex p in the unordered intersection point set i To obtain p i Is traversed through each vertex p in the set of contiguous vertices j If p is j Has added P sorted Skipping; if p is j Without addition of P sorted Then p will be j Adding P sorted And let p be i ＝p j ；
(c) Repeating step (b) until p i All adjoining vertices have joined P sorted 。
And S7, generating a four-axis triple-linkage machining tool path of the machining target model by using the sliced data.
S71, according to the slice data P in the step S6 sorted Obtaining a preliminary tool path;
the method specifically comprises the following steps:
calculating P sorted Each vertex p in i Cylindrical surface coordinate (r) i ，θ i ，z i )(r i ≥0，0≤θ i ≤2π，z∈R)，(r i ，θ i ，z i ) To rectangular coordinate (x) i ，y i ，z i ) The relationship of (a) to (b) is as follows:
the coordinate of the cylindrical expansion map of the point is (z) i ，θ i /π×180，r i ) Noting the cylindrical surface development map coordinate as p c (ii) a The coordinate p of the tool location point in the preliminary tool path l Comprises the following steps:
wherein R is the radius of the cutter, R is the radius of the cutter angle, n t Is the normal vector of the cutter shaft, n s Is a point p c The normal vector of (1). The ball-point cutter is shown in figure 10, the angle cutter is shown in figure 11, and the flat-bottom cutter is shown in figure 12.
All p are l Are smoothly connected to form a preliminary tool path L.
And S72, performing interference processing.
The method mainly comprises the following steps: for each p l Through p l Drawing a straight line parallel to the z-axis, solving the intersection point of the straight line and the L to obtain a point set P, and taking the point P with the maximum z coordinate in the P o As a final tool path L output The point of (1).
Will be the final L output And outputting the points to the nc file, and processing the points.
According to the method, a collision detection step is added in a grid deformation process of a processing target model, so that the deformation of the processing target model is always within the boundary constraint range of a raw material model; slicing the processing target model, and sequencing new vertex information obtained by slicing each layer; generating a preliminary four-axis triple-linkage tool path by calculating the coordinates of the cylindrical surface and the coordinates of the cylindrical surface development image and combining the information of the specific tool model by using the vertex information obtained by the sequenced slices; and performing interference processing on the preliminary tool path. The deformation model of the existing processing target model can be obtained semi-automatically according to different shapes of the processing raw materials, and the processing target model can be matched with the carving raw materials on the basis of not causing empty carving so as to realize random carving; the semi-automatic engraving machine can perform personalized deformation engraving on different models and engraving raw materials semi-automatically, can quickly generate a four-axis three-linkage tool path, is simple to operate, and almost does not need manual post-processing. The invention can also be used for other circular carving scenes.
Claims (7)
1. The method for generating the handicraft digital model type-following carving four-axis three-linkage tool path is characterized by comprising the following steps of:
s1, obtaining a raw material three-dimensional digital model of the raw material to be processed;
s2, importing a raw material three-dimensional digital model and a processing target model;
s3, rigidly aligning the three-dimensional digital model of the raw material with the processing target model;
s4, carrying out grid deformation on the processing target model based on the raw material three-dimensional digital model;
the step S4 specifically includes the steps of:
s41, selecting a deformation area;
s42, selecting a proper step distance lambda to carry out ARAP deformation;
s43, judging whether the deformed processing target model collides with the three-dimensional digital model of the raw material or not;
s44, if no collision occurs, the step S42 is carried out, and if the collision occurs, the deformation result of the previous step is returned;
s5, adding a supporting block for the processing target model to obtain an edited processing target model;
s6, slicing the edited processing target model;
and S7, generating a four-axis triple-linkage machining tool path of the machining target model by using the sliced data.
2. The method for generating the engraving tetraxial and triple-linkage tool path with the handicraft digital model as claimed in claim 1, wherein the specific method of the step S1 is as follows: and scanning the raw material to be processed by using a three-dimensional scanner based on the calibration points to obtain a three-dimensional digital model of the raw material, and simplifying the grid to a certain degree to obtain the three-dimensional digital model of the raw material.
3. The method for generating an engraving followed by four-axis three-linkage tool path for handicraft digital model according to claim 1, wherein in said step S2: and rendering and displaying the imported raw material three-dimensional digital model and the processing target model.
4. The method for generating an engraving tetraxial three-motion tool path with a handicraft digital model according to claim 1, wherein the rigid alignment method in step S3 is alignment based on directional bounding box, comprising generation of directional bounding box and alignment based on directional bounding box;
the generation step of the directed bounding box comprises the following steps: firstly, extracting a long axis and a short axis of a model by adopting a principal component analysis method, and then constructing a directional bounding box;
the step of aligning based on the directional bounding box is as follows: firstly, generating directed bounding boxes for a processing target model and a raw material three-dimensional digital model respectively; then, solving an affine transformation matrix T between the directed bounding box of the processing target model and the directed bounding box of the raw material three-dimensional digital model; and finally, applying transformation T to the processing target model.
5. The method for generating an engraving follower four-axis three-linkage tool path for handicraft digital models as claimed in claim 1, wherein said step S5 specifically comprises the steps of:
s51, introducing a support block model;
and 52, performing AND operation on the processing target model and the supporting block model, wherein the AND operation is to call a mesh _ bolean () function in an open source computer graphics library libigl, perform AND operation on the processing target model and the supporting block model, and take the AND operation result as a new processing target model.
6. The method for generating an engraving followed by a four-axis three-linkage tool path for a digital model of handicraft according to claim 1, wherein said step S6 specifically comprises the steps of:
s61, selecting a proper slice layer height d;
s62, according to the edited minimum value z of the z coordinate of the processing object model min And the current layer number n is obtained, and the current layer height h is equal to z min + nd (n ═ 0, 1.., s), where
S63, solving an intersection set of the edited processing target model and the space plane z ═ h;
and S64, sequencing the vertexes on the intersection point set to obtain a current layer slicing result ordered intersection point set.
7. The method for generating an engraving followed by a four-axis three-linkage tool path for a digital model of handicraft according to claim 1, wherein said step S7 specifically comprises the steps of:
s71, obtaining a preliminary tool path according to the slicing data in the step S6;
and S72, performing interference processing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011434774.7A CN112462689B (en) | 2020-12-10 | 2020-12-10 | Method for generating handicraft digital model random carving four-axis three-linkage cutter path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011434774.7A CN112462689B (en) | 2020-12-10 | 2020-12-10 | Method for generating handicraft digital model random carving four-axis three-linkage cutter path |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112462689A CN112462689A (en) | 2021-03-09 |
| CN112462689B true CN112462689B (en) | 2022-08-02 |
Family
ID=74801771
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011434774.7A Active CN112462689B (en) | 2020-12-10 | 2020-12-10 | Method for generating handicraft digital model random carving four-axis three-linkage cutter path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112462689B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115366568B (en) * | 2022-07-28 | 2023-08-01 | 河海大学常州校区 | Self-adaptive olive pit conformal carving method and system |
| CN117476509B (en) * | 2023-12-27 | 2024-03-19 | 联合富士半导体有限公司 | Laser engraving device for semiconductor chip product and control method |
Family Cites Families (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101000499A (en) * | 2006-12-18 | 2007-07-18 | 浙江大学 | Contour machining method and system based on multi-sensor integral measuring |
| CN101274577A (en) * | 2008-04-09 | 2008-10-01 | 徐鸿斌 | Digital simplified molding process for sculpture sample manuscript |
| CN102054296A (en) * | 2011-01-20 | 2011-05-11 | 西北大学 | Grid deformation method based on local rigidity |
| US20130150994A1 (en) * | 2011-12-08 | 2013-06-13 | Wesley V. Barbir | Method of carving three-dimensional artwork |
| BG66663B1 (en) * | 2012-07-02 | 2018-04-30 | Чавдаров Тодоров Красимир | A method for converting a three-dimensional digital model into a spatial object of sheet material |
| CN104143209B (en) * | 2014-06-20 | 2017-05-17 | 浙江工业大学 | Method for engraving three-dimensional model based on line pattern |
| CN107689254B (en) * | 2016-08-03 | 2021-02-19 | 佛山市诺威科技有限公司 | Digital generation method for outer surface of full-crown prosthesis |
| CN107221033A (en) * | 2017-04-20 | 2017-09-29 | 中国科学院计算技术研究所 | A kind of method that rigid deformation is carried out to threedimensional model |
| CN109801367B (en) * | 2019-02-25 | 2023-01-13 | 广西大学 | Grid model characteristic editing method based on compressed manifold mode |
| CN110245442A (en) * | 2019-06-20 | 2019-09-17 | 广东三维家信息科技有限公司 | A kind of analogy method and device of door-plate engraving process |
-
2020
- 2020-12-10 CN CN202011434774.7A patent/CN112462689B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN112462689A (en) | 2021-03-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110516388B (en) | Harmonic mapping-based curved surface discrete point cloud model circular cutter path generation method | |
| Huang et al. | Block pattern generation: From parameterizing human bodies to fit feature-aligned and flattenable 3D garments | |
| US8175734B2 (en) | Methods and system for enabling printing three-dimensional object models | |
| US8089480B2 (en) | Method for meshing a curved surface | |
| CN112462689B (en) | Method for generating handicraft digital model random carving four-axis three-linkage cutter path | |
| CN107622530B (en) | Efficient and robust triangulation network cutting method | |
| CN107452058B (en) | Simulation model range-dividing simplification method generation and system based on feature preservation | |
| Gan et al. | Five-axis tool path generation in CNC machining of T-spline surfaces | |
| CN115130253A (en) | Generating a refined control mesh for generating a smooth surface of an object | |
| WO1999029479A1 (en) | Method and systems for nesting objects | |
| CN115366568B (en) | Self-adaptive olive pit conformal carving method and system | |
| JP2832463B2 (en) | 3D model reconstruction method and display method | |
| CN110033507A (en) | Line method for drafting, device, equipment and readable storage medium storing program for executing are retouched in model pinup picture | |
| CN115861547A (en) | Model surface sample line generation method based on projection | |
| WO2004053741A1 (en) | Method of calculating intersecions between triangle and line segment and progam therefor | |
| CN113674294A (en) | 3D model slice processing method and device | |
| Bhanu et al. | CAGD based 3-D vision | |
| CN114549795A (en) | Parameterization reconstruction method, parameterization reconstruction system, parameterization reconstruction medium and parameterization reconstruction equipment for shoe tree curved surface | |
| Wang et al. | The Study on the Implementation of Multi-Axis Cutting & Cyber-Physical System on Unity 3D Platform | |
| Inui et al. | Contour-type cutter path computation using ultra-high-resolution dexel model | |
| Bhanu et al. | 3-D model building using CAGD techniques | |
| CN110796729B (en) | Grid division method based on binary tree | |
| Joy et al. | Efficient and Valid Surface Reconstruction for Workpiece Models in Frame-Sliced Voxel Based Machining Simulation | |
| Dang et al. | Vector Field Analysis for optimization of the Tool Path of the Five-Axis Milling Machine | |
| Mocanu et al. | Mesh deformation with hard constraints |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |