2015
DOI: 10.1111/cgf.12720
|View full text |Cite
|
Sign up to set email alerts
|

Planar Shape Detection and Regularization in Tandem

Abstract: We present a method for planar shape detection and regularization from raw point sets. The geometric modelling and processing of man-made environments from measurement data often relies upon robust detection of planar primitive shapes. In addition, the detection and reinforcement of regularities between planar parts is a means to increase resilience to missing or defect-laden data as well as to reduce the complexity of models and algorithms down the modelling pipeline. The main novelty behind our method is to … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
62
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 74 publications
(62 citation statements)
references
References 22 publications
0
62
0
Order By: Relevance
“…These make the planar surface look foggy and thick. To regularize the point cloud, planar shapes are estimated using Region Growing or RANSAC and the points on the estimated planes are redirected using preset regularity relationships, such as parallel, orthogonal or coplanar [18,19]. These methods are mainly used to process dense and uniform point cloud.…”
Section: Related Workmentioning
confidence: 99%
“…These make the planar surface look foggy and thick. To regularize the point cloud, planar shapes are estimated using Region Growing or RANSAC and the points on the estimated planes are redirected using preset regularity relationships, such as parallel, orthogonal or coplanar [18,19]. These methods are mainly used to process dense and uniform point cloud.…”
Section: Related Workmentioning
confidence: 99%
“…They are more robust to noise and perform better than the edge based approaches (Nurunnabi et al, 2015). Oesau et al (2016) proposed a method for planar object detection for unorganized point clouds. Their method uses the K-nearest neighbour (KNN) for determining the neighbours for normal vectors estimation.…”
Section: * Corresponding Authormentioning
confidence: 99%
“…They can be divided into five groups: edge based (Huang & Menq, 2001), robust model fitting (Fischler & Bolles, 1981;Hough, 1962;Oesau et al, 2016;Vosselman & Maas, 2010), scan line based (Jiang & Bunke, 1994;Sithole & Vosselman, 2003) and region/surface growing based (Nurunnabi et al, 2012;Nurunnabi et al, 2015;Oesau et al, 2016;Rabbani, van den Heuvel, & Vosselmann, 2006;Vosselman & Maas, 2010).…”
Section: Introductionmentioning
confidence: 99%
“…Related works differ greatly in the way they detect the planar shapes, depending on the defects in the input point data. Region growing is very efficient in point clouds structured as range images (Boulch et al, 2014, Holz and Behnke, 2012, Oesau et al, 2016, but are not suited to unstructured point clouds due to missing neighborhood linkage. The Hough transform (Hough, 1962, Davies, 2005, popular for detection of primitive shapes in images, is now commonly used for plane detection in point clouds.…”
Section: Related Workmentioning
confidence: 99%