Method for obtaining target selection set by scaling frame lines through dichotomy based on CAD (Computer Aided Design)

By using the dichotomous scaling method in CAD, dynamically changing the box line point list, the problem of not being able to adapt to the problem when obtaining the selection set in CAD is solved, and fast and effective selection set acquisition is achieved, improving design efficiency.

CN119004580APending Publication Date: 2024-11-22SHANDONG HUANNENG DESIGN INST
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411036429.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-31
Publication Date
2024-11-22

AI Technical Summary

Technical Problem

During the CAD engineering drawing process, the existing technology cannot obtain the most suitable selection set based on the drawing conditions, which causes designers to spend energy thinking about selecting the optimal solution of the target primitive.

Method used

Using the CAD-based dichotomous method to scale the box line, dynamically change the box line point list until the selection set that meets the requirements is obtained, the center point, initial box line point list, initial selection method, maximum scaling multiple, minimum scaling multiple, Maximum number of loops, initial filter tables, enlarged expressions, and shrink expressions to achieve quick access to selection sets.

Benefits of technology

It is realized that the selection sets that meet the operator's requirements are quickly obtained under known parameters, simplifies engineering drawing operations, avoids inappropriate situations when obtaining the selection sets in the prior art, and improves design efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119004580A_ABST
    Figure CN119004580A_ABST
Patent Text Reader

Abstract

The invention discloses a CAD (computer-aided design)-based method for scaling frame lines by dichotomy to obtain a target selection set, which comprises the following steps of: defining input parameters including a central point, an initial frame line point list, an initial selection mode, a maximum scaling multiple, a minimum scaling multiple, a maximum cycle index, an initial screening table, a temporary parameter name list, an expansion expression and a reduction expression, defining process parameters including a dynamic frame line point list, a dynamic scaling multiple, a dynamic dichotomy interval upper limit and a dynamic dichotomy interval lower limit; stipulating processing modes and processing steps of general conditions and special conditions; and enabling the frame line point list to dynamically change until a selection set meeting requirements is obtained, and outputting a final selection set as a result. According to the method, the effect of rapidly obtaining the selection set meeting the requirements under the condition that the center point, the initial frame line point list, the initial selection mode, the maximum zooming multiple, the minimum zooming multiple, the maximum cycle index, the initial screening table, the expansion expression and the reduction expression are known is achieved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of engineering drawing, and in particular to a method for obtaining a target selection set by scaling a frame line using a dichotomy method based on CAD. Background Art

[0002] In the process of engineering drawing based on CAD, operators need to frequently select, click, and filter certain entities in the drawing to add these entities to a selection set in order to execute certain commands on these entities, such as rotating, deleting, and changing colors.

[0003] As an excellent CAD user, designers must not only learn to obtain selection sets by using the mouse, but also learn to obtain selection sets by using code. CAD itself comes with a function "ssget" for obtaining selection sets, and its optional parameters include selection method, selection point, frame point list, and filter table. Generally speaking, the selection method, selection point, and frame point list determine the position of the target graphics element to be obtained, and the filter table determines the characteristic conditions of the target graphics element to be obtained. A good combination of these parameters can enable designers to achieve the same effect as manual selection, point selection, and filtering at a faster speed. The present invention is related to the three parameters of frame point list, selection method, and filter table.

[0004] Frame Point List: A necessary parameter to determine the position of the target element in the drawing. This parameter is used in conjunction with the selection method parameter. The content of this parameter contains multiple 2D point coordinates.

[0005] Selection method: Parameters that determine the function of the frame line, including "circle", "circle intersection", and "fence selection". Their meanings are "get the primitives that are within the frame line but not touching the frame line", "get the primitives that are within the frame line or touching the frame line", and "get the primitives that touch the frame line". This parameter is bound to the frame line parameter. If this parameter is used, the content of this parameter must be one of the above three methods. Among them, if the selection method is "circle" or "circle intersection", the number of point coordinates in the frame line must be at least 3, the frame line can be regarded as a closed two-dimensional figure, and the ssget function cannot obtain any selection set when the frame line crosses or overlaps; if the selection method is "fence selection", the number of point coordinates in the frame line must be at least 2, and the frame line can be regarded as an unclosed two-dimensional polyline.

[0006] Filter table: A parameter that determines which elements are allowed to be added to the selection set. It is generally used to filter out non-target elements that are mixed between the positions of target elements in the drawing. The content of this parameter includes a set of logical point pairs with unique syntax. This parameter can be omitted, in which case any element is allowed to be added to the selection set.

[0007] In the programming of engineering drawing, designers need to add the graphics elements whose position coordinates meet the requirements to a selection set when the selection method and filter table are determined. Because the position coordinates are involved, it is crucial to calculate the appropriate list of frame points. However, in some cases, the coordinate position of the graphics element is required to be vague and variable, which is a big challenge for designers to conceive a suitable list of frame points.

[0008] In addition, the present invention relates to the concept of dichotomy. The definition of dichotomy is: for a function y=f(x) that is continuous on the interval (a, b) and f(a)·f(b)<0, the method of obtaining an approximate value of the zero point by continuously dividing the interval where the zero point of the function f(x) is located into two, so that the two endpoints of the interval gradually approach the zero point, is called dichotomy. For the present invention, dichotomy can be understood as: by continuously expanding or shrinking the list of frame line points in two around a certain point within its allowed scaling interval, so that the list of frame line points gradually approaches the size that meets the operator's requirements, and then obtains a method of obtaining a selection set that meets the operator's requirements. Dichotomy means high efficiency. The present invention has the ability to realize the division of the scaling interval into three or five, but the division method of dividing into two is more reasonable, so the present invention adopts the dichotomy of dividing the interval into two.

[0009] It should be noted that the present invention is only applicable to the top view perspective in CAD and does not currently support other perspectives.

[0010] The problems existing in the prior art are:

[0011] Designers follow certain principles when selecting target entities. In practice, designers can adapt to the situation according to the drawing conditions while following the principles to obtain the most suitable selection set. However, when the design program executes the step of obtaining the selection set, the program cannot adapt to the drawing conditions, which may result in an inappropriate selection set, forcing designers to spend energy thinking about what fixed principle is the best solution for selecting target entities.

