Fast segmentation of range images into planar regions
- 10 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636919,p. 710-711
- https://doi.org/10.1109/cvpr.1991.139793
Abstract
A split-and-merge algorithm is proposed for the segmentation of the digitized surface of a range image into planar regions. The geometric data structure used is a triangular tessellation of image domain. This data structure, combined with an adaptive surface approximation technique, allows a better adaptation of the range image segmentation to the surface boundaries. It also provides an efficient neighborhood referencing mechanism, thus resulting in a fast algorithm.<>Keywords
This publication has 6 references indexed in Scilit:
- Representing stereo data with the Delaunay triangulationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Fast segmentation of range imagery into planar regionsComputer Vision, Graphics, and Image Processing, 1989
- Segmentation through variable-order surface fittingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Segmentation and Classification of Range ImagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Geometric structures for three-dimensional shape representationACM Transactions on Graphics, 1984
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981