Pith. sign in

REVIEW 3 major objections 5 minor 31 references

Hierarchical Error Assessment of CAD Models for Aircraft Manufacturing-and-Measurement

T0 review · 3 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

Pith's one-line read The paper proposes HEA-MM, a pipeline that grades a manufactured aircraft part from one structured-light scan by measuring global, patch-level, and hole-level errors against the reference CAD model.

desk verdict The part-level error metric measures the wrong thing—distance from fitted primitive to CAD rather than from measured points—so the paper's main novelty doesn't yet support its accuracy claim. read the letter →

arxiv 2506.10594 v1 pith:4BCSJ5X5 submitted 2025-06-12 cs.CV

classification cs.CV
keywords 3Dmeasurementpointcloudsprimitiverefinementmulti-circlefittinghierarchicalerrorassessmentaircraftmanufacturinginspectionCADmodelregistration
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper argues that manufacturing errors in aircraft parts can be assessed automatically and hierarchically from a single 3D scan, instead of the manual coordinate-measuring-machine inspections that are slow and human-error-prone. Its proposed framework, HEA-MM, registers a scanned point cloud against the reference CAD model and then reports errors at three levels: the whole part, individual geometric patches, and circular holes. The authors claim this is the first hierarchical error-assessment framework embedded in a manufacturing-and-measurement platform, and that it improves the efficiency of aircraft inspection. If the claim holds, a scanned part can be accepted or rejected, and the location and size of deviations traced, without touching the part by hand.

What carries the argument

The load-bearing mechanism is the three-level error decomposition of the registered point cloud, with the part level carried by an optimization-based primitive-refinement energy $E = \omega_f E_f + \omega_s E_s + \omega_c E_c$ whose fidelity, simplicity, and completeness terms drive splitting and merging operations over four primitive types (plane, sphere, cone, cylinder), and whose exploration stops when no operation lowers the energy. The feature level is carried by a two-stage circular-hole detector: curvature-weighted tensor voting identifies edge points, and a hypothesize-and-clusterize multi-circle fitting scheme, built on multi-class cascaded T-linkage with iterative outlier rejection, estimates radii and centroids. The global level is carried by the RMSE distance from the whole scanned cloud to the CAD surface after coarse-to-fine registration.

What would settle it

Scan a test aircraft part that includes both drilled circular holes and a freeform B-spline blade surface, run HEA-MM end to end, and compare the part-level patch boundaries and the fitted circle radii with a coordinate-measuring-machine measurement of the same part; if the freeform region is over- or under-segmented or the circle radii deviate beyond scanner noise, the hierarchical-error claim is falsified.

Watch

Extended reading notes

Core claim

The central claim is that a single structured-light scan of a manufactured aircraft part, registered against its reference CAD model, can be turned into a complete manufacturing-error report by evaluating three nested levels: the global root-mean-square deviation of the whole cloud; per-patch errors on primitives recovered by a new optimization-based refinement that splits and merges candidate planes, spheres, cones, and cylinders; and per-hole errors on circular features detected by curvature-weighted tensor voting plus a hypothesize-and-clusterize multi-circle fitter. The paper reports millimetre-scale errors on real aircraft parts and states that the registration error is roughly an order of magnitude smaller than the three-level errors, so the measured deviations are attributed to manufacturing rather than alignment. The authors claim this is the first hierarchical error-assessment framework embedded in a manufacturing-and-measurement platform, and they record in Section IV-D that the part-level stage assumes the four primitive types and can fail on freeform B-spline/NURBS surfaces.

Load-bearing premise

The part-level analysis assumes every region of the scanned part can be represented by one of four simple geometric shapes (plane, sphere, cylinder, or cone) and that a region's shape type does not change while being split or merged; the paper says in Section IV-D that freeform B-spline/NURBS surfaces may therefore fail to segment.

Editorial extensions