[0012] Let's take an example: when estimating the height of a point on a contour map, the operator needs to obtain about 7 contour lines closest to the point to be measured as a reference. Too few contour lines as reference will lead to inaccurate estimation, and too many contour lines as reference will lead to slow estimation. In actual operation, the operator can adapt to the situation according to the drawing conditions, but when the operator designs the program to perform the operation, he can only consider using a polygon box with a certain side length as a list of frame points to obtain about 7 contour lines near the point to be measured by circling. However, the density of contour lines in different areas on the contour map is inconsistent. The program cannot adapt to the situation of the drawing, which may result in too few or far more than 7 contour lines being obtained, causing the designer to spend energy thinking about how much the side length of the circling polygon box is equal to to obtain the most reasonable number of contour lines.

[0013] The known parameters required by the method of scaling the frame line by binary division to obtain the target selection set are generally the center point, the initial frame line point list, the initial selection method, the maximum scaling factor, the minimum scaling factor, the maximum number of cycles, the initial screening table, the expansion expression, and the reduction expression. The intermediate quantity parameters involved in the present invention mainly include the dynamic frame line point list, the dynamic scaling factor, the upper limit of the dynamic binary division interval, and the lower limit of the dynamic binary division interval. The above parameter concepts and calculation process will be clarified in the text.

[0014] The present invention is dedicated to constructing a dynamically changing frame line point list, which is enlarged or reduced according to the characteristics of the selected set it obtains until it obtains a selected set that meets the requirements. Summary of the invention

[0015] The present invention is to overcome the shortcomings of the above-mentioned prior art and provide a method for obtaining a target selection set by scaling the frame line by dichotomy based on CAD. The present invention achieves the effect of quickly obtaining a selection set that meets the requirements when the center point, the initial frame line point list, the initial selection method, the maximum scaling factor, the minimum scaling factor, the maximum number of cycles, the initial screening table, the expansion expression, and the reduction expression are known.

[0016] The technical solution adopted by the present invention to solve the technical problem is:

[0017] The method for obtaining a target selection set by scaling the frame line in a binary manner based on CAD includes the following steps:

[0018] S1. Define input parameters, including center point, initial frame point list, initial selection method, maximum zoom factor, minimum zoom factor, maximum number of cycles, initial screening table, temporary parameter name list, enlargement expression, reduction expression, and define process parameters, including dynamic frame point list, dynamic zoom factor, dynamic dichotomy interval upper limit, and dynamic dichotomy interval lower limit;

[0019] S2. Specify the methods and procedures for handling general and special situations;

[0020] S3. Make the list of frame points change dynamically until a selection set that meets the requirements is obtained, and output the final selection set as a result.

[0021] The parameters in step S1 include:

[0022] S1-1. Center point: Enter the two-dimensional point around which the frame point list is dynamically scaled;

[0023] S1-2, initial frame point list: input the initially given frame point list, and the initial frame point list is used as the frame point list when the program performs the first cycle;

[0024] S1-3, initial selection method: input one of "circle", "circle intersection" and "fence selection";

[0025] S1-4, maximum scaling factor: given the upper limit of the initial dichotomy interval;

[0026] S1-5, minimum scaling factor: given the lower limit of the initial dichotomy interval;

[0027] S1-6, Maximum number of cycles: indicates the upper limit of the number of times the frame point list can be dynamically changed, and determines the degree of subdivision of the binary method;

[0028] S1-7, Initial Screening Table: Enter the grammatically correct logical point pairs that correctly express the allowed graphics elements in the selection set that meet the requirements;

[0029] S1-8, temporary parameter name list: the list content is all the parameter names used in the expansion expression and reduction expression;

[0030] S1-9, expand expression, reduce expression: input an expression that conforms to CAD syntax respectively;

[0031] S1-10, dynamic frame point list: the frame point list in the binary loop process, which is different from the initial frame point list;

[0032] S1-11, dynamic scaling factor: the scaling factor of a dynamic frame point list compared with the initial frame point list during the binary search loop, used to perform the binary search;

[0033] S1-12, dynamic binary interval upper limit, dynamic binary interval lower limit: the allowable range for dynamic changes in a dynamic scaling multiple during the binary cycle. The upper limit of this range is called the dynamic binary interval upper limit, and the lower limit of this range is called the dynamic binary interval lower limit, so as to obtain a dynamically changing binary interval.

[0034] The step S2 comprises:

[0035] S2-1. How to deal with general situations;

[0036] S2-2. How to deal with special situations;

[0037] S2-3. Determine whether binary search needs to be performed.

[0038] The step S2-1 comprises:

[0039] S2-1-1. If the initial frame point list is scaled around the center point to the maximum scaling factor, the selection set obtained by the frame point list at this time should not satisfy the expansion expression;

[0040] S2-1-2, when the minimum zoom factor is not 0, if the initial frame point list is zoomed around the center point to the minimum zoom factor, the selection set obtained by the frame point list at this time should not satisfy the reduction expression;

[0041] S2-1-3, under the premise that S2-1-1 and S2-1-2 are satisfied at the same time, the binary search should be fully carried out, that is, after the last cycle is executed, the binary search should end with the result that both the expansion expression and the reduction expression are not true;

[0042] S2-1-4, when S2-1-1, S2-1-2, and S2-1-3 are satisfied at the same time, the operator obtains a selection set that fully satisfies the requirements through dichotomy;

[0043] The S2-2 includes:

[0044] S2-2-1. Scale the initial frame point list around the center point to the maximum scaling factor. If the selection set obtained from the frame point list at this time satisfies the expansion expression, the selection set should be used as the final result and the binary search method will no longer be performed.

[0045] S2-2-2, when the minimum zoom factor is not 0, the initial frame point list is zoomed around the center point to the minimum zoom factor. If the selection set obtained by the frame point list at this time satisfies the reduction expression, the selection set should be used as the final result and the binary search method is no longer performed;

[0046] S2-2-3: If the binary search is not fully carried out under the premise that S2-1-1 and S2-1-2 are met, the selection set should be taken as the final result and the binary search should be ended with the result of the forced end of the loop;

[0047] S2-2-4. The situation that satisfies one of S2-2-1, S2-2-2, and S2-2-3 is a special case. In special cases, the operator cannot obtain a selection set that fully meets the requirements through dichotomy.

[0048] The S2-3 includes:

[0049] S2-3-1, determine whether the center point is a three-dimensional point, if it is a three-dimensional point, change the center point to a two-dimensional point;

