Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
DOI: 10.1109/cvpr.1991.139793
|View full text |Cite
|
Sign up to set email alerts
|

Fast segmentation of range images into planar regions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
10
0

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 15 publications
(10 citation statements)
references
References 6 publications
0
10
0
Order By: Relevance
“…Instead of a region growing approach used in the merging stage of the algorithm proposed by Schmitt and Chen (1991), we applied a hierarchical approach proposed by Garland et al (2001), which produces less fragmented surfaces while keeping relevant details. By combining these two approaches a fast detection of dominant planar surfaces is achieved.…”
Section: Detection and Representation Of Surface Segmentsmentioning
confidence: 99%
“…Instead of a region growing approach used in the merging stage of the algorithm proposed by Schmitt and Chen (1991), we applied a hierarchical approach proposed by Garland et al (2001), which produces less fragmented surfaces while keeping relevant details. By combining these two approaches a fast detection of dominant planar surfaces is achieved.…”
Section: Detection and Representation Of Surface Segmentsmentioning
confidence: 99%
“…Depth images acquired by a 3D camera are segmented into sets of 3D points representing approximately planar surface segments using a similar split-and-merge algorithm as in [15], which consists of an iterative Delaunay triangulation method followed by region merging. Instead of a region growing approach used in the merging stage of the algorithm proposed in [15], we applied a hierarchical approach proposed in [16] which produces less fragmented surfaces while keeping relevant details. By combining these two approaches a fast detection of dominant planar surfaces is achieved.…”
Section: A Detection and Representation Of Planar Surface Segmentsmentioning
confidence: 99%
“…indoor scenes with large planar surfaces. To generate a triangular mesh from a point cloud we use the algorithm based on recursive triangulation refinement resulting in a Delaunay triangulation proposed in [27]. After the triangulation is completed, each triangle for which the angle between its normal and the optical ray corresponding to one of its vertices is greater than 73° is rejected from the mesh because such triangles mostly represent depth discontinuities rather than an object surface.…”
Section: Segmentation Of 3d Point Clouds Into Approximately Convmentioning
confidence: 99%