If this is right

  • A single scan of a workpiece yields pass/fail decisions plus error values in millimetres at three levels: whole part, each geometric patch, and every detected circular hole.
  • Because the reported registration error is roughly an order of magnitude smaller than the three-level errors, the deviations calculated after alignment can be read as manufacturing error rather than scan-alignment noise.
  • Part-level patch errors turn a whole-part rejection into a region-specific diagnosis, telling the factory which patch of the workpiece drifted from design.
  • Feature-level radius and centroid deviations give a quantitative check on hole size and placement, which are the dimensions that matter for assembly fit.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • As an editorial extension, the same hierarchy could be fed back to the milling step: repeated part-level errors on the same patch could trigger a tool-wear or fixture correction, closing a loop the paper does not describe.
  • A direct test against coordinate-measuring-machine values on the same physical parts would confirm whether the scan-derived hole radii and centroid deviations are accurate in absolute millimetres; the paper reports errors relative to the CAD model.
  • Replacing the fixed four-primitive assumption with a re-fitting rule for freeform surfaces would extend the framework to sculpted parts such as blades, which the paper's Section IV-D acknowledges as the current failure mode.
  • The hypothesize-and-clusterize multi-circle stage could be reused for other assembly-critical features such as slots and countersinks, which the authors list as future work.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper proposes HEA-MM, a hierarchical pipeline for assessing manufacturing errors of aircraft parts by comparing structured-light scans with reference CAD models. After coarse-to-fine registration (FGR plus ICP), the framework reports errors at three levels: global RMSE, part-level distances computed from refined geometric primitives (plane, sphere, cylinder, cone), and feature-level errors for circular holes detected by tensor-voting edge extraction and multi-circle fitting. The method is evaluated on three aircraft CAD models and on synthetic circle data, with comparisons against RANSAC, PointNet++, HPNet, KF, T-linkage, and MSH. The authors claim this is the first hierarchical error assessment framework within a manufacturing-and-measurement platform and that it enables accurate automated error assessment.

Significance. If the central claims are supported, the framework would be a useful industrial tool for automated multi-level inspection, integrating global, part, and feature error analysis on real scanned parts. The paper has genuine strengths: the error measures are defined against an external CAD reference rather than quantities fitted from the data, so there is no circularity; the experiments use real scanned data from a deployed platform; the multi-circle fitting is evaluated quantitatively on synthetic data with misclassification error and on real data with false-negative/false-positive counts; and runtime is reported. However, the evaluation is thin: only three real models are used, no repeated trials or error bars are given, the part-level metric is defined from fitted primitives rather than measured points, and the primitive segmentation is evaluated only visually. These gaps currently prevent the paper from supporting the claim that HEA-MM enables accurate error assessment at the part level.

major comments (3)
  1. [Section III-D, Eq. (6)] The part-level error is defined as the average and maximum distance from each fitted primitive to the reference CAD model, not from the measured points to the CAD model. Since the primitive is a best-fit plane, sphere, cylinder, or cone, any within-patch deviation that does not displace the best-fit primitive—such as a warp, a dent, or a saddle-shaped region—is invisible to E_part_avg and E_part_max. Even with a perfect segmentation, a warped planar patch can have a best-fit plane close to the CAD plane while the underlying scanned points deviate substantially. The global RMSE captures such residuals, but the part-level report, which is the level where the paper's main algorithmic contribution lies, does not. The paper provides no per-patch comparison of primitive-based distances against direct point-to-CAD distances, and no ground-truth part-level errors. This is a load-bearing issue for the central claim that HEA-MM 'enables accurate error assessment'; the part-level metric must be supplemented with, or replaced by, direct point-to-CAD residual statistics per patch.
  2. [Section IV, Tables I and V] The experimental evaluation is too thin to support the generality claimed in the title and abstract. Only three real aircraft models are reported, with no repeated scans, no error bars, and no uncertainty quantification; the values in Table I (main text) and Table V (supplementary) differ for the same model labels (1), (2), (3), without any explanation of whether these are different scans, different models, or corrected numbers. Additionally, the primitive segmentation results in Figures 4 and 8 are evaluated only visually, and the supplementary material explicitly states that 'there is no ground truth of the detection results.' To substantiate the central claims, the authors should provide quantitative primitive-segmentation evaluation on data with known ground truth, report variance across repeated measurements, and clarify the relationship between Tables I and V. The feature-level circle detection is compared with baselines only in terms of false negatives and false positives; the radius and centroid errors in Tables I and V are reported only for the proposed method, without comparison to alternative circle-fitting methods on the same real scans.
  3. [Section IV-D] The authors candidly state that the method 'might fail to get satisfied segmentation results due to the B-spline/NURBS surfaces, or other more complex shapes.' This is an honest limitation, but the abstract and conclusion claim applicability to 'aircraft CAD models' without this qualification. Since aircraft parts commonly contain freeform surfaces, the four-primitive assumption materially restricts the scope of the central claim. The paper should either narrow its claims to models composed of planes, spheres, cylinders, and cones, or demonstrate how the framework handles models with freeform surfaces. This is not an internal inconsistency, but it is a generality restriction that should be reflected in the title and contributions.