[0050] S2-3-2, scale the initial frame point list around the center point by the maximum scaling factor to obtain a new frame point list, and use the frame point list, initial selection method, and initial filter table as input parameters of the ssget function to obtain a selection set, which is called "ss", and attach the value of the only parameter name in the temporary parameter name list to ss. If the expansion expression is established, define the "direct end flag" as "yes" and let the final result be ss;

[0051] S2-3-3. If the direct end flag is not "yes" and the minimum zoom factor is not 0, the initial frame point list is zoomed around the center point by the minimum zoom factor to obtain a new frame point list, and the frame point list, initial selection method, and initial filter table are used as input parameters of the ssget function to obtain a selection set, which is called "ss". The only parameter name in the temporary parameter name list is assigned the value of ss. If the reduction expression is established, the "direct end flag" is defined as "yes" and the final result is ss.

[0052] S2-3-4. At this point, if the direct end flag is not "yes", binary search is required.

[0053] The step S3 comprises:

[0054] S3-1, if the direct end flag is "yes", the remaining steps of S3 are not executed;

[0055] S3-2, setting the initial value of the dynamic change of the dichotomy;

[0056] S3-3. Perform binary search and output the result.

[0057] The S3-2 includes:

[0058] S3-2-1. If 1∈[minimum zoom factor, maximum zoom factor], the dynamic zoom factor is set to 1; otherwise, the dynamic zoom factor is set to the maximum zoom factor;

[0059] S3-2-2, set the upper limit of the dynamic binary division interval to the maximum zoom factor, and set the lower limit of the dynamic binary division interval to the minimum zoom factor;

[0060] S3-2-3, set the "current number of cycles" to 0;

[0061] S3-2-4. Set “Whether to exit the loop” to “No”.

[0062] The S3-3 includes:

[0063] S3-3-1. When the question of whether to exit the loop is “No” and the current number of loops is less than the maximum number of loops, the steps S3-3-2 to S3-3-8 are executed cyclically:

[0064] S3-3-2, setting the dynamic frame point list to the state after the initial frame point list is dynamically enlarged around the center point by a multiple;

[0065] S3-3-3, using the dynamic frame point list, initial selection method, and initial screening table as input parameters of the ssget function to obtain a selection set, which is called "ss";

[0066] S3-3-4. Add the value ss to the only parameter name in the temporary parameter name list;

[0067] S3-3-5. If the expansion expression is established, first adjust the lower limit of the dynamic dichotomy interval to the value of the dynamic scaling factor, and then adjust the dynamic scaling factor to the average of the lower limit of the dynamic dichotomy interval and the upper limit of the dynamic dichotomy interval;

[0068] S3-3-6. If the reduction expression is established, first adjust the upper limit of the dynamic dichotomy interval to the value of the dynamic scaling factor, and then adjust the dynamic scaling factor to the average of the lower limit of the dynamic dichotomy interval and the upper limit of the dynamic dichotomy interval;

[0069] S3-3-7. If neither the expansion expression nor the reduction expression is true, whether to exit the loop is adjusted to "yes";

[0070] S3-3-8, add 1 to the current number of cycles;

[0071] S3-3-9. Binary search is completed and the ss result is output.

[0072] The step of expanding the variant is also included, and the expanded variant includes:

[0073] S5-1, variants of the final result;

[0074] S5-2, a variation of the dynamic border point list change rule;

[0075] S5-3, maximum zoom factor variant;

[0076] S5-4, variant of temporary parameter name list;

[0077] S5-5, center point, filter table, selection method variants.

[0078] The S5-1 includes:

[0079] S5-1-1 The final result includes at least one set of choices that meets the requirements;

[0080] The S5-4 includes a temporary parameter name list including multiple parameter names, which are used to represent any parameters in the steps. In this case, the operator needs to assign the used parameters to the parameter names in the temporary parameter name list at the appropriate positions in steps S3-2 and S3-3, so that the meaning represented by the parameter name participates in the execution process of the dichotomy.

[0081] The beneficial effects of the present invention are:

[0082] 1. The present invention adopts a method of scaling the frame line by binary division, and the operator inputs known parameters to quickly obtain a selection set that meets the operator's requirements, which facilitates the operation of drawings by practitioners in the field of engineering drawing. It solves the problem in the prior art that the existing program cannot adapt to the drawing conditions when obtaining the selection set, which may result in an inappropriate selection set being obtained, forcing designers to spend energy thinking about what principle is the optimal solution for selecting the target graphic element.

[0083] 2. The present invention has a very wide range of applications and may be helpful to any industry involving engineering drawing. In addition, the present invention briefly describes several variants of the method based on a detailed description of the basic functions of the method of scaling the frame lines by binary division to obtain a target selection set. Cartographers from all walks of life can improve the basic steps of the method to suit their own industry application scenarios on the premise of fully understanding the above variants. If an application scenario in a certain industry is classic enough and different enough from this invention, then practitioners in this industry may be able to build an invention with clearer steps and stronger purpose based on the concept of this invention, and then open up a series of new inventions based on this invention, so as to realize the overall empowerment of the field of engineering drawing. BRIEF DESCRIPTION OF THE DRAWINGS

[0084] Figure 1 Schematic diagram of the preparation for scaling the frame line by bisection to obtain 7 contour lines around a specified point;

[0085] Figure 2 A schematic diagram of the execution process of scaling the frame line by bisection to obtain 7 contour lines around a specified point;

[0086] Figure 3 Schematic diagram of preparation for scaling the frame line by bisection method to obtain the nearest cable trench in the east direction of the specified point;

[0087] Figure 4 The schematic diagram is a process diagram of scaling the frame line by bisection to obtain the nearest cable trench in the east direction of the specified point. DETAILED DESCRIPTION

[0088] In order to enable those skilled in the art to better understand the technical solutions in the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all of the embodiments.

[0089] A CAD-based method for obtaining target selection sets by scaling the frame line in a binary manner, combined with Figure 1-Figure 4 , including the following steps:

[0090] S1. Define the input parameter center point, initial frame point list, initial selection method, maximum zoom factor, minimum zoom factor, maximum number of cycles, initial screening table, temporary parameter name list, expansion expression, reduction expression, and define the process parameter dynamic frame point list, dynamic zoom factor, dynamic dichotomy interval upper limit, and dynamic dichotomy interval lower limit;

[0091] S2. Specify the methods and procedures for handling general and special situations;

