2010 IEEE International Conference on Mechatronics and Automation 2010
DOI: 10.1109/icma.2010.5588579
|View full text |Cite
|
Sign up to set email alerts
|

Fast planar clustering and polygon extraction from noisy range images acquired in indoor environments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
10
0

Year Published

2011
2011
2018
2018

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(10 citation statements)
references
References 17 publications
0
10
0
Order By: Relevance
“…The work of Weingarten et al [10] and Kaushik et al [13] is closely related to our novel algorithm. In [10], the point cloud was discretized into small partitions.…”
Section: Introductionmentioning
confidence: 85%
See 4 more Smart Citations
“…The work of Weingarten et al [10] and Kaushik et al [13] is closely related to our novel algorithm. In [10], the point cloud was discretized into small partitions.…”
Section: Introductionmentioning
confidence: 85%
“…Like our point-based region growing algorithm, the seed is selected first, then it is extended by considering its neighbors. Compared to [13], our algorithm computes the plane parameters for the growing region whenever a new grid is added. This is advantageous for plane SLAM which cannot be performed without plane parameters.…”
Section: Grid-based Region Growingmentioning
confidence: 99%
See 3 more Smart Citations