minor comments (5)
  1. [Section III-E, Eq. (10)] In Eq. (10), the last definition is labeled 'Ecomp radius avg' but should be 'Ecomp centroid avg'; the current labeling duplicates the radius-average symbol and makes the equation confusing.
  2. [Section III-E, Eq. (7)] The tensor-voting weight is defined using a vector q_j = ||v_i - v_j||, so q_j is a scalar; writing ||q_j|| in the exponential is redundant. More importantly, the denominator ||v_j v_j^T|| in Eq. (7) is not standard notation—the usual stick-tensor form is v_j v_j^T / ||v_j||^2—so the formula should be clarified or corrected.
  3. [Supplementary material, Table IV] The caption says 'false negative and false negative cases'; it should read 'false negatives and false positives.' The sentence 'fn and fp denote the number of errors and misses' is also imprecise and should be rephrased.
  4. [Section IV-C] The parameters (energy weights, inlier threshold, tensor-voting sigma, edge threshold, and iteration limits) are fixed empirically with no sensitivity analysis. Since several of these parameters interact, a brief sensitivity study—for example, varying each parameter by a factor of two while reporting the resulting errors—would substantially strengthen the reproducibility claims.
  5. [Section IV-A, Figure 4] The claim that learning-based methods produce poor results on edge regions is supported only by visual inspection of a single rivet example; a quantitative comparison, even on a small set of labeled patches, would be more persuasive.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: all error levels are measured against the external CAD model; self-citations are auxiliary only.

full rationale

The error metrics are defined with respect to the external CAD model, not fitted to the reported error values. Global-level error (Eq. 1) is point-to-CAD RMSE. Part-level error (Eq. 6) is the distance from fitted primitives to the CAD model. Feature-level error (Eq. 10) compares fitted circle radii and centroids with CAD ground truth. The primitive and circle fitting procedures operate on the scan geometry, not on the error tables, so no derived quantity is forced to equal an input by construction. The paper cites same-author works [22], [23], [31] for denoising and evaluation metrics, but these are auxiliary pipeline components and do not carry the central hierarchical-error-assessment claim. Section IV-D openly acknowledges the four-primitive limitation for B-spline/NURBS surfaces; this is a generality limitation, not a circularity. The part-level metric's insensitivity to non-primitive warps is a validity concern that would require ground-truth comparison, but it is not a case where the derived quantity equals an input by construction. Overall, the derivation chain is self-contained and externally anchored by the CAD reference model, with only minor non-load-bearing self-citations.

Assumptions & free parameters 6 free parameters · 4 assumptions · 0 invented entities