[0092] S3, dynamically changing the list of frame points until a selection set that meets the requirements is obtained, and outputting the final selection set as a result;

[0093] S4. Briefly describe practical cases;

[0094] S5. Briefly describe the extended variants.

[0095] The parameters in step S1 include:

[0096] S1-1. Center point: Enter the 2D point around which the frame point list is dynamically scaled. If a 3D point is entered, the z coordinate is ignored and changed to a 2D point. This parameter is generally the location point where the primitive or coordinate to be analyzed is located;

[0097] S1-2, Initial frame point list: Enter the initially given frame point list. This parameter determines the shape of the frame point list in each cycle. The shape of the frame point list in each cycle is similar to the initial frame point list. In addition, the program uses the initial frame point list as the frame point list when it performs the first cycle;

[0098] S1-3, initial selection method: input one of "circle", "circle intersection" and "fence selection";

[0099] S1-4, maximum zoom factor: input an integer or real number, the maximum zoom factor should be greater than 0 in most scenarios, and the present invention does not discuss the case where this parameter is less than 0. This parameter represents the upper limit of the ratio of the length dimension of the frame line point list when it changes dynamically to the length dimension of the initial frame line point list. The significance of setting this parameter is: 1. given the upper limit of the dichotomy interval, 2. taking the process of estimating the height of a point on the contour map as an example, the contour lines that are too far away from the point to be measured often have no reference value for the calculation behavior, and setting the maximum zoom factor parameter can exclude the graphics elements that are too far away from the reference, 3. In some cases, there is no selection set that meets the operator's requirements in the entire drawing. At this time, no matter how many times the dynamic changes of the frame line point list are performed, it is impossible to obtain a selection set that meets the requirements, which will only waste time. Setting the maximum zoom factor and using the initial frame line point list with the maximum zoom factor as the frame line point list to perform a selection set acquisition and analysis can effectively avoid the above phenomenon.

[0100] S1-5, minimum zoom factor: Enter an integer or real number. In most scenes, the minimum zoom factor should be greater than or equal to 0. There are many scenes where the minimum zoom factor is equal to 0. The present invention does not discuss the case where this parameter is less than 0. This parameter represents the lower limit of the ratio of the length size of the frame line point list when it changes dynamically to the length size of the initial frame line point list. The significance of setting this parameter is to give the lower limit of the dichotomy interval.

[0101] S1-6, Maximum number of loops: Enter a positive integer to indicate the upper limit of the number of times the frame point list can be dynamically changed, which determines the subdivision degree of the binary search. If the subdivision degree is expressed in length, it can be expressed as the maximum value of (((the distance from each point on the initial frame point list) to the center point)) * maximum zoom factor * (1 / 2) ∧ maximum number of loops. The operator can set the maximum number of loops according to his own needs. The purpose of setting this parameter is to prevent the program from looping infinitely. This parameter should not be too small, otherwise the binary search method will not be fully executed, which may cause the final result of the loop to fail to obtain the selection set that best meets the requirements;

[0102] S1-7, Initial Screening Table: Enter the grammatically correct logical point pairs that correctly express the allowed graphics elements in the selection set that meet the requirements. It can be a null value, indicating that any graphics element is allowed to be added to the selection set;

[0103] S1-8, temporary parameter name list: Enter a list containing all parameter names used in the expansion expression and reduction expression. In principle, the temporary parameter name list allows all parameters and parameter combinations used when the program is running, and its usage is very flexible. However, this parameter in this invention currently only contains one parameter name, which is used to represent "the selection set obtained at the end of this loop". The significance of setting this parameter is to provide parameter names for expanding expressions and reducing expressions;

[0104] S1-9, expansion expression, reduction expression: each input an expression that conforms to the CAD syntax. During the binary division process, after the interval is divided into two sub-intervals, it is necessary to determine which sub-interval the next binary division will be executed in. The expansion expression and reduction expression determine which sub-interval the binary division will be executed in. If the expansion expression is established, the selection means that the interval in which the frame line point list is enlarged is used as the interval for the next binary division execution. If the reduction expression is established, the selection means that the interval in which the frame line point list is reduced is used as the interval for the next binary division execution. If the expansion expression and the reduction expression are not established at the same time, it means that the loop ends. The expansion expression and the reduction expression must be mutually exclusive. If the expansion expression and the reduction expression are established at the same time, it means that the input expansion expression and reduction expression are incorrect. The present invention does not discuss the situation where the expansion expression and the reduction expression are established at the same time.

[0105] S1-10, Dynamic frame point list: The frame point list in the binary loop process. The significance of setting this parameter is to distinguish it from the initial frame point list;

[0106] S1-11, Dynamic scaling factor: The scaling factor of a dynamic frame point list compared to the initial frame point list during the binary search cycle. The meaning of setting this parameter is to execute the binary search;

[0107] S1-12, Dynamic Binary Interval Upper Limit, Dynamic Binary Interval Lower Limit: The allowed interval for the dynamic change of a certain dynamic scaling multiple during the binary cycle. The upper limit of this interval is called the dynamic binary interval upper limit, and the lower limit of this interval is called the dynamic binary interval lower limit. The significance of setting this parameter is to obtain a dynamically changing binary interval.

[0108] The step S2 comprises:

[0109] S2-1. Specify the ideal treatment method;

[0110] S2-2. Specify the handling methods for special situations;

[0111] S2-3. Determine whether it is necessary to perform the specific steps of binary search.

[0112] The step S2-1 comprises:

[0113] S2-1-1. If the initial frame point list is scaled around the center point to the maximum scaling factor, the selection set obtained by the frame point list at this time should not satisfy the expansion expression;

[0114] S2-1-2, when the minimum zoom factor is not 0, if the initial frame point list is zoomed around the center point to the minimum zoom factor, the selection set obtained by the frame point list at this time should not satisfy the reduction expression;

[0115] S2-1-3, under the premise that S2-1-1 and S2-1-2 are satisfied at the same time, the binary search should be fully carried out, that is, after the last cycle is executed, the binary search ends with the result that both the expansion expression and the reduction expression are not true;

[0116] S2-1-4, the situation where S2-1-1, S2-1-2, and S2-1-3 are satisfied at the same time can be understood as an ideal situation. Ideally, the operator can obtain a set of choices that fully meets the requirements through dichotomy.

[0117] The S2-2 includes:

