Point Symmetry of Convex Digital Regions

Abstract

The authors define point symmetry for convex digital regions. They restrict their attention to convex digital regions that are N-connected. An efficient algorithm is presented to determine the points of symmetry of such regions by eliminating portions of a feasible region. If a convex digital region is not N-connected, the main result still applies and algorithm can still be used after modifications. However, point symmetry for convex digital regions that are not N-connected may not be meaningful.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cite

Text

Robinson and Kim. "Point Symmetry of Convex Digital Regions." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1988. doi:10.1109/CVPR.1988.196298

Markdown

[Robinson and Kim. "Point Symmetry of Convex Digital Regions." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1988.](https://mlanthology.org/cvpr/1988/robinson1988cvpr-point/) doi:10.1109/CVPR.1988.196298

BibTeX

@inproceedings{robinson1988cvpr-point,
  title     = {{Point Symmetry of Convex Digital Regions}},
  author    = {Robinson, Julia and Kim, C. E.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1988},
  pages     = {604-609},
  doi       = {10.1109/CVPR.1988.196298},
  url       = {https://mlanthology.org/cvpr/1988/robinson1988cvpr-point/}
}