The central claim depends on the assumptions that parts are built from four primitives and that distances to the CAD model measure error; both are standard domain assumptions. No new entities are introduced. Several hyperparameters are hand-tuned but not fitted to the reported error values.

free parameters (6)
  • Energy weights (ωf, ωs, ωc) = 0.6, 0.25, 0.15
    Set empirically in Section IV-C to balance fidelity, simplicity, and completeness in Equation 2. They affect the part-level segmentation and thus the reported part-level errors.
  • Inlier distance threshold ϵ = 0.1
    Used in multi-circle fitting outlier rejection, Section III-E.2, empirically fixed.
  • Parameter variation threshold η = 0.03
    Stops iterative circle refinement in Section III-E.2 and Section IV-C.
  • Maximum iteration count It = 150
    Limits iterative circle fitting, Section IV-C.
  • Tensor-voting Gaussian width σ = 0.5
    Used in the voting weight of Equation 7, fixed empirically.
  • Edge point threshold Wi = ≥ 1.05
    Decides whether a point is an edge point in Equation 9, set empirically.
assumptions (4)
  • domain assumption Aircraft CAD models consist only of planes, spheres, cylinders, and cones.
    Invoked in Section III-D for part-level segmentation; the authors note in Section IV-D that B-spline/NURBS surfaces would break this assumption.
  • domain assumption The geometric type of a primitive does not change after splitting or merging.
    Stated in Section III-D: 'we assume that the type of a primitive remains unchanged before and after the operation.' This restricts the search space.
  • domain assumption The point-to-CAD distance is a valid measure of manufacturing error.
    Global and part-level errors in Equations 1 and 6 are computed as distances to the CAD model; this assumes the CAD geometry is the correct reference and the registration is accurate enough.
  • domain assumption The residual matrix of point-to-hypothesis distances captures circle membership.
    The multi-circle fitting step in Section III-E.2 clusters points by residual similarity, assuming that residuals differ strongly between circles and outliers.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Hierarchical Error Assessment of CAD Models for Aircraft Manufacturing-and-Measurement." pith.science (2026). https://pith.science/paper/4BCSJ5X5

@misc{pith2026250610594,
  author       = {Pith},
  title        = {Pith review of: Hierarchical Error Assessment of CAD Models for Aircraft Manufacturing-and-Measurement},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/4BCSJ5X5}},
  note         = {Machine review of arXiv:2506.10594}
}
read the original abstract

The most essential feature of aviation equipment is high quality, including high performance, high stability and high reliability. In this paper, we propose a novel hierarchical error assessment framework for aircraft CAD models within a manufacturing-and-measurement platform, termed HEA-MM. HEA-MM employs structured light scanners to obtain comprehensive 3D measurements of manufactured workpieces. The measured point cloud is registered with the reference CAD model, followed by an error analysis conducted at three hierarchical levels: global, part, and feature. At the global level, the error analysis evaluates the overall deviation of the scanned point cloud from the reference CAD model. At the part level, error analysis is performed on these patches underlying the point clouds. We propose a novel optimization-based primitive refinement method to obtain a set of meaningful patches of point clouds. Two basic operations, splitting and merging, are introduced to refine the coarse primitives. At the feature level, error analysis is performed on circular holes, which are commonly found in CAD models. To facilitate it, a two-stage algorithm is introduced for the detection of circular holes. First, edge points are identified using a tensor-voting algorithm. Then, multiple circles are fitted through a hypothesize-and-clusterize framework, ensuring accurate detection and analysis of the circular features. Experimental results on various aircraft CAD models demonstrate the effectiveness of our proposed method.

Figures

Figures reproduced from arXiv: 2506.10594 by the authors.

