Issue No. 10 - October (1980 vol. 29)
R.B. Tilove , Production Automation Project, College of Engineering and Applied Science, University of Rochester
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.
regular sets, Computational geometry, computer graphics, constructive geometry, divide-and-conquer, geometric intersection, geometric modeling, membership classification
R. Tilove, "Set Membership Classification: A Unified Approach to Geometric Intersection Problems," in IEEE Transactions on Computers, vol. 29, no. , pp. 874-883, 1980.