2022
DOI: 10.1016/j.amc.2022.127183
|View full text |Cite
|
Sign up to set email alerts
|

A fast and efficient algorithm for determining the connected orthogonal convex hulls

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0
1

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 26 publications
0
2
0
1
Order By: Relevance
“…Addressing the challenges associated with the high complexity of point cloud surface fitting, where computational efficiency and fitting accuracy are difficult to guarantee simultaneously, this paper constructs a 3D surface point cloud's convex hull [19,20] as illustrated in figure 12(d) and calculates the centroid projection of the relay to precisely locate the contact surface between the relay and the ground, thereby determining the gap distance between the relay's lower surface and the ground.…”
Section: Point Cloud Gap Distancementioning
confidence: 99%
“…Addressing the challenges associated with the high complexity of point cloud surface fitting, where computational efficiency and fitting accuracy are difficult to guarantee simultaneously, this paper constructs a 3D surface point cloud's convex hull [19,20] as illustrated in figure 12(d) and calculates the centroid projection of the relay to precisely locate the contact surface between the relay and the ground, thereby determining the gap distance between the relay's lower surface and the ground.…”
Section: Point Cloud Gap Distancementioning
confidence: 99%
“…A continuación, se presenta el pseudocódigo de cada uno de ellos. a) Algoritmo QuickHull Este algoritmo fue sugerido por diversos investigadores a finales de los 70s [20], [21], y fue llamado QuickHull por Preparata y Shamos en 1985 [16], citado por [19], [22] y [23]. La complejidad del QuickHull según [20] es del orden O(nh), siendo n el número de puntos y h el número de vértices del CH.…”
Section: ) Cálculo Del Convex Hullunclassified
“…The proposed pipeline is illustrated in figure 3. We use the orthogonally convex hulls generated from the -QUICKHULL algorithm [16] to segment full pothole candidates more precisely. However, a pothole shade candidate can only be transformed into a full pothole using convex hulls, as the orthogonally convex hulls will only capture the shade region.…”
mentioning
confidence: 99%