Data Reduction of Indoor Point Clouds

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The reconstruction and visualization of three-dimensional point-cloud models, obtained by terrestrial laser scanners, is interesting to many research areas. This paper presents an algorithm to decimate redundant information in real-world indoor point-cloud scenes. The key idea is to recognize planar segments from the point-cloud and to decimate their inlier points by the triangulation of the boundary, describing the shape. To achieve this RANSAC, normal vector filtering, statistical clustering, alpha shape boundary recognition and the constrained Delaunay triangulation are used. The algorithm is tested on various large dense point-clouds and is capable of reduction rates from approximately 75–95%.

Cite

CITATION STYLE

APA

Feichter, S., & Hlavacs, H. (2018). Data Reduction of Indoor Point Clouds. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11112 LNCS, pp. 277–283). Springer Verlag. https://doi.org/10.1007/978-3-319-99426-0_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free