Set Membership Classification: A Unified Approach to Geometric Intersection Problems

  • Authors:
  • R. B. Tilove

  • Affiliations:
  • Production Automation Project, College of Engineering and Applied Science, University of Rochester

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1980

Quantified Score

Hi-index 14.98

Visualization

Abstract

Many practically important problems in computational geometry may be regarded as a generalization of "clipping," and may be formulated precisely in terms of a function called "membership classification." This function operates on a pair of point sets called the reference and candidate sets; it segments the candidate into three subsets which are "inside," "outside," and "on the boundary of" the reference. Examples of classification problems include clipping, polygon intersection, point inclusion, and solid interference.