A method for refined design of curved road curbs based on CAD secondary development

Abstract

This invention discloses a method for refined design of curbs on curved sections based on CAD secondary development. According to the principle of visual focus, the protruding positions of the curved section are set as constraint points, which are preset as the midpoint of the upright curb and the dividing point of the flat curb. Considering the construction and procurement conditions of the curbs, and in conjunction with landscape requirements, the principle of uniformity in curb type and larger rather than smaller length is proposed. Then, the sections are divided according to constraint point-constraint point and constraint point-curve endpoint, and the outer edge line of each upright curb in the curved section is obtained using the remainder distribution method. Based on the midpoint of the upright curb corresponding to the dividing point of the flat curb, the inner edge line of the flat curb is obtained. The distance and convexity of each node of the curb edge line are compared to see if they are consistent. If they are completely consistent, they are of the same type, thus determining the curb type. Combined with the preset widths of the upright and flat curbs, the curb detail is drawn. This method not only improves the efficiency and reduces the workload of designers, but also significantly enhances the road landscape and makes the construction quality of the curb easier to control.

Description

Technical Field

[0001] This invention relates to the field of road ancillary works, specifically a method for refined design of curb stones for curved sections based on CAD secondary development. Background Technology

[0002] Unlike other types of roads, urban roads must not only have high-quality traffic capacity but also high-quality aesthetic appeal. As a "window" showcasing the urban road landscape, curb stones (commonly known as "road curbs") largely determine the quality and grade of the road. However, the inner edges of sidewalks at roadside green belts, safety island ends, intersections, and junctions often feature curved curb stones. Designs typically lack detailed specifications for these areas, providing only standard straight curb stone outlines, and small straight curb stones are often used for fitting during construction. Small curb stone paving structures suffer from poor stability, low overall strength, and susceptibility to contamination, severely impacting their lifespan and appearance (e.g., ...). Figure 2 As shown in the figure, this greatly reduces the road's landscape effect and quality.

[0003] The core idea of ​​refined road design is to enhance road functionality, improve safety and service levels, and elevate the urban landscape. It focuses more on details in road design and implementation, addressing micro-level issues and details of urban roads. With new concepts and developments in urbanization, new requirements have been placed on the refined design of curbs on curved sections. When using natural stone for curbs, avoiding resource waste and improving the urban road landscape are particularly important (e.g., Figure 3 Existing road design software mainly focuses on: overall route (horizontal, vertical, and cross) design, roadbed earthwork statistics, etc., leaving a gap in the detailed design of curb stones.

[0004] When the curb stones on curved road sections have simple shapes and few types, they can be designed manually with fine detail. However, when the curb stones on curved road sections have complex shapes and many types, the workload for manual fine detail design is enormous, and it increases exponentially with adjustments to the design scheme.

[0005] In view of this, it is necessary to study a new method for the refined design of curb stones on curved sections based on CAD secondary development. Summary of the Invention

[0006] The purpose of this invention is to provide a method for refined design of curb stones on curved sections based on CAD secondary development, which can realize the refined design of curb stones on curved sections.

[0007] The technical solution to achieve the purpose of this invention is as follows: a method for refined design of curb segments based on CAD secondary development, which divides the curve into segments based on the distance between constraint points and curve endpoints on the curve polyline primitives, either curve endpoint-constraint point or constraint point-constraint point; combined with a preset allowable length range for a single curb block, the remainder allocation method is used to obtain the large-scale details of the curb block. Specifically, it includes the following steps:

[0008] S1. Based on the road plan design drawing, the curve segments to be refined are screened out and processed into polyline primitives. The positions of the visual focus of pedestrians and drivers in the curve segments are set as constraint points, i.e., the protruding positions of the curve segments. The constraint points are preset as the midpoint of the curb and the boundary point of the flat curb. When the curve is not closed, the curve endpoints are set on both sides of the general road sections to determine the drawing range. Based on the distance between the constraint points and the curve endpoints on the curve polyline primitives, when the curve is closed, it is divided into multiple constraint point-constraint point segments, and when the curve is not closed, it is divided into curve endpoint-constraint point segments, multiple constraint point-constraint point segments, and constraint point-curve endpoint segments. Then, the boundary points of the curbs of the curve segments are obtained by using the remainder distribution method.

[0009] S2, after dividing the curve segment polyline element by the dividing point of the curb stone, the XY coordinates and convexity of each node of the polyline element of the outer edge of each curb stone can be obtained; based on the middle point of the curb stone corresponding to the dividing point of the flat curb stone, the XY coordinates and convexity of each node of the polyline element of the inner edge of each flat curb stone can be calculated.

[0010] S3. Compare the distances and convexities of each node of the curbstone edge polyline element to see if they are consistent. If they are completely consistent, they are of the same type. If this curbstone is inconsistent with other curbstones, assign it a new curbstone type to determine the type of each curbstone. Then, based on the XY coordinates and convexities of each node of the curbstone edge polyline element obtained in step S2, and combined with the preset curbstone width, draw the large-scale curbstone drawing.

[0011] Furthermore, the calculation method for obtaining the boundary point of the curbstone of the curve segment using the remainder distribution method in step S1 is as follows:

[0012] (1): Constraint point - curve endpoint, curve endpoint - constraint point case:

[0013] The curve endpoints are set on both sides of the general road sections. The division of the curb stones in the general road sections is not restricted. After the constraint point - the curve endpoint curve segment is divided according to the standard curb stone length BL, the remaining piece can be combined with the general road section outside the endpoint and designed according to the standard straight curb stone. That is, the remainder is 0 and no further allocation is needed.

[0014] The standard length of the curbstone is BL, and the distance between the constraint point and the polyline element of the curve segment is DS. The constraint point is the midpoint of the curbstone. The distance between the boundary point of the curbstone at the constraint point and the polyline element of the curve segment is DS+BL / 2 or DS-BL / 2. The distance between the boundary points of the remaining curbstones and the polyline element of the curve segment is DS+BL*j+BL / 2 or DS-BL*j-BL / 2, where j is the j-th curbstone on both sides of the constraint point. The coordinates of the boundary point are obtained from the distance between the boundary point and the polyline element of the curve segment.

[0015] (2): Constraint point to constraint point situation:

[0016] Parameter settings: The distance between the constraint point and the curve polyline primitive is DS1 and DS2, and DS1 < DS2; Single curb length range settings: standard length BL, minimum length MinL, maximum suitable length ML, maximum length MaxL;

[0017] The constraint point is preset to the midpoint of the curbstone. The distance between the boundary point of the curbstone at the constraint point and the polyline primitive of the curve segment is DS1+BL / 2 and DS2-BL / 2. The remaining curve segments are assumed to be divided according to the standard curbstone length BL. At this time, the remaining piece is the remainder Mod. Then, within the preset allowable length range, the length of each curbstone is recalculated using the remainder allocation method.

[0018] Furthermore, in the case of constraint points to constraint points, the specific steps for recalculating the length of each curbstone using the remainder allocation method are as follows:

[0019] The constraint point is the midpoint of the curbstone. The distance between the curbstone boundary point at the constraint point and the polyline element of the curve segment is DS1+BL / 2 and DS2-BL / 2, respectively. The length of the remaining curve polyline elements is L. The method for calculating the curbstone boundary point is as follows:

[0020] 1) Assuming that when dividing according to the standard curb length BL, the number of blocks N is the integer part of L / BL, and the length Mod of the remaining block is LN*BL;

