An algorithm for computing the union, intersection or difference of two polygons. - Avraham Margalit; Gary D. Knott (Comput. Graph., 1989)

A parallel algorithm to generate a Markov random field image on a SIMD hypercube machine. - Avraham Margalit (Pattern Recognit. Lett., 1989)

Using feature probabilities to reduce the expected computational cost of template matching. - Avraham Margalit; Azriel Rosenfeld (Comput. Vis. Graph. Image Process., 1990)

Using probabilistic domain knowledge to reduce the expected computational cost of template matching. - Avraham Margalit; Azriel Rosenfeld (Comput. Vis. Graph. Image Process., 1990)

Reducing the expected computational cost of template matching using run length representation. - Avraham Margalit; Azriel Rosenfeld (Pattern Recognit. Lett., 1990)

Matching general polygonal arcs. - Behzad Kamgar-Parsi; Avraham Margalit; Azriel Rosenfeld (CVGIP Image Underst., 1991)