Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2011 · 18 citations · 4 references
ComputingComputer ScienceVisualizationComputational GeometryComputer VisionData StructuresCluster DetectionGeometry ProcessingHigh-dimensional Data VisualizationParallel Computational GeometryPoint Cloud ProcessingShape Analysis3D Point Cloud ProcessingCloud ClusteringObject SegmentationPoint Cloud SegmentationPoint Cloud VisualizationPoint Outlier Detection
We present a fast point cloud clustering technique which is suitable for outlier detection, object segmentation and region labeling for large multi-dimensional data sets. The basis is a minimal data structure similar to a kd-tree which enables us to detect connected subsets very fast. The proposed algorithms utilizing this tree structure are parallelizable which further increases the computation speed for very large data sets. The procedures given are a vital part of the data preprocessing. They improve the input data properties for a more reliable computation of surface measures, polygonal meshes and other visualization techniques. In order to show the effectiveness of our techniques we evaluate sets of point clouds from different 3D scanning devices.
4
Numerical recipes in C: the art of scientific computing
Choice Reviews Online · 1993 · 18.1K citations · Full text
Min-cut based segmentation of point clouds
Aleksey Golovinskiy, Thomas F. Funk · 2009 · 293 citations