[0021] 2) The number of curb stones required for allocation based on the minimum curb length m is (BL-Mod) / (BL-MinL) rounded up; the number of curb stones required for allocation based on the maximum curb length n is Mod / (MaxL-BL) rounded up; the number of curb stones required for allocation based on the maximum suitable curb length i is Mod / (ML-BL) rounded up; the smaller values ​​of m and n are set to Min;

[0022] 3) Obtain the length of each curbstone;

[0023] ①N≥Min and m and n are smaller than n. If N≥i, select i curb stones from the two constraint points toward the middle of the curve segment and adjust their length to BL+Mod / i. The rest are of standard length BL. Otherwise, select n curb stones and adjust their length to BL+Mod / n. The rest are of standard length BL. The number of curb stones is N.

[0024] ② If N≥Min and m and n are both less than m, select m curb stones sequentially from the two constraint points toward the middle of the curve segment, adjust their length to BL-(BL-Mod) / m, and keep the standard length BL for the rest. The number of curb stones is N+1; ③ If N<Min, the curb stones cannot be divided within the preset suitable range, then the following division scheme is adopted:

[0025] I. The number of curb stones is N, and the length of a single curb stone is L / N;

[0026] II. The number of curb stones is N+1, and the length of a single curb stone is L / (N+1);

[0027] 5) Based on the length of the curbstone blocks and the distance of the constraint points on the curve polyline primitives in step 3), the distance of each curbstone boundary point on the curve segment polyline primitives is calculated iteratively to obtain the coordinates of the boundary points.

[0028] Furthermore, the method for obtaining the XY coordinates and convexity of each node of the polyline primitive on the outer edge of the curbstone in step S2 is as follows:

[0029] Based on the polyline primitives of the curve segment and the starting and ending points of each curbstone, determine whether there are nodes between the starting and ending points. If not, calculate the XY coordinates and convexity of each node of the polyline primitive of this curbstone edge line by combining the midpoints of the starting and ending points. If they exist, calculate the polyline convexity corresponding to the starting point after dividing the polyline primitive of the curve segment at the starting point, set the convexity of the ending point to 0, and obtain the XY coordinates and convexity of each node of this polyline primitive of this curbstone edge line by combining the XY coordinates and convexity of the nodes between the starting and ending points.

