IPOL Journal · Image Processing On Line
- published
- 2019-01-19
- reference
- Christoph Dalitz, Jens Wilberg, and Lukas Aymans, TriplClust: An Algorithm for Curve Detection in 3D Point Clouds, Image Processing On Line, 9 (2019), pp. 26–46. https://doi.org/10.5201/ipol.2019.234
Communicated by José Lezama
Demo edited by José Lezama
Abstract
In this article, we describe an algorithm for detecting and separating curves in 3D point clouds without making a priori assumptions about their parametric shape. The algorithm is called 'TriplClust' because it is based on the idea of clustering point triplets instead of the original points. We define a distance measure on point triplets and then apply a single-link hierarchical clustering on the triplets. The clustering process can be controlled by several parameters, which are described in detail, and suggestions for reasonable choices for these parameters based on the input data are made. Moreover, we suggest a simple criterion for stopping the single link clustering automatically.
Download
- full text manuscript: PDF (858KB)
- source code: TAR/GZ
Supplementary Materials
Available datasets:
History
- Note from the editor: the source code was updated on April 2, 2019 to correct a bug which occasionally converted floats to integers. With the corrected code, floats are always printed as floats. The original version is available here.
- Note from the editor: the manuscript of the article was modified on 2022-01-01 to include information about its editors. The original version of the manuscript is available here.