[0118] S2-2-1. Scale the initial frame point list around the center point to the maximum scaling factor. If the selection set obtained from the frame point list at this time satisfies the expansion expression, that is, the interval of the first binary search is (maximum scaling factor, maximum scaling factor), this interval is meaningless. At this time, the selection set should be used as the final result and the binary search is no longer performed.

[0119] S2-2-2, when the minimum zoom factor is not 0, the initial frame point list is zoomed around the center point to the minimum zoom factor. If the selection set obtained by the frame point list at this time satisfies the reduction expression, that is, the interval of the first binary search is (minimum zoom factor, minimum zoom factor), the interval is meaningless. At this time, the selection set should be used as the final result and the binary search is no longer performed.

[0120] S2-2-3, under the premise that S2-1-1 and S2-1-2 are met, the binary search method is not fully carried out, that is, after executing the maximum number of loops, the dynamic frame line point list still cannot obtain a selection set that meets the requirements. At this time, the selection set should be used as the final result and the binary search method should be ended with the result of forced end of the loop;

[0121] S2-2-4 and the situations that satisfy one of S2-2-1, S2-2-2, and S2-2-3 can be understood as special cases. In special cases, the operator cannot obtain a selection set that fully meets the requirements through dichotomy.

[0122] The S2-3 includes:

[0123] S2-3-1, determine whether the center point is a three-dimensional point, if it is a three-dimensional point, change the center point to a two-dimensional point;

[0124] S2-3-2, scale the initial frame point list around the center point by the maximum scaling factor to obtain a new frame point list, and use the frame point list, initial selection method, and initial filter table as input parameters of the ssget function to obtain a selection set, which is called "ss", and attach the value of the only parameter name in the temporary parameter name list to ss. If the expansion expression is established, define the "direct end flag" as "yes" and let the final result be ss;

[0125] S2-3-3. If the direct end flag is not "yes" and the minimum zoom factor is not 0, the initial frame point list is zoomed around the center point by the minimum zoom factor to obtain a new frame point list, and the frame point list, initial selection method, and initial filter table are used as input parameters of the ssget function to obtain a selection set, which is called "ss". The only parameter name in the temporary parameter name list is assigned the value of ss. If the reduction expression is established, the "direct end flag" is defined as "yes" and the final result is ss.

[0126] S2-3-4. At this point, if the direct end flag is not "yes", binary search is required.

[0127] The step S3 comprises:

[0128] S3-1, if the direct end flag is "yes", the remaining steps of S3 are not executed;

[0129] S3-2, setting the initial value of the dynamic change of the dichotomy;

[0130] S3-3, perform binary search and output the result;

[0131] The S3-2 includes:

[0132] S3-2-1. If 1∈[minimum zoom factor, maximum zoom factor], the dynamic zoom factor is set to 1; otherwise, the dynamic zoom factor is set to the maximum zoom factor;

[0133] S3-2-2, set the upper limit of the dynamic binary division interval to the maximum zoom factor, and set the lower limit of the dynamic binary division interval to the minimum zoom factor;

[0134] S3-2-3, set the "current number of cycles" to 0;

[0135] S3-2-4, set "whether to jump out of loop" to "no";

[0136] The S3-3 includes:

[0137] S3-3-1. When the answer to "no" is "whether to exit the loop" and the current number of loops is less than the maximum number of loops, execute the loops from S3-3-2 to S3-3-8:

[0138] S3-3-2, setting the dynamic frame point list to the state after the initial frame point list is dynamically enlarged around the center point by a multiple;

[0139] S3-3-3, using the dynamic frame point list, initial selection method, and initial screening table as input parameters of the ssget function to obtain a selection set, which is called "ss";

[0140] S3-3-4. Add the value ss to the only parameter name in the temporary parameter name list;

[0141] S3-3-5. If the expansion expression is established, first adjust the lower limit of the dynamic dichotomy interval to the value of the dynamic scaling factor, and then adjust the dynamic scaling factor to the average of the lower limit of the dynamic dichotomy interval and the upper limit of the dynamic dichotomy interval;

[0142] S3-3-6. If the reduction expression is established, first adjust the upper limit of the dynamic dichotomy interval to the value of the dynamic scaling factor, and then adjust the dynamic scaling factor to the average of the lower limit of the dynamic dichotomy interval and the upper limit of the dynamic dichotomy interval;

[0143] S3-3-7. If neither the expansion expression nor the reduction expression is true, whether to exit the loop is adjusted to "yes";

[0144] S3-3-8, add 1 to the current number of cycles;

[0145] S3-3-9. At this time, the binary search is completed and ss is output as the result.

[0146] Two practical cases are briefly described in step S4 as follows:

[0147] S4-1, a practical case of scaling the frame line by bisection method to obtain 7 contour lines near a specified point;

[0148] S4-2, a practical case of scaling the frame line by bisection method to obtain the nearest cable trench in the east direction of the specified point;

[0149] The S4-1 includes:

[0150] S4-1-1、Reference Attachment Figure 1 , the present invention will realize the function of obtaining 7 contour lines near the center point when the center point and contour map are given;

[0151] S4-1-2, set the initial frame point list to a regular octagon surrounding the center point, and the radius of the inscribed circle is 5m;

[0152] S4-1-3, set the initial selection method to "circle intersection";

[0153] S4-1-4. It is temporarily determined that the contour lines about 50m away from the center point have no reference value, so the maximum zoom factor can be set to 10;

[0154] S4-1-5. Contour lines close to the center point are of reference value, so the minimum zoom factor is set to 0;

[0155] S4-1-6, set the maximum number of cycles to 100;

[0156] S4-1-7, set the initial screening table to only screen contour line elements;

[0157] S4-1-8, set a temporary parameter name list to include only "a1";

[0158] S4-1-9, set the expansion expression to mean "the number of primitives included in the selection set a1 is less than 7";

[0159] S4-1-10, set the reduction expression to mean "the number of primitives included in the selection set a1 is greater than 7";

[0160] S4-1-11, see Appendix Figure 2 ,This situation belongs to the ideal situation described in S2, and the binary division cycle is executed normally, and the dynamic scaling factor is set to 1, the upper limit of the dynamic binary division interval is 10, and the lower limit of the dynamic binary division interval is 0;