[0030] Furthermore, the determination method in step S3 is as follows:

[0031] ① Based on the distance of each node of the polyline element on the curbstone edge, arrange the nodes in ascending order and compare whether the distance and convexity of each node are consistent with the curbstone to be judged. If they are completely consistent, they are of the same type.

[0032] ② After reversing the node numbers of the polyline element of the curbstone edge line to be judged, judge again according to ①;

[0033] ③ If the curbstone to be judged is of the same type as a curbstone of a certain type that has been determined, then set the curbstone to be judged to that type;

[0034] ④ If the curbstone to be judged is not of the same type as the curbstone with the determined model, then assign a new model to the curbstone to be judged.

[0035] Furthermore, in step S3, when drawing the detailed drawing of the curbstone, after drawing the polyline primitive of the curbstone edge line according to the coordinates and convexity of each node obtained in step S2, L(R) is marked between each node, where R is the radius of the arc and L is the length of the arc; at the same time, the model is marked for each detailed drawing of the curbstone.

[0036] Compared with the prior art, the significant advantages of this invention are: (1) Based on the principle of visual focus and combined with the procurement conditions of curb stones, this invention sets the location of constraint points, the appropriate range of curb stone blocks, and the principle of refined curb stone design. Under this principle, the landscape effect of the curved section curb stones constructed is greatly improved, and the construction quality is easier to control. (2) A program for refined design of curved section curb stones is proposed by using the remainder allocation method and combined with CAD secondary development. After verification by actual projects, the remainder allocation method satisfies the principle of refined curb stone design well and greatly reduces the design workload. Attached Figure Description

[0037] Figure 1 This is a flowchart illustrating the functional implementation of the present invention.

[0038] Figure 2 This is a real-world image of the fitting of a small straight curbstone according to the present invention.

[0039] Figure 3 This is a real-world image of the curved curbstone fitting according to the present invention.

[0040] Figure 4 This is a schematic diagram of the boundary line A of a curved segment in this invention.

[0041] Figure 5 This is a schematic diagram of the boundary line B of a curved segment in this invention.

[0042] Figure 6 This is a result diagram of the boundary line A of a curved segment of the present invention.

[0043] Figure 7 This is a result diagram of the boundary line B of a curved segment in this invention. Detailed Implementation

[0044] The inner edges of sidewalks at the ends of road green belts, safety islands, intersections, and road junctions are often designed as curves. Without refined design, small, straight curb stones are typically used for installation, resulting in poor aesthetics and low durability, failing to meet the new requirements and concepts of urban construction. Curved curb stones should be installed in sections. This invention uses the principle of visual focus to set the protruding positions of curved sections as constraint points, preset as the midpoint of the upright curb and the dividing point of the flat curb. Considering curb construction and procurement conditions, and combined with aesthetic requirements, the principle of uniform curb stone type and larger rather than smaller lengths is proposed. Then, sections are divided according to constraint point-constraint point and constraint point-curve endpoint, and the remainder distribution method is used to obtain the outer edge lines of each upright curb in the curved section. Based on the flat curb dividing point corresponding to the midpoint of the upright curb, the inner edge line of the flat curb is obtained. The distance and convexity of each node of the curb edge line are compared for consistency; if completely consistent, they are of the same type. This is used to determine the curb stone type. Combined with the preset widths of the upright and flat curb stones, a detailed curb stone drawing is created. It not only improves the efficiency and reduces the burden on designers, but also significantly enhances the road landscape and makes the construction quality of curb stones easier to control.

[0045] The present invention provides a method for refined design of curb stones in curved sections based on CAD secondary development. The method divides the curve into sections based on the distance between the constraint point and the curve endpoint on the curve polyline primitive, or between the curve endpoint and the constraint point. Combined with the preset allowable length range of a single curb stone, the method of remainder allocation is used to obtain the large-scale sample of the curb stone section.

[0046] Specifically, the following steps are included:

[0047] S1. Based on the road plan design drawing, the curve segments to be refined are screened out and processed into polyline primitives. The positions of the visual focus of pedestrians and drivers in the curve segments are set as constraint points, i.e., the protruding positions of the curve segments. The constraint points are preset as the midpoint of the curb and the boundary point of the flat curb. When the curve is not closed, the curve endpoints are set on both sides of the general road sections to determine the drawing range. Based on the distance between the constraint points and the curve endpoints on the curve polyline primitives, when the curve is closed, it is divided into multiple constraint point-constraint point segments, and when the curve is not closed, it is divided into curve endpoint-constraint point segments, multiple constraint point-constraint point segments, and constraint point-curve endpoint segments. Then, the boundary points of the curbs of the curve segments are obtained by using the remainder distribution method.

