Fast Segmentation of Range Images into Planar Regions

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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cite

Text

Schmitt and Chen. "Fast Segmentation of Range Images into Planar Regions." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1991. doi:10.1109/CVPR.1991.139793

Markdown

[Schmitt and Chen. "Fast Segmentation of Range Images into Planar Regions." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1991.](https://mlanthology.org/cvpr/1991/schmitt1991cvpr-fast/) doi:10.1109/CVPR.1991.139793

BibTeX

@inproceedings{schmitt1991cvpr-fast,
  title     = {{Fast Segmentation of Range Images into Planar Regions}},
  author    = {Schmitt, Francis and Chen, Xin},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1991},
  pages     = {710-711},
  doi       = {10.1109/CVPR.1991.139793},
  url       = {https://mlanthology.org/cvpr/1991/schmitt1991cvpr-fast/}
}