[0161] S4-1-12, the first cycle, the dynamic zoom factor is 1, the dynamic frame point list is set according to the dynamic zoom factor, the selection set is obtained and the value is attached to a1, a1 contains 1 contour line, so the expansion expression is established, and the reduction expression is not established, the lower limit of the dynamic dichotomy interval is set to 1, and the dynamic zoom factor is set to (10+1) / 2=5.5;

[0162] S4-1-13, the second cycle, the dynamic zoom factor is 5.5, the dynamic frame point list is set according to the dynamic zoom factor, the selection set is obtained and the value is attached to a1, a1 contains 8 contour lines, so the expansion expression is not valid, and the reduction expression is valid, the upper limit of the dynamic dichotomy interval is set to 5.5, and the dynamic zoom factor is set to (5.5+1) / 2=3.225;

[0163] S4-1-14, the third cycle, the dynamic zoom factor is 3.225, the dynamic frame point list is set according to the dynamic zoom factor, the selection set is obtained and the value is attached to a1, a1 contains 6 contour lines, so the expansion expression is established, and the reduction expression is not established, the lower limit of the dynamic dichotomy interval is set to 3.225, and the dynamic zoom factor is set to (5.5+3.225) / 2=4.3625;

[0164] S4-1-15, the fourth cycle, the dynamic zoom factor is 4.3625, set the dynamic frame point list according to the dynamic zoom factor, obtain the selection set and attach it to a1, a1 contains 8 contour lines, so the expansion expression does not hold, and the reduction expression holds. Set the upper limit of the dynamic dichotomy interval to 4.3625, and set the dynamic zoom factor to (4.3625+3.225) / 2=3.79375;

[0165] S4-1-16, the fifth cycle, the dynamic zoom factor is 3.79375, the dynamic frame point list is set according to the dynamic zoom factor, the selection set is obtained and the value is attached to a1, a1 contains 6 contour lines, so the expansion expression is established, and the reduction expression is not established, the lower limit of the dynamic dichotomy interval is set to 3.79375, and the dynamic zoom factor is set to (3.79375+3.225) / 2=3.509375;

[0166] S4-1-17, the 6th loop, the dynamic zoom factor is 3.509375, set the dynamic frame point list according to the dynamic zoom factor, get the selection set and attach it to a1, a1 contains 7 contour lines, so the expansion expression and the reduction expression are not valid, end the binary search loop and output the selection set at this time as the final result.

[0167] The S4-2 includes:

[0168] S4-2-1. Reference Attachment Figure 3 , the present invention can realize the function of obtaining the nearest cable trench in the east direction of the center point when the center point and the cable trench map are given;

[0169] S4-2-2, set the initial frame point list as a line segment extending 2m from the center point to the east;

[0170] S4-2-3. Set the initial selection method to "bar selection";

[0171] S4-2-4. It is tentatively decided that the contour lines about 40m away from the center point have no reference value, so the maximum zoom factor can be set to 20;

[0172] S4-2-5. All cable trenches close to the center point are eligible for selection, so the minimum zoom factor is set to 0;

[0173] S4-2-6, set the maximum number of cycles to 100;

[0174] S4-2-7, set the initial screening table to screen only the cable trench elements;

[0175] S4-2-8, set a temporary parameter name list to include only "a1";

[0176] S4-2-9, set the expansion expression to mean "the number of primitives included in the selection set a1 is less than 1";

[0177] S4-2-10, set the reduction expression to mean "the number of primitives included in the selection set a1 is greater than 1";

[0178] S4-2-11, see Appendix Figure 4 ,This situation belongs to the ideal situation described in S2, and the binary division cycle is executed normally, and the dynamic scaling factor is set to 1, the upper limit of the dynamic binary division interval is 20, and the lower limit of the dynamic binary division interval is 0;

[0179] S4-2-12, the first cycle, the dynamic scaling factor is 1, the dynamic frame point list is set according to the dynamic scaling factor, the selection set is obtained and the value is attached to a1, a1 contains 0 cable trenches, so the expansion expression is established, and the reduction expression is not established, the lower limit of the dynamic dichotomy interval is set to 1, and the dynamic scaling factor is set to (20+1) / 2=10.5;

[0180] S4-2-13, the second cycle, the dynamic zoom factor is 10.5, the dynamic frame point list is set according to the dynamic zoom factor, the selection set is obtained and the value is attached to a1, a1 contains 0 cable trenches, so the expansion expression is established, and the reduction expression is not established, the lower limit of the dynamic dichotomy interval is set to 10.5, and the dynamic zoom factor is set to (10.5+20) / 2=15.25;

[0181] S4-2-14, the third cycle, the dynamic zoom factor is 15.25, the dynamic frame point list is set according to the dynamic zoom factor, the selection set is obtained and the value is attached to a1, a1 contains 2 cable trenches, so the expansion expression is not valid, and the reduction expression is valid, the upper limit of the dynamic dichotomy interval is set to 15.25, and the dynamic zoom factor is set to (10.5+15.25) / 2=12.875;

[0182] S4-2-15, the fourth loop, the dynamic zoom factor is 12.875, set the dynamic frame point list according to the dynamic zoom factor, get the selection set and attach it to a1, a1 contains 1 cable trench, so the expansion expression and the reduction expression are not valid, end the binary search loop and output the selection set at this time as the final result.

[0183] Several extended variants of the present invention are briefly described in step S5 as follows:

[0184] S5-1, variants of the final result;

[0185] S5-2, a variation of the dynamic border point list change rule;

[0186] S5-3, maximum zoom factor variant;

[0187] S5-4, variant of temporary parameter name list;

[0188] S5-5, center point, filter table, selection method variants;

[0189] The S5-1 includes:

[0190] S5-1-1. The purpose of the present invention is to enable the operator to obtain a selection set that meets the requirements, so the final result should include at least one selection set that meets the requirements, but in fact the final result may include any parameters in the steps, and these parameters can be combined with a selection set that meets the requirements into a list as the final result. For example, in some cases, the number of binary search cycles, the dynamic scaling factor of the last cycle, the step in which the final result is generated, etc. are also qualified as important parameters that the operator hopes to obtain.

[0191] The S5-2 includes:

[0192] S5-2-1. The present invention only involves a way of changing the dynamic frame point list, that is, scaling around the center point, but in fact any form of change around the center point is acceptable, such as rotation around the center point, offset around the center point, scaling in two directions of unequal proportions around the center point, compound changes around the center point, changes without the participation of the center point, etc. are also feasible. However, the application scenarios of these change methods are not as common as scaling changes.