[0048] S2, after dividing the curve segment polyline primitives by the dividing point of the curbstone, the XY coordinates and convexity of each node of the polyline primitive of the outer edge of each curbstone can be obtained; the curve polyline primitives are divided according to the dividing point obtained by the remainder distribution method, and the polyline of each small block is the outer edge of the curbstone; according to the dividing point of the flat curbstone corresponding to the middle point of the curbstone, the XY coordinates and convexity of each node of the polyline primitive of the inner edge of each flat curbstone are calculated;

[0049] S3. Compare the distances and convexities of each node of the curbstone edge polyline element to see if they are consistent. If they are completely consistent, they are of the same type. If this curbstone is inconsistent with other curbstones, assign it a new curbstone type to determine the type of each curbstone. Then, based on the XY coordinates and convexities of each node of the curbstone edge polyline element obtained in step S2, and combined with the preset curbstone width, draw the large-scale curbstone drawing.

[0050] Furthermore, the calculation method for obtaining the boundary point of the curbstone of the curve segment using the remainder distribution method in step S1 is as follows:

[0051] (1): Constraint point - curve endpoint, curve endpoint - constraint point case:

[0052] The curve endpoints are set on both sides of the general road sections. The division of the curb stones in the general road sections is not restricted. After the constraint point - the curve endpoint curve segment is divided according to the standard curb stone length BL, the remaining piece can be combined with the general road section outside the endpoint and designed according to the standard straight curb stone. That is, the remainder is 0 and no further allocation is needed.

[0053] The standard length of the curbstone is BL, and the distance between the constraint point and the polyline element of the curve segment is DS. The constraint point is the midpoint of the curbstone. The distance between the boundary point of the curbstone at the constraint point and the polyline element of the curve segment is DS+BL / 2 or DS-BL / 2. The distance between the boundary points of the remaining curbstones and the polyline element of the curve segment is DS+BL*j+BL / 2 or DS-BL*j-BL / 2, where j is the j-th curbstone on both sides of the constraint point. The coordinates of the boundary point are obtained from the distance between the boundary point and the polyline element of the curve segment.

[0054] (2): Constraint point to constraint point situation:

[0055] Parameter settings: The distance between the constraint point and the curve polyline primitive is DS1 and DS2, and DS1 < DS2; Single curb length range settings: standard length BL, minimum length MinL, maximum suitable length ML, maximum length MaxL;

[0056] The constraint point is preset to the midpoint of the curbstone. The distance between the boundary point of the curbstone at the constraint point and the polyline primitive of the curve segment is DS1+BL / 2 and DS2-BL / 2. The remaining curve segments are assumed to be divided according to the standard curbstone length BL. At this time, the remaining piece is the remainder Mod. Then, within the preset allowable length range, the length of each curbstone is recalculated using the remainder allocation method.

[0057] Furthermore, in the case of constraint points to constraint points, the specific steps for recalculating the length of each curbstone using the remainder allocation method are as follows:

[0058] The constraint point is the midpoint of the curbstone. The distance between the curbstone boundary point at the constraint point and the polyline element of the curve segment is DS1+BL / 2 and DS2-BL / 2, respectively. The length of the remaining curve polyline elements is L. The method for calculating the curbstone boundary point is as follows:

[0059] 1) Assuming that when dividing according to the standard curb length BL, the number of blocks N is the integer part of L / BL, and the length Mod of the remaining block is LN*BL;

[0060] 2) The number of curb stones required for allocation based on the minimum curb length m is (BL-Mod) / (BL-MinL) rounded up; the number of curb stones required for allocation based on the maximum curb length n is Mod / (MaxL-BL) rounded up; the number of curb stones required for allocation based on the maximum suitable curb length i is Mod / (ML-BL) rounded up; the smaller values ​​of m and n are set to Min;

[0061] 3) Obtain the length of each curbstone;

[0062] ①N≥Min and m and n are smaller than n. If N≥i, select i curb stones from the two constraint points toward the middle of the curve segment and adjust their length to BL+Mod / i. The rest are of standard length BL. Otherwise, select n curb stones and adjust their length to BL+Mod / n. The rest are of standard length BL. The number of curb stones is N.

[0063] ② If N≥Min and m and n are both less than m, select m curb stones sequentially from the two constraint points toward the middle of the curve segment, adjust their length to BL-(BL-Mod) / m, and keep the standard length BL for the rest. The number of curb stones is N+1; ③ If N<Min, the curb stones cannot be divided within the preset suitable range, then the following division scheme is adopted:

[0064] I. The number of curb stones is N, and the length of a single curb stone is L / N;

[0065] II. The number of curb stones is N+1, and the length of a single curb stone is L / (N+1);

[0066] 6) Based on the length of the curbstone blocks and the distance of the constraint points on the curve polyline primitives in step 3), the distance of each curbstone boundary point on the curve segment polyline primitives is calculated iteratively to obtain the boundary point coordinates.

[0067] Furthermore, the method for obtaining the XY coordinates and convexity of each node of the polyline primitive on the outer edge of the curbstone in step S2 is as follows:

