Computing the Relative Neighbour Decomposition of a Simple Polygon

Hossam A. ElGindy, Godfried T. Toussaint

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

In computational geometry one may be interested in decomposing a polygon into simpler components, monotone polygons for example, in order to solve the geometric problem at hand more efficiently. However, in pattern recognition, where the motivation is morphological, one is interested in decomposing a polygon into perceptually meaningful parts. Therefore we can relax the strict requirement that the components be of a certain form such as convex or monotone and we can investigate decompositions which are procedure oriented rather than component oriented. In this paper we study the properties of a procedure oriented decomposition, termed the relative neighbour decomposition, and present different algorithms for performing such a decomposition.

Original languageEnglish (US)
Title of host publicationMachine Intelligence and Pattern Recognition
Pages53-70
Number of pages18
EditionC
DOIs
StatePublished - Jan 1 1988

Publication series

NameMachine Intelligence and Pattern Recognition
NumberC
Volume6
ISSN (Print)0923-0459

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Computing the Relative Neighbour Decomposition of a Simple Polygon'. Together they form a unique fingerprint.

  • Cite this

    ElGindy, H. A., & Toussaint, G. T. (1988). Computing the Relative Neighbour Decomposition of a Simple Polygon. In Machine Intelligence and Pattern Recognition (C ed., pp. 53-70). (Machine Intelligence and Pattern Recognition; Vol. 6, No. C). https://doi.org/10.1016/B978-0-444-70467-2.50010-2