2023
DOI: 10.3390/s23041915
|View full text |Cite
|
Sign up to set email alerts
|

A Novel Type of Boundary Extraction Method and Its Statistical Improvement for Unorganized Point Clouds Based on Concurrent Delaunay Triangular Meshes

Abstract: Currently, three-dimensional (3D) laser-scanned point clouds have been broadly applied in many important fields, such as non-contact measurements and reverse engineering. However, it is a huge challenge to efficiently and precisely extract the boundary features of unorganized point cloud data with strong randomness and distinct uncertainty. Therefore, a novel type of boundary extraction method will be developed based on concurrent Delaunay triangular meshes (CDTMs), which adds the vertex-angles of all CDTMs ar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…The vertical lines of the x and y-axes were drawn according to the boundary grid points to generate rectangular bounding boxes. The discrete points in the non-boundary grid were excluded by triangular meshing in the inner point cloud of the rectangular region, and the discrete points in the boundary grid were identified using the convex hull algorithm (He et al, 2023). Figure 5A shows an example of a minimum convex algorithm.…”
Section: Discrete Point Boundary Extraction Algorithmmentioning
confidence: 99%
“…The vertical lines of the x and y-axes were drawn according to the boundary grid points to generate rectangular bounding boxes. The discrete points in the non-boundary grid were excluded by triangular meshing in the inner point cloud of the rectangular region, and the discrete points in the boundary grid were identified using the convex hull algorithm (He et al, 2023). Figure 5A shows an example of a minimum convex algorithm.…”
Section: Discrete Point Boundary Extraction Algorithmmentioning
confidence: 99%
“…The extraction of the point-cloud boundary of the dump's unloading rock boundary depends on algorithms that can accurately identify the point-cloud boundary. Current algorithms [20] for boundary extraction include those based on geometric features of scattered point-cloud, such as K-NN [21] and alpha-shape [22] algorithms, as well as those based on triangular networks, including Delaunay triangular network boundary extraction [23]. While these methods can achieve better extraction of point-cloud boundary, the extracted data can often be still disordered, leading to complicated and less efficient subsequent processing.…”
Section: Introductionmentioning
confidence: 99%