[0068] Based on the polyline primitives of the curve segment and the starting and ending points of each curbstone, determine whether there are nodes between the starting and ending points. If not, calculate the XY coordinates and convexity of each node of the polyline primitive of this curbstone edge line by combining the midpoints of the starting and ending points. If they exist, calculate the polyline convexity corresponding to the starting point after dividing the polyline primitive of the curve segment at the starting point, set the convexity of the ending point to 0, and obtain the XY coordinates and convexity of each node of this polyline primitive of this curbstone edge line by combining the XY coordinates and convexity of the nodes between the starting and ending points.

[0069] Furthermore, the determination method in step S3 is as follows:

[0070] ① Based on the distance of each node of the polyline element on the curbstone edge, arrange the nodes in ascending order and compare whether the distance and convexity of each node are consistent with the curbstone to be judged. If they are completely consistent, they are of the same type.

[0071] ② After reversing the node numbers of the polyline element of the curbstone edge line to be judged, judge again according to ①;

[0072] ③ If the curbstone to be judged is of the same type as a curbstone of a certain type that has been determined, then set the curbstone to be judged to that type;

[0073] ④ If the curbstone to be judged is not of the same type as the curbstone with the determined model, then assign a new model to the curbstone to be judged.

[0074] Furthermore, in step S3, when drawing the detailed drawing of the curbstone, after drawing the polyline primitive of the curbstone edge line according to the coordinates and convexity of each node obtained in step S2, L(R) is marked between each node, where R is the radius of the arc and L is the length of the arc; at the same time, the model is marked for each detailed drawing of the curbstone.

[0075] The embodiments of the present invention will be further described below with reference to the accompanying drawings.

[0076] This invention discloses a method for refined design of curb stones on curved sections based on CAD.NET secondary development, comprising:

[0077] The curve segment polyline primitives are refined into specific curb stones according to the preset curb stone length range constraints, and a large-scale drawing of the curb stone is provided.

[0078] Combination Figure 1 A method for refined design of curb stones on curved sections based on CAD.NET secondary development includes the following steps:

[0079] S1. Based on the road plan design, after screening and integration, obtain the boundary lines of all curve segments, and first obtain the coordinates of the boundary points of the curbstone division.

[0080] Between constraint points and polyline endpoints: (corresponding to curve segments within dividing zones, non-closed polylines)

[0081] 1) The principle is: based on the constraint point (preset using the center of the circle), the standard curb length (default is 75cm) is cyclically offset to both sides until the straight section is reached.

[0082] ① Calculate the distance DS between the constraint point and the curb boundary line.

[0083] ② Determine the coordinates of the curbstone boundary points by cyclically increasing the distance from DS+ to the standard curbstone length and cyclically decreasing the distance from DS- to the standard curbstone length.

[0084] Between constraint points: (corresponding to curve segments of safety islands, closed polylines)

[0085] 1) Calculate the number of curb stones N and the remaining curb stone length Mod (Mod < 75cm) when dividing the curb stones according to the standard curb stone length.

[0086] 2) Calculate the number of curb stones n required to keep the remaining curb length Mod within the maximum allowable deviation range (maximum allowable deviation = maximum curb length - minimum curb length, default is 100-70=30cm).

[0087] 3-1) When N≥n, the curbstone can be divided within the maximum permissible deviation range:

[0088] ① When the remaining curb length Mod is less than the optimal increase length (default is 85-75=10cm) × the number of curb stones N (the optimal increase length is the most suitable range for increasing the curb length), first calculate the number of curb stones M required according to the optimal increase length, then calculate the increase length to allocate the remaining curb length Mod to M curb stones, and prioritize the allocation to the curve sections on both sides to ensure that the straight sections use standard curb stones. In this case, the number of curb stones is N.

[0089] ② When 75cm—remaining curb length Mod < optimal reduction length (default is 75-70=5cm) × number of curb stones N (optimal reduction length is the most suitable range for curb length reduction), first calculate the number of curb stones M required according to the optimal reduction length, then calculate the reduction length to allocate (75cm—remaining curb length Mod) to M curb stones, prioritizing allocation to the curved sections on both sides to ensure that standard curb stones are used on straight sections. In this case, the number of curb stones is N+1.

[0090] ③ When the remaining curb length Mod is less than the maximum increase length (default is 100-70=30cm) × the number of curb stones N (the maximum increase length is the maximum range of curb length increase), first calculate the number of curb stones M required according to the maximum increase length, then calculate the increase length to allocate the remaining curb length Mod to M curb stones, and prioritize the allocation to the curve sections on both sides to ensure that the straight sections use standard curb stones. In this case, the number of curb stones is N.

[0091] 3-2) When N < n, if the curbstone cannot be divided within the maximum allowable deviation range, then a division scheme is provided for selection:

[0092] Two options are provided:

