Computing a Stable, Connected Skeleton from Discrete Data

Abstract

The relationship between the skeleton and the Voronoi diagram for the case of morphologically regular sets is described. Using the discrete-point Voronoi diagram, a practical algorithm is developed to compute an approximate skeleton of a continuous shape from sampled data. The analysis also yields a sampling criterion under which the approximation is stable. The algorithm is applied to a simple test image.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cite

Text

Brandt and Algazi. "Computing a Stable, Connected Skeleton from Discrete Data." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1991. doi:10.1109/CVPR.1991.139773

Markdown

[Brandt and Algazi. "Computing a Stable, Connected Skeleton from Discrete Data." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1991.](https://mlanthology.org/cvpr/1991/brandt1991cvpr-computing/) doi:10.1109/CVPR.1991.139773

BibTeX

@inproceedings{brandt1991cvpr-computing,
  title     = {{Computing a Stable, Connected Skeleton from Discrete Data}},
  author    = {Brandt, Jonathan W. and Algazi, V. Ralph},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1991},
  pages     = {666-667},
  doi       = {10.1109/CVPR.1991.139773},
  url       = {https://mlanthology.org/cvpr/1991/brandt1991cvpr-computing/}
}