2017
DOI: 10.1016/j.precisioneng.2016.09.008
|View full text |Cite
|
Sign up to set email alerts
|

Profile error evaluation of free-form surface using sequential quadratic programming algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
12
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 28 publications
(12 citation statements)
references
References 21 publications
0
12
0
Order By: Relevance
“…The normal vector and curvature are important differential geometric properties that reflect the local geometric features of the surface, and are also the main influencing parameters of the point cloud space region. Before the point cloud space segmentation, the topological relationship of the scattered point cloud data is established, and the basic parameters such as the curvature and the normal vector at a certain point of the local surface are estimated (7)(8). Aiming at the characteristics of scattered, disordered and no obvious topological relationship of curved point surface cloud data, the method of estimating local feature quantity is studied.…”
Section: Point Cloud Space Segmentationmentioning
confidence: 99%
See 1 more Smart Citation
“…The normal vector and curvature are important differential geometric properties that reflect the local geometric features of the surface, and are also the main influencing parameters of the point cloud space region. Before the point cloud space segmentation, the topological relationship of the scattered point cloud data is established, and the basic parameters such as the curvature and the normal vector at a certain point of the local surface are estimated (7)(8). Aiming at the characteristics of scattered, disordered and no obvious topological relationship of curved point surface cloud data, the method of estimating local feature quantity is studied.…”
Section: Point Cloud Space Segmentationmentioning
confidence: 99%
“…Meng Xianglin improved the minimum spanning tree method, and divided the scattered points into flat and non-flat points. Using the idea of propagation to adjust the normal vector, it is judged whether the neighborhood of the data points contains non-flat points to select the corresponding adjustment direction, and the adjustment method is improved (5)(6)(7)(8)(9). The efficiency of the vector direction, but neglecting the problem of independent k-neighborhood, this paper adopts the improved method of law loss propagation adjustment above, and adjusts the independent k-neighbor data to ensure the accuracy and fastness of normal adjustment.…”
Section: Point Cloud Space Segmentationmentioning
confidence: 99%
“…The optimization method. At present, optimization techniques are widely used in error evaluation, such as the simplex method [5], differential evolution algorithm [6] [7], and sequential quadratic programming (SQP) [8]. Our team also tried to model the DMMR coaxiality error with the constrained target optimization problem and used several optimization algorithm to solve it [9].…”
Section: Introductionmentioning
confidence: 99%
“…If an optimization method is used to evaluate an error as a maximum or a minimum, an error objective function should be established. Currently, a plethora of optimization methods are available, such as the Quasi-Newton method for unconstrained problems; repetitive bracketing method and simplex method for constrained problems [9]; particle swarm optimization and differential evolution algorithm for complex gradient and multi-minimum problems [10,11]; and inner point method, Active-Set Method (ASM), and Sequential Quadratic Programming (SQP) for medium-scale constrained problems [12]. However, no error function for the considered feature and its datum feature has been created.It can be seen that establishing the error objective functions for Coaxiality-DM error is key to evaluating Coaxiality-DM tolerance, and some related work has been done in this area:  A 3D model for axis-symmetric features of Coaxiality-DM tolerance was established based on two assumptions: dimensional, orientation, and location errors were very small; and form error was much smaller [13].…”
mentioning
confidence: 99%
“…If an optimization method is used to evaluate an error as a maximum or a minimum, an error objective function should be established. Currently, a plethora of optimization methods are available, such as the Quasi-Newton method for unconstrained problems; repetitive bracketing method and simplex method for constrained problems [9]; particle swarm optimization and differential evolution algorithm for complex gradient and multi-minimum problems [10,11]; and inner point method, Active-Set Method (ASM), and Sequential Quadratic Programming (SQP) for medium-scale constrained problems [12]. However, no error function for the considered feature and its datum feature has been created.…”
mentioning
confidence: 99%