[0093] ① The number of curb stones is N = int(L / standard curb stone length), and the length of a single curb stone is L / N. The curb stone length is greater than the standard curb stone length.

[0094] ② The number of curb stones is M = int(L / standard curb stone length) + 1, where the length of a single curb stone is L / M. The curb stone length is less than the standard curb stone length.

[0095] The two schemes mentioned above are the two schemes that are closest to the standard curb length when dividing the curb, and are used for selection and confirmation.

[0096] 4) After determining the number of curb stones and the length of each section, obtain the coordinates of the boundary points of the curb stones in sequence.

[0097] S2, extract the curbstone boundary line.

[0098] Based on the polyline primitives of the curve segment boundary line and the starting and ending points of the curbstone, determine whether there is a node between the starting and ending points. If there is no node, obtain the curbstone information list by combining the midpoint between the starting and ending points [C]. If there is a node, calculate the polyline convexity corresponding to the starting point after dividing the existing polyline primitives at the starting point, set the convexity of the ending point to 0, and obtain the curbstone information list [C].

[0099] S3, Determine the curbstone type

[0100] The system iteratively checks whether the curbstone matches an existing curbstone model. The method for determination is as follows:

[0101] ① In ascending order of node distance, compare the distance and convexity of existing curbstone polyline nodes with those of the curbstone to be judged. If they are completely consistent, they are of the same type.

[0102] ② After reversing the order of the existing line node numbers, perform the judgment again according to ①.

[0103] S4, Draw the curbstone

[0104] Based on the preset curb width and the obtained single curb boundary polyline, draw the large-scale curb drawing respectively. After calculating the radius of the arc based on the node coordinates and convexity, mark L(R) between each node, where R is the radius of the arc and L is the length of the arc. At the same time, mark the block curb model on the curb layout map.

[0105] Preferably, the software can perform fine-grained design of curb stones on curved sections.

[0106] Preferably, the S1 method is for calculating the curbstone division of curved sections.

[0107] Preferably, the method for screening curbstone types in S2 is described.

[0108] Preferably, the annotation method for the large-scale drawing of the curbstone in S4 adopts L(R), where R is the radius of the arc and L is the length of the arc.

[0109] The following is a detailed implementation process of the present invention, with specific steps described below.

[0110] Step 1: Obtain the coordinates of the boundary points for the curbstone division and the boundary lines of the curbstone curve segments.

[0111] 1) Users screen out the curve segments to be refined based on the road plan design and process them into a polyline primitive.

[0112] 2) Set the position of the visual focus of pedestrians and drivers in the curve segment as the constraint point, that is, the convex position of the curve segment. In order to facilitate user review and modification, this invention uses the center of a circle to represent it, that is, the user needs to draw a circular primitive at the position of the constraint point.

[0113] 3) Obtain the coordinates of the boundary points for the curbstone division.

[0114] This time, we selected constraint points—constraint points. Figure 4 The distance between the constraint points of the curve segment is 1022.71 cm, denoted as A and B. Figure 5 Taking the distance between two constraint points on the curve segment as 518.0 cm, denoted as B, as an example, the specific calculation method is as follows:

[0115] The length range of a single curbstone is set as follows: standard length BL = 75cm, minimum length MinL = 70cm, maximum suitable length ML = 85cm, and maximum length MaxL = 100cm.

[0116] ① Assume the number of curb stones N and the remainder Mod required based on the standard curb stone length.

[0117] From 1022.71 / 75 = 13 stones, there is a remainder of 47.71cm. Therefore, A needs 13 curb stones, with a remaining length of 47.71cm.

[0118] From 518.0 / 75 = 6 stones, we can conclude that B needs 6 curb stones, with 68cm remaining.

[0119] ② Calculate the number of blocks required for the remainder Mod allocation: m is the number of blocks required for the minimum curb length; n is the number of blocks required for the maximum curb length; i is the number of blocks required for the maximum suitable curb length. The smaller values ​​of m and n are set as Min.

[0120] Curve segment m blocks n blocks i block Min block A 6 2 5 2 B 2 3 7 2

[0121] ③ For A, N = 13 blocks > Min = 2, Min = n, and N ≥ i, it can be seen that the refined design of the curb stones for curve segment A is as follows:

[0122] The number of curb stones is 47.74 / (85-75), rounded up to 5. The lengths of the curb stones are 37.5cm, 79.774cm, 79.774cm, 79.774cm, 75cm, 75cm, 75cm, 75cm, 75cm, 75cm, 75cm, 79.774cm, 79.774cm, and 37.5cm.

[0123] For B, N = 6 blocks > Min, Min = m, so the refined design of the curbstones for B is as follows:

[0124] The number of curb stones is (75-68) / (75-70) rounded up to 2. The lengths of the curb stones are 37.5cm, 71.5cm, 75cm, 75cm, 75cm, 75cm, 71.5cm, and 37.5cm respectively.