[0193] The S5-3 includes:

[0194] S5-3-1. The present invention stipulates that the maximum zoom factor should appear as a necessary parameter, but in fact the maximum zoom factor can be set to positive infinity, that is, no upper limit is set for the maximum zoom factor. However, in this case, once positive infinity appears as the upper limit of the dynamic binary search interval, it means that the interval for enlarging the frame point list cannot be calculated, and the interval binary search cannot be performed normally. At this time, the binary search can be changed to not perform the binary search, and the dynamic frame point list can be enlarged by a certain multiple to achieve it.

[0195] The S5-4 includes:

[0196] S5-4-1. The present invention stipulates that only one parameter name is allowed to exist in the temporary parameter name list, which is used to represent "the selection set obtained at the end of this loop", but in fact the temporary parameter name list may include multiple parameter names, which are used to represent any parameters in the steps. In this case, the operator needs to assign the used parameters to the parameter names in the temporary parameter name list at the appropriate positions in steps S3-2 and S3-3. For example, the operator can make the temporary parameter name list include three parameter names "a1", "a2", and "a3", where a1 is used to represent "the number of graphics elements in the selection set obtained at the end of the previous loop (if any)", a2 is used to represent "the number of circles with a radius greater than 10 in the selection set obtained at the end of this loop", and a3 is used to represent "the dynamic zoom multiple at the end of this loop is accurate to many decimal places", and then these three parameter names are integrated into the expansion expression and the reduction expression, so that the meanings represented by these three parameter names participate in the execution process of the dichotomy.

[0197] The S5-5 includes:

[0198] S5-5-1. The present invention stipulates that the center point, the initial screening table, and the initial selection method as parameters in the binary search cycle shall not change. However, in fact, under special circumstances, the above parameters can change in a dynamic cycle. The above parameters that change are called dynamic center point, dynamic screening table, and dynamic selection method. For example, when specific conditions are met, the operator can allow the dynamic center point to move, the dynamic screening table to adjust the screening object, and the dynamic selection method to change. However, there are very few application scenarios for dynamic changes in the above parameters.

[0199] The present invention uses a binary method to call the "ssget" function multiple times to obtain a selection set and dynamically changes the frame point list parameters around a certain center point each time the "ssget" function is called, so as to finally obtain a selection set that meets the requirements. The present invention realizes the program's adaptability when obtaining the selection set, which not only avoids the operator's unnecessary thinking, but also even if the operator creates a more reasonable program after unnecessary thinking, the accuracy of the program cannot reach the level of the present invention.

[0200] The present invention has strong scalability and unlimited possibilities. The present invention briefly describes multiple variants based on the detailed description of the basic functions. Combined with two practical cases, cartographers from all walks of life can improve the basic steps of the method to suit their own industry application scenarios on the premise of fully understanding the above variants, define the dynamic change method of each parameter in their own industry, and then obtain a selection set that meets the requirements of their own industry.

[0201] In the description of the present invention, the terms "upper", "lower", "front", "back", "left", "right", "top", "bottom", "vertical", "horizontal" and the like indicate positions or positional relationships based on the positions or positional relationships shown in the accompanying drawings, and are only for the purpose of describing the present invention rather than requiring the present invention to be constructed or operated in a specific position, and therefore should not be construed as limiting the present invention. The terms "connected" and "connected" in the present invention should be understood in a broad sense, for example, it can be a connection or a detachable connection; it can be a direct connection or an indirect connection through an intermediate component. For those of ordinary skill in the art, the specific meanings of the above terms can be understood according to specific circumstances.

[0202] The above is a preferred embodiment of the present invention, and the description of the specific embodiment is only used to better understand the concept of the present invention. For those skilled in the art, several improvements or equivalent replacements can be made according to the principles of the present invention, and these improvements or equivalent replacements are also considered to fall within the protection scope of the present invention.

Claims

1. A method for obtaining a target selection set by scaling the frame line in a binary manner based on CAD, characterized in that: The following steps are involved: S1. Define input parameters, including center point, initial frame point list, initial selection method, maximum zoom factor, minimum zoom factor, maximum number of cycles, initial screening table, temporary parameter name list, enlargement expression, reduction expression, and define process parameters, including dynamic frame point list, dynamic zoom factor, dynamic dichotomy interval upper limit, and dynamic dichotomy interval lower limit; S2. Specify the methods and procedures for handling general and special situations; S3. Make the list of frame points change dynamically until a selection set that meets the requirements is obtained, and output the final selection set as a result.

2. The method for obtaining a target selection set by scaling the frame line by dichotomy based on CAD as claimed in claim 1, characterized in that: The parameters in step S1 include: S1-1. Center point: Enter the two-dimensional point around which the frame point list is dynamically scaled; S1-2, initial frame point list: input the initially given frame point list, and the initial frame point list is used as the frame point list when the program performs the first cycle; S1-3, Initial selection method: Enter one of "circle", "circle intersection", and "bar selection"; S1-4, maximum scaling factor: given the upper limit of the initial dichotomy interval; S1-5, minimum scaling factor: given the lower limit of the initial dichotomy interval; S1-6, Maximum number of cycles: indicates the upper limit of the number of times the frame point list can be dynamically changed, and determines the degree of subdivision of the binary method; S1-7, Initial Screening Table: Enter the grammatically correct logical point pairs that correctly express the allowed graphics elements in the selection set that meet the requirements; S1-8, temporary parameter name list: the list content is all the parameter names used in the expansion expression and reduction expression; S1-9, expand expression, reduce expression: input an expression that conforms to CAD syntax respectively; S1-10, dynamic frame point list: the frame point list in the binary loop process, which is different from the initial frame point list; S1-11, dynamic scaling factor: the scaling factor of a dynamic frame point list compared with the initial frame point list during the binary search loop, used to perform the binary search; S1-12, dynamic binary interval upper limit, dynamic binary interval lower limit: the allowable range for dynamic changes in a dynamic scaling multiple during the binary cycle. The upper limit of this range is called the dynamic binary interval upper limit, and the lower limit of this range is called the dynamic binary interval lower limit, so as to obtain a dynamically changing binary interval.

3. The method for obtaining a target selection set by scaling the frame line by dichotomy based on CAD as claimed in claim 1, characterized in that: The step S2 comprises: S2-1. How to deal with general situations; S2-2. How to deal with special situations; S2-3. Determine whether binary search needs to be performed.