Figure 1
Figure 1. Our proposed manufacturing-and-measurement platform. A robotic arm selects raw materials and feeds them into the manufacturing module, processing [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. The pipeline of our method. Taking a scanned point cloud and the reference CAD mesh as input, we first register them together. Then three top-to-down [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Comparison of circle fitting results. (a) Least-square scheme. (b) Our [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figures from the paper (8 more)
Figure 4
Figure 4. Figure 4: The comparison of our method with other state-of-the-art methods. (a) Reference CAD mesh. (b) Scanned point cloud. (c) Ransac [12]. (d) [PITH_FULL_IMAGE:figures/full_fig_p006_4.png]
Figure 5
Figure 5. Figure 5: The error analysis results of our method. (a) Reference CAD model. (b) Scanned point cloud. (c) Registered point cloud. (d) Primitive detection [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]
Figure 7
Figure 7. Figure 7: Comparisons of multi-circle fitting results on a scanned point cloud. [PITH_FULL_IMAGE:figures/full_fig_p007_7.png]
Figure 10
Figure 10. Figure 10: The number of false negatives and false negative [PITH_FULL_IMAGE:figures/full_fig_p009_10.png]
Figure 8
Figure 8. Figure 8: The comparison of our method with other state-of-the-art methods. (a) Reference CAD mesh. (b) Scanned point cloud. (c) Ransac [12]. (d) [PITH_FULL_IMAGE:figures/full_fig_p010_8.png]
Figure 9
Figure 9. Figure 9: Comparisons of multi-circle fitting results on 2D synthetic examples. (a) Input points. (b) KF [30]. (c) T-linkage [26]. (d) MSH [19]. (e) Our result. [PITH_FULL_IMAGE:figures/full_fig_p010_9.png]
Figure 10
Figure 10. Figure 10: Comparisons of multi-circle fitting results on a scanned point cloud. (a) Scanned point cloud. (b) Edge points. (c) KF [30]. (d) T-linkage [26]. (e) [PITH_FULL_IMAGE:figures/full_fig_p011_10.png]
Figure 11
Figure 11. Figure 11: The error analysis results of our method. (a) Reference CAD model. (b) Scanned point cloud. (c) Registered point cloud. (d) Primitive detection [PITH_FULL_IMAGE:figures/full_fig_p011_11.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

31 extracted references · 26 canonical work pages

  1. [1]

    A critical look at the coordinate measuring tech- nique,

    P. J. Swornowski, “A critical look at the coordinate measuring tech- nique,” Mechatronics, vol. 23, no. 1, pp. 80–93, 2013

  2. [2]

    Efficiently registering scan point clouds of 3d printed parts for shape accuracy assessment and modeling,

    N. Decker, Y . Wang, and Q. Huang, “Efficiently registering scan point clouds of 3d printed parts for shape accuracy assessment and modeling,” Journal of Manufacturing Systems , vol. 56, pp. 587–597, 2020

  3. [3]

    Comparison of point cloud data and 3d cad data for on-site dimensional inspection of industrial plant piping systems,

    C. H. P. Nguyen and Y . Choi, “Comparison of point cloud data and 3d cad data for on-site dimensional inspection of industrial plant piping systems,” Automation in Construction , vol. 91, pp. 44–52, 2018

  4. [4]

    Plade: A plane- based descriptor for point cloud registration with small overlap,

    S. Chen, L. Nan, R. Xia, J. Zhao, and P. Wonka, “Plade: A plane- based descriptor for point cloud registration with small overlap,” IEEE Transactions on Geoscience and Remote Sensing , vol. 58, no. 4, pp. 2530–2540, 2019

  5. [5]

    Fast global registration,

    Q.-Y . Zhou, J. Park, and V . Koltun, “Fast global registration,” in Computer Vision–ECCV 2016: 14th European Conference, Part II 14 , 2016, pp. 766–782

  6. [6]

    Hybrid geometry sets for global registration of cross-source geometric data,

    M. Li, S. Peng, and L. Nan, “Hybrid geometry sets for global registration of cross-source geometric data,” International Journal of Applied Earth Observation and Geoinformation , vol. 128, p. 103733, 2024

  7. [7]

    Deepvcp: An end-to-end deep neural network for point cloud registration,

    W. Lu, G. Wan, Y . Zhou, X. Fu, P. Yuan, and S. Song, “Deepvcp: An end-to-end deep neural network for point cloud registration,” in IEEE/CVF international conference on computer vision , 2019, pp. 12– 21

  8. [8]

    Pcrnet: Point cloud registration network using pointnet encoding,

    V . Sarode, X. Li, H. Goforth, Y . Aoki, R. A. Srivatsan, S. Lucey, and H. Choset, “Pcrnet: Point cloud registration network using pointnet encoding,” arXiv preprint arXiv:1908.07906 , 2019

Show all 31 references
  1. [9]

    Deep feature interac- tion network for point cloud registration, with applications to optical measurement of blade profiles,

    M. Yin, Y . Zhu, G. Yin, G. Fu, and L. Xie, “Deep feature interac- tion network for point cloud registration, with applications to optical measurement of blade profiles,” IEEE Transactions on Industrial Infor- matics, 2022

  2. [10]

    Imlovenet: Misaligned image-supported registration network for low-overlap point cloud pairs,

    H. Chen, Z. Wei, Y . Xu, M. Wei, and J. Wang, “Imlovenet: Misaligned image-supported registration network for low-overlap point cloud pairs,” in ACM SIGGRAPH 2022 conference proceedings , 2022, pp. 1–9

  3. [11]

    Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography,

    M. A. Fischler and R. C. Bolles, “Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography,” Communications of the ACM, vol. 24, no. 6, pp. 381–395, 1981

  4. [12]

    Efficient ransac for point-cloud shape detection,

    R. Schnabel, R. Wahl, and R. Klein, “Efficient ransac for point-cloud shape detection,” in Computer graphics forum, vol. 26, no. 2, 2007, pp. 214–226

  5. [13]

    Segmentation of point clouds using smoothness constraint,

    T. Rabbani, F. Van Den Heuvel, and G. V osselmann, “Segmentation of point clouds using smoothness constraint,” International archives of photogrammetry, remote sensing and spatial information sciences , vol. 36, no. 5, pp. 248–253, 2006

  6. [14]

    Finding good configurations of planar primitives in unorganized point clouds,

    M. Yu and F. Lafarge, “Finding good configurations of planar primitives in unorganized point clouds,” in IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , 2022, pp. 6367–6376

  7. [15]

    Pointnet++: Deep hierarchical feature learning on point sets in a metric space,

    C. R. Qi, L. Yi, H. Su, and L. J. Guibas, “Pointnet++: Deep hierarchical feature learning on point sets in a metric space,” Advances in neural information processing systems , vol. 30, 2017

  8. [16]

    Surface and edge detection for primitive fitting of point clouds,

    Y . Li, S. Liu, X. Yang, J. Guo, J. Guo, and Y . Guo, “Surface and edge detection for primitive fitting of point clouds,” in ACM SIGGRAPH 2023 Conference Proceedings, 2023, pp. 1–10

  9. [17]

    An unequal deep learning approach for 3-d point cloud segmentation,

    J. Wang, C. Xu, L. Dai, J. Zhang, and R. Zhong, “An unequal deep learning approach for 3-d point cloud segmentation,” IEEE Transactions on Industrial Informatics , vol. 17, no. 12, pp. 7913–7922, 2020

  10. [18]

    Multiple model fitting as a set coverage prob- lem,

    L. Magri and A. Fusiello, “Multiple model fitting as a set coverage prob- lem,” in IEEE conference on computer vision and pattern recognition , 2016, pp. 3318–3326

  11. [19]

    Searching for representative modes on hypergraphs for robust geometric model fitting,

    H. Wang, G. Xiao, Y . Yan, and D. Suter, “Searching for representative modes on hypergraphs for robust geometric model fitting,” IEEE trans- actions on pattern analysis and machine intelligence , vol. 41, no. 3, pp. 697–711, 2018

  12. [20]

    Robust statistical ap- proaches for circle fitting in laser scanning three-dimensional point cloud data,

    A. Nurunnabi, Y . Sadahiro, and D. F. Laefer, “Robust statistical ap- proaches for circle fitting in laser scanning three-dimensional point cloud data,” Pattern Recognition, vol. 81, pp. 417–431, 2018

  13. [21]

    Shape detection from raw lidar data with subspace modeling,

    J. Wang and K. Xu, “Shape detection from raw lidar data with subspace modeling,” IEEE transactions on visualization and computer graphics , vol. 23, no. 9, pp. 2137–2150, 2016

  14. [22]

    Repcd-net: Feature-aware recurrent point cloud denoising network,

    H. Chen, Z. Wei, X. Li, Y . Xu, M. Wei, and J. Wang, “Repcd-net: Feature-aware recurrent point cloud denoising network,” International Journal of Computer Vision , vol. 130, no. 3, pp. 615–629, 2022

  15. [23]

    Multi-patch collabora- tive point cloud denoising via low-rank recovery with graph constraint,

    H. Chen, M. Wei, Y . Sun, X. Xie, and J. Wang, “Multi-patch collabora- tive point cloud denoising via low-rank recovery with graph constraint,” IEEE transactions on visualization and computer graphics , vol. 26, no. 11, pp. 3255–3270, 2019

  16. [24]

    Method for registration of 3-d shapes,

    P. J. Besl and N. D. McKay, “Method for registration of 3-d shapes,” in Sensor fusion IV: control paradigms and data structures , vol. 1611, 1992, pp. 586–606

  17. [25]

    Multi-scale tensor voting for feature extraction from unstructured point clouds,

    M. K. Park, S. J. Lee, and K. H. Lee, “Multi-scale tensor voting for feature extraction from unstructured point clouds,” Graphical Models , vol. 74, no. 4, pp. 197–208, 2012

  18. [26]

    Fitting multiple heterogeneous models by multi-class cascaded t-linkage,

    L. Magri and A. Fusiello, “Fitting multiple heterogeneous models by multi-class cascaded t-linkage,” in IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2019, pp. 7460–7468

  19. [27]

    Mean shift: A robust approach toward feature space analysis,

    D. Comaniciu and P. Meer, “Mean shift: A robust approach toward feature space analysis,” IEEE Transactions on pattern analysis and machine intelligence, vol. 24, no. 5, pp. 603–619, 2002

  20. [28]

    Hpnet: Deep primitive segmentation using hybrid representations,

    S. Yan, Z. Yang, C. Ma, H. Huang, E. V ouga, and Q. Huang, “Hpnet: Deep primitive segmentation using hybrid representations,” in IEEE/CVF International Conference on Computer Vision , 2021, pp. 2753–2762. JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2021 9

  21. [29]

    Abc: A big cad model dataset for geometric deep learning,

    S. Koch, A. Matveev, Z. Jiang, F. Williams, A. Artemov, E. Burnaev, M. Alexa, D. Zorin, and D. Panozzo, “Abc: A big cad model dataset for geometric deep learning,” in IEEE/CVF conference on computer vision and pattern recognition , 2019, pp. 9601–9611

  22. [30]

    Robust fitting of multiple structures: The statistical learning approach,

    T.-J. Chin, H. Wang, and D. Suter, “Robust fitting of multiple structures: The statistical learning approach,” in IEEE International Conference on Computer Vision, 2009, pp. 413–420

  23. [31]

    Aircraft seam feature extrac- tion from 3d raw point cloud via hierarchical multi-structure fitting,

    J. Dai, M. Wei, Q. Xie, and J. Wang, “Aircraft seam feature extrac- tion from 3d raw point cloud via hierarchical multi-structure fitting,” Computer-Aided Design, vol. 130, p. 102945, 2021. This supplementary material presents additional experi- ments with (i) results of primi...

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.