[0125] Step 2: Cut out the curbstone boundary line

[0126] 1) When the starting coordinates of curve segments A and B are (0, 0, 0), based on the length of each curbstone calculated in step 1, the starting and ending points of the curbstones can be determined as follows:

[0127] Curbstone serial number Curbstone starting coordinates Curbstone End Coordinates A1 0，0 15.935，2.641 A2 15.935，2.641 29.405，-6.695 A3 29.405，-6.695 40.247，-17.060 A4 40.247，-17.060 51.090，-27.425 A5 51.090，-27.425 61.933，-37.790 A6 61.933，-37.790 72.775，-48.155 A7 72.775，-48.155 83.618，-58.521 A8 83.618，-58.521 94.461，-68.886 A9 94.461，-68.886 105.303，-79.251 A10 105.303，-79.251 116.146，-89.616 A11 116.146，-89.616 128.165，-101.106 A12 128.165，-101.106 141.361，-113.721 A13 141.361，-113.721 150.630，-126.857

[0128]

[0129]

[0130] 2) Extract the polyline primitives of the boundary line of each curbstone based on the polyline primitives of the curve segment and the start and end points of the curbstone.

[0131] Step 3: Determine the curbstone type and draw a detailed drawing.

[0132] 1) Compare the distances and convexities of each node of the curb edge polyline obtained in step 2 with those of the already determined curb type. If they are completely consistent, they are of the same type. Reverse the node numbers of the curb edge polyline element to be judged and judge again. If the curb to be judged is of the same type as a curb of a certain already determined type, then set the curb to be judged to that type; if the curb to be judged is not of the same type as any of the already determined curb types, then assign a new type to the curb to be judged.

[0133] 2) Based on the preset curbstone width and the obtained polyline boundary of a single curbstone, draw detailed curbstone drawings respectively. After calculating the radius of the arc based on the node coordinates and convexity, label each node. Simultaneously, label the curbstone layout map with the type of each curbstone block, such as... Figure 6 , 7 .

Claims

1. A method for refined design of curb stones on curved sections based on CAD secondary development, characterized in that: Based on the distances between constraint points and curve endpoints on the curve polyline primitive, the curve is divided into segments consisting of curve endpoints and constraint points, or constraint points and constraint points. Combining this with the preset allowable length range for a single curbstone block, the remainder allocation method is used to obtain the curbstone block layout. Specifically, this includes the following steps: S1. Based on the road plan design drawing, the curve segments to be refined are screened out and processed into polyline primitives. The positions of the visual focus of pedestrians and drivers in the curve segments are set as constraint points, i.e., the protruding positions of the curve segments. The constraint points are preset as the midpoint of the curb and the boundary point of the flat curb. When the curve is not closed, the curve endpoints are set on both sides of the general road sections to determine the drawing range. Based on the distance between the constraint points and the curve endpoints on the curve polyline primitives, when the curve is closed, it is divided into multiple constraint point-constraint point segments, and when the curve is not closed, it is divided into curve endpoint-constraint point segments, multiple constraint point-constraint point segments, and constraint point-curve endpoint segments. Then, the boundary points of the curbs of the curve segments are obtained by using the remainder distribution method. S2, after dividing the curve segment polyline element by the dividing point of the curb stone, the XY coordinates and convexity of each node of the polyline element of the outer edge of each curb stone can be obtained; based on the middle point of the curb stone corresponding to the dividing point of the flat curb stone, the XY coordinates and convexity of each node of the polyline element of the inner edge of each flat curb stone can be calculated. S3. Compare the distances and convexities of each node of the curbstone edge polyline element to see if they are consistent. If they are completely consistent, they are of the same type. If this curbstone is inconsistent with other curbstones, assign it a new curbstone type to determine the type of each curbstone. Then, based on the XY coordinates and convexities of each node of the curbstone edge polyline element obtained in step S2, and combined with the preset curbstone width, draw the large-scale curbstone drawing.

2. The method for refined design of curb stones for curved sections based on CAD secondary development according to claim 1, characterized in that, The calculation method for obtaining the boundary point of the curbstone of the curve segment using the remainder distribution method in step S1 is as follows: (1): Constraint point - curve endpoint, curve endpoint - constraint point case: The curve endpoints are set on both sides of the general road sections. The division of the curb stones in the general road sections is not restricted. After the constraint point - the curve endpoint curve segment is divided according to the standard curb stone length BL, the remaining piece can be combined with the general road section outside the endpoint and designed according to the standard straight curb stone. That is, the remainder is 0 and no further allocation is needed. The standard length of the curbstone is BL, and the distance between the constraint point and the polyline element of the curve segment is DS. The constraint point is the midpoint of the curbstone. The distance between the boundary point of the curbstone at the constraint point and the polyline element of the curve segment is DS+BL / 2 or DS-BL / 2. The distance between the boundary points of the remaining curbstones and the polyline element of the curve segment is DS+BL*j+BL / 2 or DS-BL*j-BL / 2, where j is the j-th curbstone on both sides of the constraint point. The coordinates of the boundary point are obtained from the distance between the boundary point and the polyline element of the curve segment. (2): Constraint point to constraint point situation: Parameter settings: The distance between the constraint point and the curve polyline primitive is DS1 and DS2, and DS1 < DS2; Single curb length range settings: standard length BL, minimum length MinL, maximum suitable length ML, maximum length MaxL; The constraint point is preset to the midpoint of the curbstone. The distance between the boundary point of the curbstone at the constraint point and the polyline primitive of the curve segment is DS1+BL / 2 and DS2-BL / 2. The remaining curve segments are assumed to be divided according to the standard curbstone length BL. At this time, the remaining piece is the remainder Mod. Then, within the preset allowable length range, the length of each curbstone is recalculated using the remainder allocation method.