4. The method for obtaining a target selection set by scaling the frame line by dichotomy based on CAD as claimed in claim 3, characterized in that: The step S2-1 comprises: S2-1-1. If the initial frame point list is scaled around the center point to the maximum scaling factor, the selection set obtained by the frame point list at this time should not satisfy the expansion expression; S2-1-2, when the minimum zoom factor is not 0, if the initial frame point list is zoomed around the center point to the minimum zoom factor, the selection set obtained by the frame point list at this time should not satisfy the reduction expression; S2-1-3, under the premise that S2-1-1 and S2-1-2 are satisfied at the same time, the binary search should be fully carried out, that is, after the last cycle is executed, the binary search should end with the result that both the expansion expression and the reduction expression are not true; S2-1-4, when S2-1-1, S2-1-2, and S2-1-3 are satisfied at the same time, the operator obtains a selection set that fully satisfies the requirements through dichotomy; The S2-2 includes: S2-2-1. Scale the initial frame point list around the center point to the maximum scaling factor. If the selection set obtained from the frame point list at this time satisfies the expansion expression, the selection set should be used as the final result and the binary search method will no longer be performed. S2-2-2, when the minimum zoom factor is not 0, the initial frame point list is zoomed around the center point to the minimum zoom factor. If the selection set obtained by the frame point list at this time satisfies the reduction expression, the selection set should be used as the final result and the binary search method is no longer performed; S2-2-3: If the binary search is not fully carried out under the premise that S2-1-1 and S2-1-2 are met, the selection set should be taken as the final result and the binary search should be ended with the result of the forced end of the loop; S2-2-4. The situation that satisfies one of S2-2-1, S2-2-2, and S2-2-3 is a special case. In special cases, the operator cannot obtain a selection set that fully meets the requirements through dichotomy.

5. The method for obtaining a target selection set by scaling the frame line by dichotomy based on CAD as claimed in claim 4, characterized in that: The S2-3 includes: S2-3-1, determine whether the center point is a three-dimensional point, if it is a three-dimensional point, change the center point to a two-dimensional point; S2-3-2, scale the initial frame point list around the center point by the maximum scaling factor to obtain a new frame point list, and use the frame point list, initial selection method, and initial filter table as input parameters of the ssget function to obtain a selection set, which is called "ss", and attach the value of the only parameter name in the temporary parameter name list to ss. If the expansion expression is established, define the "direct end flag" as "yes" and set the final result to ss; S2-3-3. If the direct end flag is not "yes" and the minimum zoom factor is not 0, the initial frame point list is zoomed around the center point by the minimum zoom factor to obtain a new frame point list, and the frame point list, initial selection method, and initial filter table are used as input parameters of the ssget function to obtain a selection set, which is called "ss". The only parameter name in the temporary parameter name list is assigned the value of ss. If the reduction expression is established, the "direct end flag" is defined as "yes" and the final result is ss. S2-3-4. At this point, if the direct end flag is not "yes", binary search is required.

6. The method for obtaining a target selection set by scaling the frame line by dichotomy based on CAD as claimed in claim 5, characterized in that: The step S3 comprises: S3-1, if the direct end flag is "yes", the remaining steps of S3 are not executed; S3-2, setting the initial value of the dynamic change of the dichotomy; S3-3. Perform binary search and output the result.

7. The method for obtaining a target selection set by scaling the frame line by dichotomy based on CAD as claimed in claim 6, characterized in that: The S3-2 includes: S3-2-1. If 1∈[minimum zoom factor, maximum zoom factor], the dynamic zoom factor is set to 1; otherwise, the dynamic zoom factor is set to the maximum zoom factor; S3-2-2, set the upper limit of the dynamic binary division interval to the maximum zoom factor, and set the lower limit of the dynamic binary division interval to the minimum zoom factor; S3-2-3, set "current number of cycles" to 0; S3-2-4. Set "Whether to exit the loop" to "No".

8. The method for obtaining a target selection set by scaling the frame line by dichotomy based on CAD as claimed in claim 6, characterized in that: The S3-3 includes: S3-3-1, when whether to jump out of the loop is "No" and the current loop number is less than the maximum loop number, the steps of S3-3-2 to S3-3-8 are executed cyclically: S3-3-2, setting the dynamic frame point list to the state after the initial frame point list is dynamically enlarged around the center point by a multiple; S3-3-3, using the dynamic frame point list, initial selection method, and initial screening table as input parameters of the ssget function to obtain a selection set, which is called "ss"; S3-3-4. Add the value ss to the only parameter name in the temporary parameter name list; S3-3-5. If the expansion expression is established, first adjust the lower limit of the dynamic dichotomy interval to the value of the dynamic scaling factor, and then adjust the dynamic scaling factor to the average of the lower limit of the dynamic dichotomy interval and the upper limit of the dynamic dichotomy interval; S3-3-6. If the reduction expression is established, first adjust the upper limit of the dynamic dichotomy interval to the value of the dynamic scaling factor, and then adjust the dynamic scaling factor to the average of the lower limit of the dynamic dichotomy interval and the upper limit of the dynamic dichotomy interval; S3-3-7. If neither the expansion expression nor the reduction expression is true, whether to exit the loop is adjusted to "yes"; S3-3-8, add 1 to the current number of cycles; S3-3-9. Binary search is completed and the ss result is output.

9. The method for obtaining a target selection set by scaling the frame line by dichotomy based on CAD as claimed in claim 8, characterized in that: The step of expanding the variant is also included, and the expanded variant includes: S5-1, variants of the final result; S5-2, a variation of the dynamic border point list change rule; S5-3, maximum zoom factor variant; S5-4, variant of temporary parameter name list; S5-5, center point, filter table, selection method variants.

10. The method for obtaining a target selection set by scaling the frame line by dichotomy based on CAD as claimed in claim 9, characterized in that: The S5-1 includes: S5-1-1 The final result includes at least one set of choices that meets the requirements; The S5-4 includes a temporary parameter name list including multiple parameter names, which are used to represent any parameters in the steps. In this case, the operator needs to assign the used parameters to the parameter names in the temporary parameter name list at the appropriate positions in steps S3-2 and S3-3, so that the meaning represented by the parameter name participates in the execution process of the dichotomy.