3. The method for refined design of curb stones for curved sections based on CAD secondary development according to claim 2, characterized in that, The specific steps for recalculating the length of each curbstone using the remainder allocation method in the case of constraint points to constraint points are as follows: The constraint point is the midpoint of the curbstone. The distance between the curbstone boundary point at the constraint point and the polyline element of the curve segment is DS1+BL / 2 and DS2-BL / 2, respectively. The length of the remaining curve polyline elements is L. The method for calculating the curbstone boundary point is as follows: 1) Assuming that when dividing according to the standard curb length BL, the number of blocks N is the integer part of L / BL, and the length Mod of the remaining block is LN*BL; 2) The number of curb stones required for allocation based on the minimum curb length m is (BL-Mod) / (BL-MinL) rounded up; the number of curb stones required for allocation based on the maximum curb length n is Mod / (MaxL-BL) rounded up; the number of curb stones required for allocation based on the maximum suitable curb length i is Mod / (ML-BL) rounded up; the smaller values ​​of m and n are set to Min; 3) Obtain the length of each curbstone; ①N≥Min and m and n are smaller than n. If N≥i, select i curb stones from the two constraint points toward the middle of the curve segment and adjust their length to BL+Mod / i. The rest are of standard length BL. Otherwise, select n curb stones and adjust their length to BL+Mod / n. The rest are of standard length BL. The number of curb stones is N. ②If N≥Min and m and n are both smaller than m, select m curb stones from the two constraint points toward the middle of the curve segment, adjust their length to BL-(BL-Mod) / m, and the rest are of standard length BL. The number of curb stones is N+1. ③ If N < Min, and the curbstone cannot be divided within the preset suitable range, then the following division scheme shall be adopted: I. The number of curb stones is N, and the length of a single curb stone is L / N; II. The number of curb stones is N+1, and the length of a single curb stone is L / (N+1); 4) Based on the length of the curbstone blocks and the distance of the constraint points on the curve polyline primitives in step 3), the distance of each curbstone boundary point on the curve segment polyline primitives is calculated iteratively to obtain the boundary point coordinates.

4. The method for refined design of curb stones for curved sections based on CAD secondary development according to claim 1, characterized in that, The method for obtaining the XY coordinates and convexity of each node of the polyline primitive on the outer edge of the curbstone in step S2 is as follows: Based on the polyline primitive of the curve segment and the starting and ending points of each curbstone, determine whether there are nodes between the starting and ending points. If not, combine the midpoint of the starting and ending points to calculate the XY coordinates and convexity of each node of the polyline primitive of this curbstone edge line. If it exists, calculate the polyline convexity of the starting point after dividing the curve segment into polyline elements, set the endpoint convexity to 0, and combine the XY coordinates and convexity of the nodes between the starting and ending points to obtain the XY coordinates and convexity of each node of the polyline element of this curb edge line.

5. The method for refined design of curb stones for curved sections based on CAD secondary development according to claim 1, characterized in that, The determination method for step S3 is as follows: ① Based on the distance of each node of the polyline element on the curbstone edge, arrange the nodes in ascending order and compare whether the distance and convexity of each node are consistent with the curbstone to be judged. If they are completely consistent, they are of the same type. ② After reversing the node numbers of the polyline element of the curbstone edge line to be judged, judge again according to ①; ③ If the curbstone to be judged is of the same type as a curbstone of a certain type that has been determined, then set the curbstone to be judged to that type; ④ If the curbstone to be judged is not of the same type as the curbstone with the determined model, then assign a new model to the curbstone to be judged.

6. The method for refined design of curb stones for curved sections based on CAD secondary development according to claim 1, characterized in that, In step S3, when drawing the detailed drawing of the curbstone, after drawing the polyline primitive of the curbstone edge line according to the coordinates and convexity of each node obtained in step S2, L(R) is marked between each node, where R is the radius of the arc and L is the length of the arc; at the same time, the model is marked for each detailed drawing of the curbstone.

Images